The Tower of Hanoi and finite automata
From MaRDI portal
Publication:6213752
arXiv0905.0015MaRDI QIDQ6213752FDOQ6213752
Authors: Jean-Paul Allouche, Jeff Shallit 
Publication date: 30 April 2009
Abstract: 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.
This page was built for publication: The Tower of Hanoi and finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6213752)
