Acerca de este artículo
Article Category: Games and Puzzles
Publicado en línea: 09 jun 2017
Páginas: 79 - 118
DOI: https://doi.org/10.1515/rmm-2017-0015
Palabras clave
© 2017
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
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.