Search - hanoi - CodeBus

Search - hanoi - List

[Streaming Mpeg4] ChineseTa DL : 0: 解决汉诺塔移动的问题，问题的提出：传说婆罗门庙里有一个塔台，台上有3根标号为A,B,C的用钻石做成的柱子，在A柱子上放着64个金盘，每一个都比下面的略小一些。把A柱子上的金盘子全部移到C柱上的那一天就是世界末日。移到的条件是：一次只能移到一个金盘，移到过程中大金盘不能放在小金盘上面。庙里的僧人一直在移个不停。因为全部的移动是264－1次，如果每秒移动一次的话需要500亿年-Tower of Hanoi to resolve the issue of moving, the problem: Once a Brahmin temple tower, the platform for the three grade A, B, C s use of diamonds made of columns, placed in the A pillar 64 gold , each slightly smaller than some of the following. A column on the gold plate all to C column is the day the end of the world. Moved to the condition that: one can only move to a gold disk, move the process can not be placed on disk Daikin xiaojinensis plate above. The temple s monks have been moved away. Because all the movement is 264-1 times that if the second mobile once every 500 million years
Date : 2025-12-25 Size : 8kb User : 杨伟伟