搜索资源列表
puzzle
- 在一个n*n 矩阵中找到 沿着八个方向搜索，找长度大于4并且字典中包含的单词。-N* n in a matrix along the eight found in the direction of search, to find the length of more than 4 and the word dictionary is included.
puzzleAlgorithm
- 拼图游戏算法，能解决N*N阶的拼图问题。包括棋盘的解的存在性判定，以及提供了拼图游戏的一个解的可实现算法-Jigsaw puzzle algorithm, can solve the puzzle of order N* N problem. Including the board determine the existence of solutions, and to provide a jigsaw puzzle of a solution algorithm can be realized
Puzzle
- 任意m * n的拼图的BFS最快解。进行了裁剪优化。最多支持5 × 5-Any m* n the puzzle the fastest solution BFS. Were cut optimization. Up to 5 × 5
AStart
- A*算法解决N数码问题演示程序，可以学习到很多Java的Swing编程，关于窗口背景，combox，textfield,图标显示到托盘等，同时拖过程序的界面演示，可以轻松掌握A*算法。-A* algorithm to solve the N puzzle problem demo program, you can learn a lot of Java Swing programming, about the background of the window, combox, textfield
clientpuzzle
- Client puzzle program i n java
N-Puzzle
- 软件学院实训阶段三任务3 - 挖迷宫，拼图并设计优化方案-Software Engineering Training Stage Three Task 3- digging maze, puzzle and design optimization
HanoiFolder
- Given a stack of n disks arranged largest on the bottom to smallest on top placed on a rod, together with two empty rods, the towers of Hanoi puzzle asks for the minimum number of moves required to move the stack one rod to another, where moves are a