%0 Journal Article
%T The Tower of Hanoi and finite automata
%A Jean-Paul Allouche
%A Jeff Shallit
%J Mathematics
%D 2009
%I arXiv
%X Some of the algorithms for solving the Tower of Hanoi puzzle can be applied "with eyes closed" or "without memory". Here we survey the solution for the classical Tower of Hanoi that uses finite automata, as well as some variations on the original puzzle. In passing, we obtain a new result on morphisms generating the classical and the lazy Tower of Hanoi, and a new result on automatic sequences.
%U http://arxiv.org/abs/0905.0015v1