Loading...
Uploaded by chaintennen on Aug 31, 2006
This is a wonderful puzzle game "Tower of Hanoi" of France.ハノイの塔をなんとなくしてみました。やったことない人は検索。殆どの人からは鼻で笑われるような出来ですが、まあノリです。はい。
Entertainment
Standard YouTube License
ok for all the ones here claiming about millions of moves to do a 3 one:
The task is an recessive algorithm. so u have to calculate:
2^n -1 ( n is the number of rings )
@ 3: 2^3 -1 = 7
@ 5 : 2^5-1 = 31 etc
Ueberlegsdir2mal 2 years ago
The algorithm for the amount of moves is 2^n-1, n being the amount of rings. And thats fast... lol.
TheInsainMrK 3 years ago
Thats alot of explanation points for so few words!
Oops...0_o
Please excuse the brain fart.
Outtamahway 4 years ago
only takes 7
255 is for like 8
hoffster12 4 years ago
You could solve it much faster if you move two pieces at the same time (I know, my fastest time was about 51 seconds with 7 discs).
fish0000001 4 years ago
cha hieu cai dit gi ca?
vietn20003 4 years ago
great going ^_^ and you are right it is a wonderful game ^_^
gniziemazity 4 years ago
Brilliant.
NarutoSeme 5 years ago
Load more suggestions
ok for all the ones here claiming about millions of moves to do a 3 one:
The task is an recessive algorithm. so u have to calculate:
2^n -1 ( n is the number of rings )
@ 3: 2^3 -1 = 7
@ 5 : 2^5-1 = 31 etc
Ueberlegsdir2mal 2 years ago
The algorithm for the amount of moves is 2^n-1, n being the amount of rings. And thats fast... lol.
TheInsainMrK 3 years ago
Thats alot of explanation points for so few words!
TheInsainMrK 3 years ago
Oops...0_o
Please excuse the brain fart.
Outtamahway 4 years ago
only takes 7
255 is for like 8
hoffster12 4 years ago
You could solve it much faster if you move two pieces at the same time (I know, my fastest time was about 51 seconds with 7 discs).
fish0000001 4 years ago
cha hieu cai dit gi ca?
vietn20003 4 years ago
great going ^_^ and you are right it is a wonderful game ^_^
gniziemazity 4 years ago
Brilliant.
NarutoSeme 5 years ago