12.4.9

Write up your solution to the Tower of Hanoi problem.

Include:

  • A table showing the minimum number of moves for 1-10 discs
  • A pattern or formula for determining the number of moves for any number of discs.
  • An explanation or theory about how the formula/rule relates to the actual way the discs move. (about one paragraph)

Comments are closed.