@article{gregg_hopkins_karber_milligan_sharp_2017,
title={Several Bounds for the K-Tower of Hanoi Puzzle},
DOI={10.1515/rmm-2017-0015},
abstractNote={Abstract
We consider special cases of a modified version of the Tower of Hanoi puzzle and demonstrate how to find upper bounds on the minimum number of moves that it takes to complete these cases.},
publisher={Walter de Gruyter GmbH},
author={Gregg and Hopkins and Karber and Milligan and Sharp},
year={2017},
month={May}
}