Towers of Hanoi
I've written the program and it is currently running...and running...and running. My teacher wants us to test it for 100 disks. Some other classmates said this ran for days...is that correct? I know it will be slightly different for everyone, depending on the speed of their computer. Does anyone have a guess as to the range I could be looking at?
Have any of you had to test for 100 disks before? How long did it take?
Have any of you had to test for 100 disks before? How long did it take?
for n disk Tower of hanoi require 2^n-1 moves so, you can think about
2^100-1.
its 1.27 x 10^30 it will not run on simple computer.
even Frame-Stewart algorithm has proven optimal solution upto 30disks.
2^100-1.
its 1.27 x 10^30 it will not run on simple computer.
even Frame-Stewart algorithm has proven optimal solution upto 30disks.
Topic archived. No new replies allowed.