The Tower of Hanoi and finite automata

Details The Tower of Hanoi and finite automata The Tower of Hanoi and finite automata

2009-04-30

arxiv.org/abs/0905.0015v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Tower of Hanoi and finite automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Tower of Hanoi and finite automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Tower of Hanoi and finite automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-275865