搜索资源列表
backtracking
- 是用回朔法实现跳马程序。数据结构入门的好例子-is back Schomburg Method vault procedures. Structure data entry a good example
tiaomawenti
- 讲述回溯法的基本原理，使用回溯法编程，求解跳马问题。-Backtracking on the basic principles, the use of backtracking programming, problem solving vault.
horse
- 跳马问题，输出象棋跳马的多种的可能性结果-Horse problem, the output of a wide range of chess possibility vault results
tiaoma
- 跳马算法的实现：考虑国际象棋棋盘上某个位置的一只马，它是否可能只走步，正好走过除起点外的其他个位置各一次，并且最后能够回到初始点（存在哈密顿回路）？-Vault algorithm implementation: considering a location on the chess board of a horse, it may only be walking, just walk in addition to other locations outside the starting poi
TourOfTheKnight
- 通过这个程序，可以获得对回溯算法的基本理解。在 n × n 方格的国际象棋棋盘上，马(也称为骑士Knight)从任意指定的方格出发，以跳马规则(横一步竖两步或横两步竖一步)，周游棋盘的每一个格子，要求每个格子只能跳过一次。-Through this program, you can get a basic understanding of backtracking algorithms. On the chess board n n squares, Ma (also known as Knig