搜索资源列表
Knight2
- 这是自己写的骑士巡游问题的源代码，控制台实现没有图形化-This is, the parade was the Knights of the source code, not realizing console Graphic
KT
- 骑士巡游，是用applet的小游戏，你可以自己测试看下你的显示效果-Knights parade, the applet is a small game, you can own your facie test results show
Diarys
- 骑士日记本V0.9 Beta1 程序制作：骑士 E-mail:wuhran@126.com 主页:http://knight.yascool.com QQ:115418021-Knights of the keyboard Beta1 diary production procedures : Knight E-mail : wuhran@126.com Home : http : / / knight.yascool.com QQ : 115418021
qishimigong
- 很好的求解骑士迷宫的的代码，可以在vc6.0环境下运行的c语言代码-good for the Knights maze of code can run under vc6.0 the c language code
xiyangqishi
- 有多种方法喔!西洋棋中骑士的走法与象棋的马类似,只能横向二格,纵向一格或者横向一格,纵向两格(但是西洋棋棋子必须放在格子中),第1步有2种走法,第二步就有5种走法.今有5*5的棋盘,并将骑士的第一步放于左上角(0,0)的位置,试找出一个路径,使骑士在25步内把剩下的24个位置全部走完.输出结果时,将骑士的路径显示于的5*5的方格中,每一方格内显示出走到此方格内为第同步的数字. -are many ways! Chinese chess knight of the law and take a h
mineKnightsTour
- 大一的时候写的骑士问题,自认为是最快的方法,如果有更好的方法请与我联系,pipi666661@126.com-freshman when the Knights was the problem, since that is the fastest way, If there is a better way, please contact me, pipi666661@126.com
knightone
- 骑士问题的算法,和马踏棋盘的算法差不多,希望对大家有帮助!-Knights of the algorithm, and horse riding chessboard almost algorithm, we want to help!
phone-game-src
- 一款新手改造的J2me手机游戏项目，三国战纪游戏的源代码，游戏界面略显粗糙。不过游戏基本框架已经具备。一小部分功能没有实现。-Transformation of a new project J2me Mobile Games, Knights of Valor of the source code of the game, the game interface slightly rough. But the basic framework of the game in place. A smal
knight
- 骑士旅行算法的实现，思路清晰便于阅读的程序-Knights travel algorithm, clear procedures for ease of reading
knights-tour
- knight-tour solve problem
knights_tour
- knights tour in c++(interesting)
huisup
- 我的回溯算法学习资料，里边包含n皇后、骑士游历等pascal源程序。-My backtracking algorithm for learning materials, inside contains the n queen, knights traveled so pascal source.
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
knight
- 在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。这样的跳马步骤称为1 个成功的骑士征途。例如，当n=5 时的1 个成功的骑士征途如下图所示。 1 2 3 4 5 1 25 14 1 8 19 2 4 9 18 13 2 3 15 24 3 20 7 4 10 5 22 17 12 5 23 16 11 6 21 算法设计： 对于给定的n和n*n方格的起始位
travel
- 通过学习奥赛培训课程，利用回溯加递归的编程技巧完成的骑士旅行问题-Training courses through learning Orsay, plus use of recursive programming skills back to complete the Knights travel problems
knight
- knights tour clustering
kingnight
- 基于Java，applet编制的程序，骑士游历程序开发，能够演示起始位置在棋盘任何位置的游历问题-Based on Java, applet programmed, knights tour program development, the starting position to demonstrate the location of the board of any travel problems
DsHw
- This is a .cpp file. It is a good example of knights tour. It is also a data structure question.-This is a .cpp file. It is a good example of knights tour. It is also a data structure question.