Play the Tower of Hanoi puzzle game here:


var data, p; var agt=navigator.userAgent.toLowerCase(); p='http'; if((location.href.substr(0,6)=='https:')||(location.href.substr(0,6)=='HTTPS:')) {p='https';} data = '&r=' + escape(document.referrer) + '&n=' + escape(navigator.userAgent) + '&p=' + escape(navigator.userAgent) + '&g=' + escape(document.location.href); if(navigator.userAgent.substring(0,1)>'3') {data = data + '&sd=' + screen.colorDepth + '&sw=' + escape(screen.width+ 'x'+screen.height)};document.write(''); document.write(''); document.write('');
Free Traffic Stats
The object of the Tower of Hanoi puzzle game is to move all the disks from tower 1 to tower 3 in the least amount of moves.
You may move ONLY one disk at a time.
A larger disk can not ever be put on top of a smaller disk.
You can choose between 3 and 8 disks for this Tower of Hanoi puzzle game.
The 'minimum no. of moves', which is how you win the game is based on a simple mathematic formula which is explained below (see 'The Math').
Tower of Hanoi
No. of disks
Minimum no. of moves  
Your no. of moves


Though it is beyond the scope of this page, the solutions to the Tower of Hanoi puzzle game is directly related to the number of disks involved or chosen.
The equation is as follows: minimum no. of moves = (2^n -1), or in words:
the solution to any Tower of hanoi puzzle game is equal to 2 raised to the power of n minus one, where n represents the number of disks.
As an example if we have a t.o.h. with three disks, the minimum no. of moves would be 2*2*2 - 1, or 8 - 1 = 7.