The Trees of Hanoi
Formal Languages and Automata Theory
2017-10-13 v1 Data Structures and Algorithms
History and Overview
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.
Cite
@article{arxiv.1710.04551,
title = {The Trees of Hanoi},
author = {Joost Engelfriet},
journal= {arXiv preprint arXiv:1710.04551},
year = {2017}
}
Comments
11 pages, slightly revised version of a note from 1981