在APKPure安全快速地下载APK
APKPure 使用签名验证功能，确保为您提供无病毒的 Hanoi Towers APK 下载。
关于Hanoi Towers
难题的目的是将整个堆栈移动到另一根杆上
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
Only one disk can be moved at a time.
Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
No larger disk may be placed on top of a smaller disk.
With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.
最新版本1.0的更新日志
Last updated on 2020年02月08日
Minor bug fixes and improvements. Install or update to the newest version to check it out!
游戏玩法和屏幕截图
感谢您的评分和反馈！
您已经评分了。