Location:
Search - hanoi.asm
Search list
Description: 汇编语言实现汉诺塔移动问题，显示每次移动码盘的源轴和目标轴。是汇编程序asm语言中子过程调用方面的课题，为程序嵌套
Platform: |
Size: 127828 |
Author: 侯伟 |
Hits:
Description: 用汇编编写的河内塔程序 将第一柱a上n-1个盘借助第二柱c移到第三柱b 把a上剩下的一个盘移到c 将n-1个盘从b借助a移到第三柱c 这三步是图示河内塔的根本方法 功能一：自己动手移动河内塔 先按左右键选择要移的盘，按箭头上键确定 再按左右键移到要的盘 如此，再根据河内塔的规则确定较好的次数step2 功能二：图示河内塔移动过程 根据河内塔的基本方法，确定图象，按任意键选下一步，（开始时输入level）- A n-1 plate transfers to with the assembly compilation Hanoi
tower procedure first column a on with the aid of second column c
third column b a plate which is left over a on to transfer to c to
transfer to a n-1 plate from b with the aid of a third column c these
three step is the graphical representation Hanoi tower basic method
function one: About own begin to move the Hanoi tower first to press
the plate which the key elects 鎷╄
Platform: |
Size: 214016 |
Author: 吴晓辉 |
Hits:
Description: 汇编语言实现汉诺塔移动问题，显示每次移动码盘的源轴和目标轴。是汇编程序asm语言中子过程调用方面的课题，为程序嵌套-Assembly Language realize mobile Tower of Hanoi problem, show that each mobile source encoder shaft axis and objectives. Asm assembler language is a process called neutron aspects, for the nested procedures
Platform: |
Size: 128000 |
Author: 侯伟 |
Hits:
Description: 递归方法实现HANOI塔问题
子程序模块个数不限。要求: 盘子个数可以输入,第一个塔为A,第二个塔为B,第三个塔的名称为C。打印出移动过程。
-Recursive methods HANOI tower realize the number of open issues subroutine modules. Requirements: the number plate can enter, the first tower for A, the second tower for the B, the third tower of the name C. Print out the move.
Platform: |
Size: 6144 |
Author: 婷婷 |
Hits:
Description: 用c实现数据结构、Winsock2编程、鼠标编程、asm嵌入式编程、汉诺塔问题、效验算法、N皇后问题回溯算法、骑士遍历、文件加密、万年历的算法，很好很强大-Data structure using c implementation, Winsock2 programming, mouse programming, asm embedded programming, Tower of Hanoi problem, well-tested algorithm, N Queen' s problem backward algorithm, Knight traversal, file encryption, calendar of the algorithm, very good very strong. . .
Platform: |
Size: 315392 |
Author: chyjp |
Hits: