The tower of hanoi is a classic puzzle that's really fun to solve. I found a link to an online version of it here. Basically, there are three pegs. You have to move the tower of rings to the farthest right peg, but here's the catch: You can only place rings on top of the ground or on top of a ring that's smaller than it. It's an algorithm that takes time to get used to, but it's fun to do once you do get it! Oh, and watch the computer do the 12 ring one with the speed set to the highest. If you can solve the 12 ring tower of hanoi, I will honor you here:
People who have solved 12 rings:
none!
Offline
I know how to do it...just havn't done it yet.
Offline
I'm doing it...it takes FOREVER...but I know how to.
Basic principle: If you have an odd number of rings you need to move, put your smallest on the place you're moving to. If it's and even amount, put it on the other tower.
EDIT: After over an hour:
I STILL haven't even moved the largest two rings once!
Last edited by AtomicBawm3 (2011-05-06 15:39:15)
Offline
Beat it:
I took almost 2000 more moves though. I messed up at the very beginning and didn't feel like restarting. I also screwed up a couple of times through out, but I got it!
Offline