Tower of Hanoi
Monday, 8 April 2019
11:08 AM
(Larger discs cannot be placed on smaller discs)
Let  to be the minimal number of moves required to
shift a pile of  rings from one peg to another![]()
For one ring:
Shift ring 1 to B
![]()
For two rings:
Shift ring 1 to C
Shift ring 2 to B
Shift ring 1 to B
![]()
For three rings:
Shift the first two
rings to C ()![]()
Shift ring 3 to B
Shift ring 1 and ring
2 to B ()![]()
![]()
 rings:![]()
Shift the first  rings to C![]()
Shift the last ring to B
Shift the first  rings to B![]()
![]()
Created with Microsoft OneNote 2016.