文件名称:TowerHanoiproblem
介绍说明--下载内容来自于网络,使用问题请自行百度
约19世纪末,在欧州的商店中出售一种智力玩具,在一块铜板上有三根杆,最左边的杆上自上而下、由小到大顺序串着由64个圆盘构成的塔。目的是将最左边杆上的盘全部移到右边的杆上,条件是一次只能移动一个盘,且不允许大盘放在小盘的上面。这就是著名的汉诺塔问题-About the late 19th century, in Europe the sale of stores in an intellectual toys, there is a piece of copper rod 3, the far left post from top to bottom, small to large order from the string consisting of 64 disk tower. The aim is to reach the far left to the right side of the plate all the poles, on the condition that a disc can only move and do not allow the market on the small of the above. This is the famous Tower of Hanoi problem
(系统自动生成,下载前可以参看下载内容)
下载文件列表
TowerHanoiproblem.doc
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.