文件名称:hannuota
- 所属分类:
- 人工智能/神经网络/遗传算法
- 资源属性:
- [Windows] [Visual C] [源码]
- 上传时间:
- 2012-11-26
- 文件大小:
- 83kb
- 下载次数:
- 0次
- 提 供 者:
- 王**
- 相关连接:
- 无
- 下载说明:
- 别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容均来自于网络,请自行研究使用
一个塔台,台上有3根标号为A,B,C的用钻石做成的柱子,在A柱子上放着64个金盘,每一个都比下面的略小一些。把A柱子上的金盘子全部移到C柱上的那一天就是世界末日。移到的条件是:一次只能移到一个金盘,移到过程中大金盘不能放在小金盘上面。庙里的僧人一直在移个不停。因为全部的移动是264-1次,如果每秒移动一次的话需要500亿年-A tower on the stage with three labeled A, B, C of the columns made with diamonds, stood in the A pillar 64 gold plate, each slightly smaller than the following. A pillar of the golden plates to move all of column C is the end of the world that day. Moved to the condition that: you can only move to a gold disk, disk can not move the process on the golden plate Daikin above. Temple of monks have been moved off the hook. As all movement is 264-1 times, if the move once per second needs 500 million years, then
(系统自动生成,下载前可以参看下载内容)
下载文件列表
汉诺塔\3_12.cpp
......\3_12.dsp
......\3_12.dsw
......\3_12.ncb
......\3_12.opt
......\3_12.plg
......\Debug\3_12.exe
......\.....\3_12.ilk
......\.....\3_12.obj
......\.....\3_12.pch
......\.....\3_12.pdb
......\.....\vc60.idb
......\.....\vc60.pdb
......\汉诺塔.doc
......\Debug
汉诺塔
......\3_12.dsp
......\3_12.dsw
......\3_12.ncb
......\3_12.opt
......\3_12.plg
......\Debug\3_12.exe
......\.....\3_12.ilk
......\.....\3_12.obj
......\.....\3_12.pch
......\.....\3_12.pdb
......\.....\vc60.idb
......\.....\vc60.pdb
......\汉诺塔.doc
......\Debug
汉诺塔