Search - hanoi - CodeBus

Search - hanoi - List

[AI-NN-PR] Hanno DL : 0: 这是用prolog编写的汉诺塔小程序，包括了源程序以及相关的实验说明文档。可直接在prolog中运行。-It is written in prolog Tower of Hanoi applet, including source code and related documentation of experiments. Can be run directly in the prolog.
Date : 2025-12-25 Size : 7kb User : 唐婉
[AI-NN-PR] hannuota DL : 0: 汉诺塔代码A*算法，根据人工智能提供的算法思路，编写的程序-Tower of Hanoi code A* algorithm
Date : 2025-12-25 Size : 3kb User : tangyuxi
[AI-NN-PR] hannuota DL : 0: 汉诺塔。。传说婆罗门庙里有一个塔台，台上有3根标号为A,B,C的用钻石做成的柱子，在A柱子上放着64个金盘，每一个都比下面的略小一些。把A柱子上的金盘子全部移到C柱上的那一天就是世界末日。移到的条件是：一次只能移到一个金盘，移到过程中大金盘不能放在小金盘上面。庙里的僧人一直在移个不停。因为全部的移动是264－1次，如果每秒移动一次的话需要500亿年。-Tower of Hanoi. . Legend of a Brahmin temple tower, the platform has three labels as 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 second move would require 50 billion a year.
Date : 2025-12-25 Size : 8kb User : yinlingzhi
[AI-NN-PR] HANNOTA DL : 0: 汉诺塔的prolog小程序，实现人工智能的简单呈现。-Tower of Hanoi& a prolog applet
Date : 2025-12-25 Size : 1kb User : springbryant
[AI-NN-PR] hannuota DL : 0: 古代著名的汉诺塔问题，本程序可以输出具体的移动步骤-Ancient famous Tower of Hanoi problem, the program can output a specific mobile steps
Date : 2025-12-25 Size : 3kb User : 快乐天地
[AI-NN-PR] hannuota DL : 0: 是想了汉诺塔的功能，实用了递归算法，该程序简单无误，适合初学者实用-Is the function to the Tower of Hanoi, and practical recursive algorithm, the program simple and accurate, useful for beginners
Date : 2025-12-25 Size : 6kb User : chen
[AI-NN-PR] hannuota DL : 0: 无聊的时候做了一个汉诺塔，输入塔的高度，会自动给出每个棋子的移动方案，有兴趣的朋友可以考虑多个塔柱的情况。-Boring a Tower of Hanoi, enter the height of the tower, will automatically give each piece of mobile solutions, and friends who are interested can consider the case of multiple tower.
Date : 2025-12-25 Size : 6kb User : CLJ
[AI-NN-PR] hano_cPPPP DL : 0: 人工智能的汉诺塔问题，用状态描述法求解，C#的WinForm程序-Tower of Hanoi problem of artificial intelligence, described by state law to solve, C# in WinForm program
Date : 2025-12-25 Size : 54kb User : Changcheng
[AI-NN-PR] hanoi-prolog DL : 0: 人工智能课程中用visual prolog编程实现的汉诺塔的例题-An Example of Hano Tower Implemented by Visual prolog in Artificial Intelligence Course
Date : 2025-12-25 Size : 6kb User : liudy