Tower of Hanoi. AE1APS Algorithmic Problem Solving John Drake. Outline of the course. Invariants – Chapter 2 River Crossing – Chapter 3 Logic Puzzles – Chapter 5 Matchstick Games - Chapter 4 Sum Games – Chapter 4 Induction – Chapter 6 Tower of Hanoi – Chapter 8. A recap on induction.
AE1APS Algorithmic Problem Solving
– base case (i.e. 0 moves needed)
– induction step (move n discs in a given direction, move the n+1th disc in the opposite direction then move n discs again in the same direction)