搜索资源列表
knight
- 骑士遍历问题，在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。-Knight, in an n * n box at the international chess board, Ma (Knight) from the arbitrary designation box and, in accordance with a further horizontal two-step vert
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
knight
- 骑士漫游的改进算法，回溯算法加贪心选择策略，n最大可以到128-Knight improved roaming algorithms, backtracking algorithms greedy selection strategy increases, n the greatest can go to 128
KNIGHT
- knight and pawn problem
knight
- 骑士巡游的经典问题 的一种解法-Knight parade of the classic problems of one kind of solution
knight-reverse
- 骑士遍历，骑士遍历的回逆算法。可以作为数据结构和算法学习的教学参考-Knight traverse, traverse back to the inverse algorithm Knight. Data structures and algorithms can be used as teaching reference learning
uva439-Knight-Moves-
- uva439 Knight Moves的代码，并且在UVaOJ上通过了-uva439 Knight Moves the code, and adopted the UVaOJ
Knight-Parade
- 骑士巡游问题:从国际象棋棋盘上任意给定的方格开始移动骑士，相继地到达所有的64个方格，进入每个方格一次且仅进入一次。回溯法实现-Knight Parade problem: the chess board from any given knight box began to move, have to reach all the 64 squares, each square once and only entered into once. Backtracking to achieve
Knight
- 1.实验目的:通过实验理解算法的概念、算法的表示、算法的时间复杂度和空间复杂度分析；运用熟悉的编程工具对骑士周游列国问题进行求解，初步学会分析算法的时间复杂度和空间复杂度； 2.在一张国际象棋棋盘上（8*8方格），骑士（knight，马）位于任意一个位置。问如何才能让骑士不重不漏的经过棋盘上的每个格？本问题中已知骑士位置(m,n)，其中0=<m,n<=8，要求给出骑士行走路径，路径可用8*8矩阵输出，其中值表示骑士到达此位置行走的步数（初始为1） -1. Experimen
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
Knight-traversal
- 骑士遍历的几种算法 骑士遍历回逆 使用回溯算法求解骑士游历问题-Knight Rider traverse traverse several algorithms using the backtracking algorithm on the reverse problem of knights traveled
Knight
- VS2008实现的骑士巡游的回溯算法，有解即停止搜索，并输出-VS2008 knight parade achieve backtracking algorithm, which stops searching solvability, and the output
Basics-of-MATLAB-and-Beyond---Andrew-Knight-(.m-F
- This file include matlab files to simulate example in "Basics of MATLAB and Beyond - Andrew Knight" e-book, you can use these .m file to improve your knowledge about matlab
Basics-of-MATLAB-and-Beyond---Andrew-Knight
- This book is : Basics of MATLAB and Beyond - Andrew Knight, you can use this book with file code i uploaded before. Well done !
Board-box-to-go-horse-riding-knight
- 马踏棋盘++骑士走方格 马踏棋盘++骑士走方格 CPP文档-Board box to go horse riding knight
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
Knight-traveled-the-board-algorithm
- 数据结构经典算法C++实现（三）：骑士走遍棋盘算法-Data structures classical algorithm C++ of realization (c): Knight traveled the board algorithm
Knight-traveled
- 数据结构算法，骑士游历问题的解决及分析说明。-Data structure algorithms, Knight traveled to problem solving and the analysis shows.
knight(use-ASTAR)
- A*算法解决knight难题，利用A*算法人工智能地寻找最佳路径-A* algorithm to solve the knight problem using the A* algorithm to find the best path to artificial intelligence
Knight-moves
- 使用C语言实现骑士移动问题，函数测试通过，未显示出骑士移动过程-Knight moves using C language implementation issues, function test, the move did not show Knight