搜索资源列表
Hamilton
- 8*8 的国际象棋棋盘上的一只马，恰好走过除起点外的其它 63 个位置各一次，最后回 到起点。这条路线称为一条马的 Hamilton 周游路线。对于给定的 m*n 的国际象棋棋盘，m 和n均为大于5的偶数，且|m-n|≤2，试设计一个分治算法找出一条马的Hamilton周游路线。 编程任务： 对于给定的偶数m，n≥6，且|m-n|≤2，编程计算 m*n 的国际象棋棋盘一条马的Hamilton 周游路线。 Input 输入数据的第一行有2
rgr.c
- involving a knight on a chessboard.
knight
- 在n行n列的棋盘上（如n=5），假设一位骑士（按象棋中“马走日”的行走法）从初始坐标位置(x1，y1)出发，要遍访（巡游）棋盘中的每一个位置一次。请编一个程序，为骑士求解巡游“路线图”（或告诉骑士，从某位置出发时，无法遍访整个棋盘 — 问题无解）。-In the n-n chessboard (for example, n = 5), assuming a knight (in chess in the " horse to go on" walk method) from t
ChessDisplay
- VC++马走日棋盘搜索算法源码举例，运行时候电脑比较慢，运行完毕显示结果，可以以动画演示或直接显示棋盘的方式显示结果-For example VC++ horse day chessboard search algorithm source code run when the computer is relatively slow, finished running show results, animation or direct way to display the results of t
ChessBoard
- 有个一特殊方格的棋盘覆盖问题,可以用4种不同形态的L型骨牌覆盖棋盘。-There is a special box at the chessboard coverage problem, you can use four different forms of L-type domino cover board.
KnightTour
- 骑士巡游问题的算法。骑士巡游的问题简述如下：在国际象棋攀上某一位置放置一个马的棋子，然后采用象棋中“马走日字”股则，要求这匹马能不重复地走完25个格子。本实例用枚举方法求解骑士巡游问题。程序可自定义棋盘的大小，先输出标志矩阵，然后输入骑士在棋盘的初始位置，即可给出其中的一种解法。-Knight Parade algorithm problem. Knight Parade problems are summarized as follows: Place a horse chess piece
Chessboard-coverage
- 算法设计与分析之棋盘覆盖问题的解答 有需要的朋友可以看一下-And checkerboard analysis algorithm designed to answer questions covering a friend in need can look
primer
- 一个小的代码：// stack堆栈中保留两个数据（皇后所在的行和列），总共有八个皇后 // 住要特别注意入栈和出栈的顺序。 最后输出计算的结果。-The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other. Thus, a solution requires that no
bfs_chess.tar
- Deployment of towers and horses on chessboard. Implemented simple BFS graph algorithm.
source
- to solve the best case number of which how many times the king located at some position(x1,y1) to move to kill the the other ones located some position(x2,y2) in the chessBoard. implemented by BFS-to solve the best case number of which how many ti