){kind=icon}
Learn to Solve the Tower of Hanoi
开发者 pyxl
添加到主屏幕，快捷访问
安装此游戏
点击分享按钮，然后选择“添加到主屏幕”以便快速访问此游戏。
){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}
Learn to Solve the Tower of Hanoi
Learn to Solve the Tower of Hanoi 的标签
简介
通过这款简单的游戏学习如何解开著名的汉诺塔难题。包含多种学习和练习方式。
玩法说明
鼠标操作
开发者更新
Edit (6.12.2010):
I realize that there are iterative solution methods that are perhaps a tad easier to learn. However, the method described in “how to solve…” is the only one I know of that allows one to correctly deduce the next move WITHOUT having to know the previous move and without all previous moves having to be correct.
评论
)
Eklipsed
Dec. 05, 2010
I got this puzzle as a gift in Tibet when i was 11. I was told to do one move a day to help relax. I'm 27 now and am still working on it. I dunno if I'll ever finish it.
)
PwnBadges
Dec. 05, 2010
I can't complete this without guidance
)
einstein00
Dec. 05, 2010
recursion FTW
)
kizen
Dec. 06, 2010
4095 moves for a tower of 12? i don't even want to know how long that would take... maybe 1/2 hour in real life? but due to how many times i missed the pole by not dragging a block to it exactly i could see it taking a few hours...
){kind=avatar}
vice123
Dec. 06, 2010
really well made
)
){kind=avatar}
)
)
)
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}
){kind=icon}