搜索资源列表
Knight
- C++/C实现骑士巡游、N皇后和搬山游戏的代码,包括详细算法说明文档,经典好用。-C++/C implementation knight parade, N Hill Queen and move the game code, including detailed algorithm documentation, classic easy to use.
Knight
- VS2008实现的骑士巡游的回溯算法,有解即停止搜索,并输出-VS2008 knight parade achieve backtracking algorithm, which stops searching solvability, and the output
horse
- 用JAVA写的一个比较好的骑士巡游问题的解决代码,时间复杂度极低-Written with JAVA A good knight' s tour solution to the problem code, the time complexity is very low
Knights-tour-problem
- 用C语言实现著名的骑士巡游问题(用数据结构中的图实现)。-Famous knight tour problem with C language (using the data structure in Figure).
0810610
- 编写程序求解“骑士巡游”问题:在n行n列的棋盘上(如n=5),假设一位骑士(按国际象棋中“马走日”的行走法)从初始坐标位置(x,y)出发,要遍访(巡游)棋盘中的每一个位置有且仅有一次。请编一个程序,为骑士求解巡游“路线图”(或告诉骑士,从某位置出发时,无法遍访整个棋盘 — 问题无解)。由于n比较大的时候输出结果会很多,以至于运行时间很长,没有实际意义,所以本程序只做了n=5的时候的情况。-Write a program for solving the Knight Parade ": n lin
qishixunyou
- 国际象棋棋盘的骑士巡游问题,深度优先,穷举搜索-Chessboard knight tour problem, depth first, exhaustive search
Knight
- 经典的骑士巡游问题,通过走日子来遍历棋盘,非回溯法,可以有效率的解决8*8棋盘的解决方案,但是不能保证所有问题都是有解的-Classic knight' s tour problem, by taking a day to traverse the board, non-backtracking, can be effective solution 8* 8 board solution, but can not guarantee that all problems are solvab
Sqisshiio
- 国际象棋游戏源码一个经典的源码实例就是骑士巡游(knight s tour)问题,这个问题要求从棋盘上任意给定的方格开始移动骑士,相继地到达全部的64个方格,进入每个方格一次且仅进入一次。通常情况下,,我们用如如下方法表示一个解:即把数字0,1,…,63放入棋盘中的方格来表示到达这些方格的顺序。解决骑士巡游问题更具创意的方法之一是由J. C. Warnsdorff在1823年提出的。其规则是:骑士总 -A classic chess game source code example is t
qisixunyou
- 编程初学者必须练手的小程序.能让你熟悉编程的一些技巧。骑士巡游。。经典程序-Applet programming beginners must practice hand make some of you are familiar with the programming skills. Knight Parade. . Classic program
KNIGHT
- 本程序是骑士巡游的游戏程序代码,供Java初学者使用。-This program is a knight' s tour game program code for Java beginners.
knights-tour
- 骑士巡游游戏,程序给出了实现方法,使骑士总是移向具有最少出口且没有到达过的方格之一-The Knight Parade game program given the ways in which Knight always move to one of the least export and did not reach the checkered
code
- 使用回溯法解决的典型问题的算法:骑士巡游问题,n皇后问题,0-1背包问题。 使用递归与分治策略解决的几个问题的算法:Hanoi塔问题和二分搜索技术。-Uses backtracking method to solve the problems of the typical algorithms: the knight tour problem, n queen problem, 0-1 knapsack problem. Recursion and divide and conq
A-Knights-Journey
- POJ经典名题——骑士巡游VC++版实现附代码注释。初学者理解深搜思想很好地入门题目-The POJ classic title- Knight Parade VC++ Edition attached code comments. Beginners to understand the thinking of the deep search entry subject
code
- 使用回溯法解决的典型问题的算法:骑士巡游问题,n皇后问题,0-1背包问题。 使用递归与分治策略解决的几个问题的算法:Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
source_code
- 八数码(启发式和广度优先搜索两种方法实现)+骑士巡游+比赛日程安排等经典问题的C++源代码-the source code of some classic problems, such as 8 puzzle question, Knight Parade, and Competition Schedule.
Chess
- 骑士巡游问题的求解,带优化算法,cpp文件-Knight Parade problem solving with optimization algorithm, cpp file
KnightTour
- 骑士巡游问题的算法。骑士巡游的问题简述如下:在国际象棋攀上某一位置放置一个马的棋子,然后采用象棋中“马走日字”股则,要求这匹马能不重复地走完25个格子。本实例用枚举方法求解骑士巡游问题。程序可自定义棋盘的大小,先输出标志矩阵,然后输入骑士在棋盘的初始位置,即可给出其中的一种解法。-Knight Parade algorithm problem. Knight Parade problems are summarized as follows: Place a horse chess piece
Knight
- C++实现骑士巡游、N皇后和搬山游戏的代码,包括详细算法说明文档,经典好用。-C++/C realization Knight Parade, N Queens and move mountains of the game code, including detailed algorithm documentation, classic easy to use.
Knight
- VC++实现骑士巡游、N皇后和搬山游戏的代码,包括详细算法说明文档,经典好用。-VC++ implementation Knight Parade, N Queens and move mountains of the game code, including detailed algorithm documentation, classic easy to use.
Knight
- VC++实现骑士巡游、N皇后和搬山游戏的代码,包括详细算法说明文档,经典好用。-VC achieve Knight Parade, N Queens and move mountains of the game code, including detailed algorithm documentation, classic easy to use.