Class 7: Nov 19

Blogged by: Tinu Lawrence
Today in class we learnt about the Tower of Hanoi algorithm and how to solve the problem when 4 discs are used.

http://webcache.googleusercontent.com/search?q=cache:xA-NRvipzAYJ:www.towerofhanoi.net/+tower+of+hanoi&cd=9&hl=en&ct=clnk&gl=in

http://webcache.googleusercontent.com/search?q=cache:CfWV2h-cFL4J:en.wikipedia.org/wiki/Tower_of_Hanoi+tower+of+hanoi&cd=1&hl=en&ct=clnk&gl=in

http://webcache.googleusercontent.com/search?q=cache:FEL19xlmhl8J:www.cut-the-knot.org/recurrence/hanoi.shtml+tower+of+hanoi&cd=2&hl=en&ct=clnk&gl=in