Towers Of Hanoi for Chrome

插件截图

插件概述

Towers Of Hanoi for Chrome

插件详情

Towers of Hanoi classical puzzle, shift the tower without placing a large piece on a smaller one. A great challenge for smart people!

The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower and sometimes pluralized) is a mathematical game or puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.

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 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.

其他信息

官方唯一标识:ofaagagm****************mnkhilao

官方最后更新日期:2018年9月28日

分类:娱乐

大小:25.64KiB

版本:1.7

语言:English

提供方:none

星级:5

插件下载

下载链接一     下载链接二

Chrome插件离线安装教程

温馨提示

本站中的部份内容来源网络和网友发布，纯属个人收集并供大家交流学习参考之用，版权归版权原作者所有。

如果您发现网站上有侵犯您的知识产权的作品，请与我们取得联系，我们会及时修改或删除。

如果您觉得网多鱼对您有帮助，欢迎收藏我们 Ctrl+D。