搜索资源列表
求解Knight Tour Problem
- 求解Knight Tour Problem，马的走法是“日”字形路线，例如当马在位置15的时候，它可以到达2、4、7、11、19、23、26和28。但是规定马是不能跳出棋盘外的，例如从位置1只能到达9和14
采用回溯法编写的骑士周游
- 这是一个采用C++编写的、采用回溯法编写的骑士周游（马周游）遍历棋盘（8*8）的程序。本软件采用MFC编写，用户可看到骑士动态遍历棋盘的过程。-This is a written in C++ using backtracking written knight tour (horse travel) through the board (8* 8) program. The software is written using MFC, you can see the board through
qishizhouyou
- 骑士周游是一个经典的问题，它需要回唆的办法来解决-Knight s tour is a classic problem, it needs to return to instigate solutions to
qishi
- 递归算法的实例--以骑士巡游为例做的控制台程序。主要设计到了递归回溯算法-Examples of recursive algorithms- to Knight-tour of the console to do the procedure as an example. The main design to a recursive backtracking algorithm
knights-tour
- knight-tour solve problem
wdf
- 骑士巡游问题的解决，设计比较简单，但能够体现算法思想，推广用-Knight-tour problem, the design is relatively simple, but the algorithm can reflect the ideas, the promotion of use
KnightTourCPP
- it is the famous Knight tour algorithm. written in c++. enjoy it.
knight
- 骑士巡游问题的源代码，做算法课作业必备资料。-Knight tour problem' s source code, doing class work necessary information algorithm.
KnightTour
- 跳马问题的delphi代码，不用多解释了哈，怎么还不够20个字呢-knight tour
knight_tour
- This the example of Knight Tour Program, buat it s may be still have many error.. may someone can fix it thanks :D-This is the example of Knight Tour Program, buat it s may be still have many error.. may someone can fix it thanks :D
qishiyouliProblem
- C/c++实现著名“骑士游历问题”~ 【问题描述】 给出一块具有n2个格子的n×n棋盘（如图3-14所示），一位骑士从初始位置(x0, y0)开始，按照“马跳日”规则在棋盘上移动。问：能否在n2? 1步内遍历棋盘上的所有位置，即每个格子刚好游历一次，如果能，请找出这样的游历方案来 -C/c++ to achieve the famous " knight tour problem" ~ 【】 given a problem descr iption with a grid of
KNIGHT
- 本程序是骑士巡游的游戏程序代码，供Java初学者使用。-This program is a knight' s tour game program code for Java beginners.
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
Knight-Tours
- 骑士旅游问题是经典的问题，本代码用简单的C实现这一问题。-Knight Tour problem is a classic problem, the code with a simple C implementation of this problem.
Tiaomawenti2
- 骑士周游列国问题 在一张国际象棋棋盘上（8*8方格），骑士（knight，马）位于任意一个位置。问如何才能让骑士不重不漏的经过棋盘上的每个格？-Knight tour around the problem in a chess board (8* 8 squares), Knight (knight, horse) in any one location. Q. How can I get the knights do not leak through the chessboard each
knight
- 骑士旅游（Knight tour）在十八世纪初倍受数学家与拼图迷的注意，它什么时候被提出已不可考，骑士的走法为西洋棋的走法，骑士可以由任一个位置出发，它要如何走完所有的位置？-Knight Tours (Knight tour) in the early eighteenth century mathematician and puzzle fans much attention when it was proposed not be traced, chess knight moves to
knight_tour_generic
- Generic implementation for the knight tour
马的周游
- 实现寻找马的周游问题n*n规模的分治法解(Find solution of the Knight tour problem in size of n*n by means of divide and conquer)
马的周游
- 一个小算法，实现了骑士周游，主要使用了动态规划法，运行速度也快。(A small algorithm to achieve the Knight Tour, the main use of dynamic programming method, the speed is also fast.)
本科算法实验项目卡
- 算法实验卡，其中包括很多经典的算法例子，包括旅行问题，骑士周游列国问题，还有其他的等等(Experiment for algorithm experiment knight tour)