文件名称:Hanogkhk
介绍说明－－下载内容均来自于网络，请自行研究使用
用递规子程序的方法实现HANOI塔问题.子程序模块个数不限.
要求: 盘子个数可以输入,第一个塔为A,第二个塔为B,第三个塔
的名称为C.打印出移动过程.
-regulation subroutine with the delivery method HANOI Tower. Open-number subroutine modules. Requirements : Number plate can be imported, a Tower A, the second tower B, the third tower in the name of C. Print Mobile process.
要求: 盘子个数可以输入,第一个塔为A,第二个塔为B,第三个塔
的名称为C.打印出移动过程.
-regulation subroutine with the delivery method HANOI Tower. Open-number subroutine modules. Requirements : Number plate can be imported, a Tower A, the second tower B, the third tower in the name of C. Print Mobile process.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Hanoi.asm