The towers of Hanoi Game

The towers of Hanoi Game

autor YouGame
Zgłoś błąd
Zgłoś grę
Najlepsze
Retro Bowl
Najlepsze
The Enchanted Cave 2
Najlepsze
The King's League: Odyssey
Najlepsze
Swords and Souls
Najlepsze
Kingdom Rush Frontiers
Najlepsze
SAS: Zombie Assault 4
Najlepsze
UnpuzzleX
Najlepsze
Kingdom Rush
Najlepsze
Bloons TD 5
Najlepsze
Bit Heroes
Najlepsze
Epic Battle Fantasy 4
Najlepsze
Fleeing the Complex
Najlepsze
Bloons Monkey City
🔥 Na czasie
NGU IDLE
Najlepsze
Mutilate-a-Doll 2
Najlepsze
Learn to Fly 3
Najlepsze
Learn to Fly 2
Najlepsze
Escape Game - Computer Office Escape
Najlepsze
Incremancer
Najlepsze
Epic Battle Fantasy 5
Loading ad...

The towers of Hanoi Game

Ocena:
2.5
Data wydania: July 21, 2008
Ostatnia aktualizacja: July 21, 2008
Twórca: YouGame

Tagi dla The towers of Hanoi Game

Opis

The Towers of Hanoi is an ancient puzzle played with three stacks and any number of differently-sized disks. At the start, all the disks are in the leftmost stack, with the largest disk on the bottom and the smallest on the top. The object is to get all the disks over to the rightmost stack.

You can only move one disk per move, and you can only move the top disk on a stack. The top disk of any stack can be moved to the top disk of any other stack, with the restriction that you can't move a larger disk on top of a smaller disk i.e., disks can only be moved to empty stacks or on top of larger disks.

minimum number of movement for the disk is by using the mathematical formula 2n-1.where N is the number of disk in stack.

Jak grać

The Towers of Hanoi is an ancient puzzle played with three stacks and any number of differently-sized disks. At the start, all the disks are in the leftmost stack, with the largest disk on the bottom and the smallest on the top. The object is to get all the disks over to the rightmost stack.

You can only move one disk per move, and you can only move the top disk on a stack. The top disk of any stack can be moved to the top disk of any other stack, with the restriction that you can't move a larger disk on top of a smaller disk i.e., disks can only be moved to empty stacks or on top of larger disks.

minimum number of movement for the disk is by using the mathematical formula 2n-1.where N is the number of disk in stack.

Komentarze

0/1000
TJP12409 avatar

TJP12409

May. 10, 2010

2
1

@MrCookie, to solve the tower of hanoi with 64 disks would take over 18 quintillion (thats 18 zeros!) AND if you were able to move one piece per second, it would take over 100 billion years. The earth has existed for 4 billion. Lastly, thats simply from a legend of the temple of hanoi, where priests moved the disks and when it was completed the world would end. even if they started when the earth FIRST FORMED, we still have 96 billion years to go. Even so, the temple itself is a myth so really, its not SUPPOSED to be played with 64, its just what came from the legend.

nflstar1112 avatar

nflstar1112

Jul. 13, 2010

1
1

beat 10 discs in 1023 thats minimum number of moves

NEOterrorOG avatar

NEOterrorOG

Oct. 27, 2009

1
1

Beat it on an Iphone

qweenqueer avatar

qweenqueer

Aug. 12, 2009

1
1

badges!!!!!!!!!!!!!!

happyman12 avatar

happyman12

Feb. 25, 2009

1
1

BADGES!!!!!!!!!!!!!!!!!!!!!!!!

Sonic Rpg eps 1 sonicbw edition
Water Dash!
Najlepsze
Uber Breakout II
Blang
Parachute Retro
- Circlo -
Straight Dice
Sonic Rpg Michael Vs Black Hedgehogs eps 1
Najlepsze
Ball Revamped 2: Metaphysik
Parking Perfection 2