Adhish's Home‎ > ‎Code‎ > ‎

The Tower of Hanoi

I came across this game during a class of combinatorics. We had to find out the minimum number of moves required to solve the problem. The answer is (2^n)-1 for n discs. Let's see if you can do it!!
SelectionFile type iconFile nameDescriptionSizeRevisionTimeUser
ċ

Download
Place this in your include directory  1k v. 1 Nov 8, 2008, 2:09 AM Adhish Majumdar
ċ

Download
Source Code  5k v. 1 Nov 8, 2008, 2:09 AM Adhish Majumdar
Comments