Location:
Search - Knight tour
Search list
Description: it is about knight tour
Platform: |
Size: 1958 |
Author: jovi |
Hits:
Description: 求解Knight Tour Problem，马的走法是“日”字形路线，例如当马在位置15的时候，它可以到达2、4、7、11、19、23、26和28。但是规定马是不能跳出棋盘外的，例如从位置1只能到达9和14
Platform: |
Size: 966 |
Author: happydabu@126.com |
Hits:
Description: JAVA原代码 JAVA原代码-Java source code, Java source code
Platform: |
Size: 3615744 |
Author: |
Hits:
Description: it is about knight tour
Platform: |
Size: 2048 |
Author: jovi |
Hits:
Description: 国际象棋游戏一个经典的例子就是骑士巡游（knight s tour）问题，这个问题要求从棋盘上任意给定的方格开始移动骑士，相继地到达所有的64个方格，进入每个方格一次且仅进入一次。通常情况下，我们用如下方法表示一个解：即把数字0，1，…，63放入棋盘中的方格来表示到达这些方格的顺序。解决骑士巡游问题更具创意的方法之一是由J. C. Warnsdorff在1823年提出的。其规则是：骑士总是移向具有最少出口且没有到达过的方格之一-Chess game is a classic example of Cavalier Parade (knight s tour) issue request from the board on any given grid Cavalier began to move, one after another to reach all 64 boxes, each box to enter the first and only entered once. Under normal circumstances, we use the following method to represent a solution: that is, the figures 0,1, ..., 63 Add chessboard grid of these squares to indicate the order of arrival. To resolve the issue of Cavalier parade one of the ways to be more creative by JC Warnsdorff raised in 1823. Its rules are: Cavalier always have at least moved towards exports and the box had not arrived at one of
Platform: |
Size: 1024 |
Author: 崔润 |
Hits:
Description: 上海手游公司開發RPG大作-破虜傳完整代碼,註解與資源包和地圖編輯器,經JBX編譯成功-Shanghai Hand Tour developed RPG masterpiece-瘆?Chuan complete code, annotation and resource packet and map editor, compiled by the success of JBX
Platform: |
Size: 2235392 |
Author: 蔡复任 |
Hits:
Description: 用JAVA写的个种算法：排序，迷宫，巴斯卡（Pascal）， ThreeColorFlags ，Knight tour-Written by JAVA species algorithms: sorting, maze, Pascal (Pascal), ThreeColorFlags, Knight tour
Platform: |
Size: 45056 |
Author: sp |
Hits:
Description: 本代码是实现了马的周游路线，对于所有的初始点都可以找出所有不同的周游路线。-This code is to achieve a horse around the line, for all the initial points can be found in all the different routes of travel.
Platform: |
Size: 2048 |
Author: 余方 |
Hits:
Description: knight-tour solve problem
Platform: |
Size: 112640 |
Author: komeils |
Hits:
Description: 递归算法的实例--以骑士巡游为例做的控制台程序。主要设计到了递归回溯算法-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
Platform: |
Size: 1024 |
Author: zhang |
Hits:
Description: it is the famous Knight tour algorithm. written in c++. enjoy it.
Platform: |
Size: 2048 |
Author: Hossein Bukhamsin |
Hits:
Description: 骑士巡游问题的源代码，做算法课作业必备资料。-Knight tour problem' s source code, doing class work necessary information algorithm.
Platform: |
Size: 263168 |
Author: xnhcx |
Hits:
Description: 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 knight tour problem. Knight does not start from any one box, but from one corner of the start of the four squares. The source code with detailed and explained.
Platform: |
Size: 23552 |
Author: 孟涛 |
Hits:
Description: Java源代码案例-骑士巡游问题
本文展示了一个KT(Knight s Tour)小程序， 用来演示一个限制版的骑士巡游问题。 骑士并不是从任何一个方格开始， 而是从角落上的四个方格之一开始-Java Source Code Examples- Knight Parade problem This paper presents a KT (Knight' s Tour) small program used to demonstrate a restricted version of the knight tour problem. Knight is not from any one box, but from the corner of one of the four squares start
Platform: |
Size: 5120 |
Author: 阿生 |
Hits:
Description: 用C语言实现著名的骑士巡游问题（用数据结构中的图实现）。-Famous knight tour problem with C language (using the data structure in Figure).
Platform: |
Size: 1024 |
Author: 宋永强 |
Hits:
Description: 骑士旅游问题是经典的问题，本代码用简单的C实现这一问题。-Knight Tour problem is a classic problem, the code with a simple C implementation of this problem.
Platform: |
Size: 1024 |
Author: 姜文丽 |
Hits:
Description: 骑士旅游（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 the walk, the Knights can start from any position, it how do I finish all the positions?
Platform: |
Size: 7168 |
Author: marry |
Hits:
Description: Knight tour algorihtms, C-Knight tour algorihtms, C++
Platform: |
Size: 1024 |
Author: Ba Pham Sy |
Hits:
Description: Generic implementation for the knight tour
Platform: |
Size: 41984 |
Author: bebellamc
|
Hits:
Description: 在一个N*N的棋盘上指点任意一点的坐标，以马走日的方式走完整个棋盘且没有重复，试分别用DFS、BFS方法求解并输出全部可能的路径。(knight tour problem solved by the method of BFS and DFS.)
Platform: |
Size: 43008 |
Author: 急速蜗牛 |
Hits: