
TL;DR
This paper generalizes the classic Towers of Hanoi game to binary trees, providing a straightforward solution, a shorter optimized solution, and proving its optimality.
Contribution
It introduces a novel binary tree generalization of the Towers of Hanoi and presents an optimal solution with proof of minimal moves.
Findings
Presented a straightforward solution for the binary tree version.
Developed a shorter, optimized solution.
Proved the optimality of the new solution.
Abstract
The game of the Towers of Hanoi is generalized to binary trees. First, a straightforward solution of the game is discussed. Second, a shorter solution is presented, which is then shown to be optimal.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games
