Solo assignment 1 — Towers of Hanoi
The basic solution, the optimal solution when only adjacent pegs may be used, and why it takes 3ⁿ−1 moves
Period: Weeks 7–8 Due: Tue 10 Nov, 23:59
This assignment is not open yet
The problems open in the lab week they belong to. It is listed here so you can see what the term asks for and when.