Username: 
Password: 
Restrict session to IP 
Questions  |  score: 3  |  Solved By 182 People  |  38018 views  |  since Jul 16, 2008 - 23:19:01

Towers of Hanoi (Java, Cracking)

Your mission is to move the stack from the left peg to the right peg. The rules are well known:

  • Only one disk may be moved at a time.
  • Each move consists of taking the upper disk from one of the pegs and sliding it onto another rod, on top of the other disks that may already be present on that rod.
  • No disk may be placed on top of a smaller disk.

And finally to prove that you are a genius and a master of mouse handling, you have a timelimit of 60 seconds.
© 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016 and 2017 by Z