Location:
Search - dfs puzzle
Search list
Description: puzzle program witch dfs bsf and a* algorithm
Platform: |
Size: 4096 |
Author: Slayer86 |
Hits:
Description: AI（人工智能）课程的作业，要求用java语言 随即生成8迷宫问题，然后用dfs解决，请大家参考-AI (Artificial Intelligence) program demands of their workers using java language then generate the eight maze problems, and then use dfs resolved, please refer to the
Platform: |
Size: 3072 |
Author: alex |
Hits:
Description: 这个程序是从广度优先搜索,深度优先搜索,A算法以及A算法等多方面算法来解决八数码问题.zip-8-puzzle A* BFS DFS MFC
Platform: |
Size: 3769344 |
Author: benson |
Hits:
Description: 人工智能经典问题八数码的深度优先搜索算法实现。没有图形界面。-Classic problem of artificial intelligence, eight digital breadth-first search algorithm. No graphical interface.
Platform: |
Size: 303104 |
Author: zlf |
Hits:
Description: 8 Puzzle by using BFS , DFS
Platform: |
Size: 17408 |
Author: sonu |
Hits:
Description: 数独解题方法的一种，用深度优先搜索。代码中候选数的表示用到了离散数学的知识。hash表的应用。大量宏的应用。-The code provde a way to solve sudoku puzzle using DFS algorithm.
Platform: |
Size: 2048 |
Author: kongwu |
Hits:
Description: This program solves the puzzle by profema of 8 DFS algorithm
Platform: |
Size: 1024 |
Author: pollo |
Hits:
Description: 15 puzzle program which uses DFS and BFS algorithm
Platform: |
Size: 189440 |
Author: maciekkk |
Hits:
Description: Peg solitaire is a classical puzzle commonly played on a 33-hole cross-shaped board (also called "the English Board") or a 15-hole triangular board.
A valid move is to jump a peg orthogonally over an adjacent peg into a hole two positions away and then to remove the jumped peg.
In the diagrams which follow, · indicates a peg in a hole, * emboldened indicates the peg to be moved, and o indicates an empty hole. A blue ¤ is the hole the current peg moved from a red * is the final position of that peg, a red o is the hole of the peg that was jumped and removed.
规则如上所述，输入txt文件作为初始棋盘，“。”为空棋格，“0"为有棋子的棋格。读入后输出结果
采用DFS算法-Peg solitaire is a classical puzzle commonly played on a 33-hole cross-shaped board (also called " the English Board" ) or a 15-hole triangular board. A valid move is to jump a peg orthogonally over an adjacent peg into a hole two positions away and then to remove the jumped peg. In the diagrams which follow, indicates a peg in a hole,* emboldened indicates the peg to be moved, and o indicates an empty hole. A blue is the hole the current peg moved from a red* is the final position of that peg, a red o is the hole of the peg that was jumped and removed. rules described above, the initial input board txt file, " ." empty chess " 0 " as a pawn in chess. After reading the results using the DFS algorithm output
Platform: |
Size: 2048 |
Author: yyz |
Hits: