<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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.</p></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.

Several Bounds for the K-Tower of Hanoi Puzzle

Recreational Mathematics Magazine

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"Several Bounds for the K-Tower of Hanoi Puzzle"}

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...

Several Bounds for the K-Tower of Hanoi Puzzle

Article Category: Games and Puzzles

Data publikacji: 09 cze 2017

Zakres stron: 79 - 118

DOI: https://doi.org/10.1515/rmm-2017-0015

Słowa kluczowe
Tower of Hanoi Puzzle, minimum number of moves

© 2017

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Several Bounds for the K-Tower of Hanoi Puzzle

Article Category: Games and Puzzles

Data publikacji: 09 cze 2017

Zakres stron: 79 - 118

DOI: https://doi.org/10.1515/rmm-2017-0015

Słowa kluczoweTower of Hanoi Puzzle, minimum number of moves

© 2017

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Słowa kluczowe
Tower of Hanoi Puzzle, minimum number of moves