Edit made on March 03, 2009 by DerekCouzens at 07:37:04
Deleted text in red /
Inserted text in green
[[[> IMG:Tower.jpg ]]]
A mathematically interesting children's toy consisting of 3 rods and a number of graduated discs, each with a hole. The discs are stacked on one of the rods in order of size with the largest on the bottom.
The object is to move all the discs eventually on to one of the other rods with the limitation that:
* only one disc is moved at a time
* only the top disc of any stack can be moved
* no disc can be placed on a smaller disc
The main problems are to find the move order and minimum number of moves for a particular number of discs.
The main problems are to find the move order and formula for the minimum number of moves for a particular number of discs.
A useful site to practice is: http://nlvm.usu.edu/en/nav/frames_asid_118_g_2_t_2.html?from=category_g_2_t_2.html