Flash End-of-Life, Ruffle Integration!
This game runs on Adobe Flash. Effective Jan. 2021, Adobe began blocking its flash player's use everywhere. Kongregate is now partnering with Ruffle to make some of our Flash content playable again. Please note: If you are using Ruffle, badges will not work normally. In order to earn a badge in a Flash game, you will need to complete the badge, then submit a screenshot (showing both proof of completion and your username) as a missing badge report using the report missing achievement option. Also, please join us in the Kongregate Discord for all the latest Kongregate news!
){kind=icon}
The towers of Hanoi Game
The towers of Hanoi Game
by YouGame
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
The towers of Hanoi Game
The towers of Hanoi Game의 태그
설명
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.
플레이 방법
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.
댓글
)
TJP12409
May. 10, 2010
@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
Jul. 13, 2010
beat 10 discs in 1023 thats minimum number of moves
)
NEOterrorOG
Oct. 27, 2009
Beat it on an Iphone
)
qweenqueer
Aug. 12, 2009
badges!!!!!!!!!!!!!!
)
happyman12
Feb. 25, 2009
BADGES!!!!!!!!!!!!!!!!!!!!!!!!
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}