搜索资源列表
qspl
- 该程序描述了一个骑士遍历 -..........................
classic_Problem_algorithm
- 包含几个经典问题算法，如骑士遍历，N皇后问题回溯等。对这些算法有兴趣的可以一看。-Algorithm contains several classic problems, such as the Knight traversal, N queens problem back and so on. Are interested in these algorithms can have a look.
EastWestBigCrash
- 简单的回合制游戏 骑士与侠客的战争，在各自不同的移动方式下体现东西方思维方式的差异性(东方：视野广而经常是浅尝辄止；西方：视野狭窄但对单一方向专研很深)-A simple turn-based games- [The war between cavalier and knight] . For their different modes of mobile way of thinking reflects the East-West difference (the East: Vision wi
qishi
- 算法与数据结构（C语言版，请勿用在商业，仅作学习交流用）。骑士巡游，算法和数据结构很有研究的价值。-Algorithms and Data Structures (C language version, please do not use in the business, only to learn the exchange of use). Knight parade, algorithms and data structures great deal of research value.
Knighttravele
- 骑士游历问题 【问题描述】 给出一块具有n2个格子的n×n棋盘（如图3-14所示），一位骑士从初始位置(x0, y0)开始，按照“马跳日”规则在棋盘上移动。问：能否在n2 1步内遍历棋盘上的所有位置，即每个格子刚好游历一次，如果能，请找出这样的游历方案来 -Knight traveled the problem gives a descr iption of the problem with n2 a lattice of n × n board (as shown in
king_visit
- 骑士巡游的非递归实现，代码树已经进行了优化，可以在最优时间内得带结果-Knight-tour of the non-recursive implementation, the code tree has been optimized, you can get the optimal time to bring the results of
Knight-Tour
- Java源代码案例--骑士巡游问题 展示了一个KT(Knight’s Tour)小程序， 用来演示一个限制版的骑士巡游问题。 骑士并不是从任何一个方格开始， 而是从角落上的四个方格之一开始。 附有详细的源码及讲解。-Java Source Code Case- knight tour problem shows a KT (Knight' s Tour) a small program used to demonstrate a restricted version of the
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic programming. C calendar dynamic compu
qishifeixingqiyuanma
- 自己写的一款骑士飞行棋，供学习参考，基本功能都已经实现
huisup
- 我的回溯算法学习资料，里边包含n皇后、骑士游历等pascal源程序。-My backtracking algorithm for learning materials, inside contains the n queen, knights traveled so pascal source.
knight
- 骑士漫游的改进算法，回溯算法加贪心选择策略，n最大可以到128-Knight improved roaming algorithms, backtracking algorithms greedy selection strategy increases, n the greatest can go to 128
rengongzhineng
- 人工智能部分典型问题答案（传教士问题，骑士周游问题，8皇后问题等）-Some typical answers to questions of artificial intelligence (missionary problems, knights tour problem, eight queens problem, etc.)
KnightTour
- 骑士周游问题，国际象棋中骑士走遍所有的格子，而且不重复的走法。尝试算法。-Knight tour problem, the international chess knights traveled in all of the lattice, and not repeat the moves. Try algorithm.
knight
- 骑士周游列国，骑士可以最初处于任何位置，逐渐走遍所有位置，递归，代价有点高，运行有点慢，少家改动可以显示所有方案-Cleveland travel around the world, knights can be any location in the first, and gradually traveled all locations, recursive, the price a little higher, run a bit slow, small changes at home ca
KnightTourAllSolution
- 骑士周游问题。可以找到所有的走法。目前已经找到100万种走法，但估计至少有几千万种走法。C++源代码。-Knight tour problem. You can find all the moves. Currently have found one million kinds of moves, but it is estimated there are at least several 10 million kinds of moves. C++ source code.
source
- Java控制台应用程序：骑士飞行棋。在Eclipse调试通过。-Java console application: Cleveland flight chess. Debugging in Eclipse through.
qishiyouli
- 比较经典的用预见算法解骑士游历问题，是学习数据结构必备的源码-Comparison of the classical algorithm for solving knights traveled with predictable problem is learning the source of the data structures necessary
qishiwenti
- 算法设计与分析的一道题目：骑士问题（适用于上课实验）-Algorithm design and analysis of a topic: Knight problem (for class test)
EightQueensChess1.1
- 八皇后 和 骑士巡游 求解(带图形界面)-The eight Queen problem and the Knight trail problem system，and it has a real motion picture.
jinchengdiaodu
- 用预见算法解骑士游历问题 C++实现 数据结构-Algorithm for the Knight travels with a predictable problem C++, data structure