Search - chess horse

Search - chess horse - List

[Data structs] xiyangqishi DL : 0: 有多种方法喔!西洋棋中骑士的走法与象棋的马类似,只能横向二格,纵向一格或者横向一格,纵向两格(但是西洋棋棋子必须放在格子中),第1步有2种走法,第二步就有5种走法.今有5*5的棋盘,并将骑士的第一步放于左上角(0,0)的位置,试找出一个路径,使骑士在25步内把剩下的24个位置全部走完.输出结果时,将骑士的路径显示于的5*5的方格中,每一方格内显示出走到此方格内为第同步的数字. -are many ways! Chinese chess knight of the law and take a horse like chess, only two horizontal lattice, a vertical or horizontal one lattice lattice, two vertical lattice (but chess piece must be placed on the lattice), with a further two species go, The second step will take five species law. this is a 5* 5 chessboard, and the Knights up in the upper left corner, the first step (0, 0) position and try to find a path, Knight to make the 25-step within the remaining 24 locations completed all. Output results, Knight will be on display on the path of the 5* 5 box, Each box shows left here for the first box synchronization figures.
Date : 2026-01-19 Size : 4kb User : tongyaozhang
[Data structs] knight DL : 0: 骑士遍历问题，在一个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 vertical, horizontal or a vertical two-step further vaulting horse rules traveled a checkerboard lattice of each and every one lattice just take time.
Date : 2026-01-19 Size : 1kb User : 张三
[Data structs] horsebianli DL : 0: 马的遍历问题。在中国象棋棋盘上，对任一位置上放置的一个马，均能选择合适的路线，使得该棋子能够按象棋的规则不重复的走过棋盘上的每一个位置。-Traversal problem horses. In Chinese chess chessboard, for any one location to place a horse, able to choose the right line, making the chess pieces according to chess rules can not repeat the past chessboard for each location.
Date : 2026-01-19 Size : 164kb User : yellowdoo
[Data structs] mtqp1 DL : 0: 马踏棋盘的源程序！实现国际象棋中马走遍整个棋盘！-Horse riding board source! Sino-Malaysian Chess realize traveled the entire board!
Date : 2026-01-19 Size : 2kb User : 唐冲
[Data structs] HorseTravelDemo DL : 0: 一个解决国际象棋的马周游问题的算法.本程序使用改善后的回溯算法来加速问题的解决.-A solution to chess problems horse around algorithms. This procedure using the improved algorithm to accelerate back problem.
Date : 2026-01-19 Size : 45kb User : thmfire
[Data structs] nhuanghou DL : 0: 八皇后问题是大数学家高斯于1850年提出来的。该问题是在8×8的国际象棋棋盘上放置8个皇后，使得没有一个皇后能"吃掉"任何其他一个皇后，即没有任何两个皇后被放置在棋盘的同一行、同一列或同一斜线上。要求编一个程序求出该问题的所有解。骑士游历问题是放在8×8的国际象棋棋盘上的一个马，按照马走"日"字的规则是否能够不重复地走遍棋盘的每个格。要求编一个程序求出该问题的一个解。-Eight Queen s question is the main mathematician Gauss was put forward in 1850. The problem is in the 8 × 8 chess board to place eight queen, making no one s able to eat any other a queen, that is, no two queen was placed in the chessboard of the same line, the same row or the same oblique online. Asked for a procedure to derive all the solutions of the problem. The problem is Cavalier traveled on 8 × 8 chess board on a horse, in accordance with the horse to the Day of the rules of the word can not be repeated for each cell traveled chessboard. Asked for a procedure to derive a solution of the problem.
Date : 2026-01-19 Size : 2kb User : 夏鑫
[Data structs] horseriding DL : 0: Horse Riding.rar计算国际象棋马的行走路线-Horse Riding.rar Ma calculated chess routes
Date : 2026-01-19 Size : 1kb User : zx
[Data structs] thehosrse DL : 0: 一个小程序，是模拟一只马走遍国际象棋棋盘的过程，挺好玩的-A small program is a simulation of horse around the course of a chess board, very good fun
Date : 2026-01-19 Size : 7kb User : andrea
[Data structs] horse DL : 0: 跳马问题，输出象棋跳马的多种的可能性结果-Horse problem, the output of a wide range of chess possibility vault results
Date : 2026-01-19 Size : 6kb User : symm
[Data structs] qishi DL : 0: 图算法之骑士遍历问题，骑士遍历问题，或者象棋中马的遍历问题-Knight traversal, or chess problem in ergodic horse
Date : 2026-01-19 Size : 1kb User : li shu
[Data structs] mataqipan DL : 0: 马踏棋盘的C语言代码。将马随机放在国际象棋的8X8棋盘Board[8][8]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1，2,。。。，64依次填入一个8X8的方阵，输出之。-Horse riding board the C language code. Ma randomly on the 8X8 chess board Board [8] [8] of a box, the horse moves in accordance with the rules of the mobile. Requires each box to enter only once, all around the chessboard of 64 squares. The preparation of non-recursive procedures, and run routes, and routes are obtained, the number 1,2,. . . , 64 followed by fill a 8X8 square, the output of.
Date : 2026-01-19 Size : 2kb User : de
[Data structs] backtrace_src DL : 0: 国际象棋中马的周游问题给定一个8×8的棋盘，给定某一位置。求马从该位置出发，经过棋盘中的每一个方格恰好一次，最后回到它出发位置的路线图。要求：用图形化动态演示马的行走路线、回溯过程。 -Travel chess problems in horses given a 8 × 8 chessboard, given a particular location. Horse from the starting seek position, after the board of each square exactly once, and finally back to its starting position of the road map. Requirements: Dynamic presentation with graphical horse routes, backtracking process.
Date : 2026-01-19 Size : 26kb User : yongyong
[Data structs] qishixunyou DL : 0: 编写程序求解骑士巡游问题：在n行n列的棋盘上（如n=5），假设一位骑士（按象棋中“马走日”的行走法）从初始坐标位置(x1，y1)出发，要遍访（巡游）棋盘中的每一个位置一次。请编一个程序，为骑士求解巡游“路线图”（或告诉骑士，从某位置出发时，无法遍访整个棋盘 — 问题无解）。当n=5时，意味着要在5行5列的棋盘的25个“点”处，按骑士行走规则，依次将1至25这25个“棋子”（数码）分别摆放到棋盘上（摆满25个位置则成功，否则失败问题无解）。 -Knight Parade programming to solve the problem: In the n-n chessboard (for example, n = 5), assuming a knight (in chess in the " horse to go on" walk method) from the initial coordinates (x1, y1) starting , to be visited (cruise) position in each of the board once. Please compile a program to solve for the Knight Parade " road map" (or tell the knight, starting from a position, you can not visited the board- problem has no solution.) When n = 5, meaning 5 rows 5 columns in the board' s 25 " points" at, according to Knight walking rule, in turn 1 to 25 of these 25 " pieces" (digital) were placed into the board ( 25 positions were filled with success, or failure problem has no solution.)
Date : 2026-01-19 Size : 2kb User : 赵汉卿
[Data structs] ChessDisplay DL : 0: 对象棋中的马走日进行分析，实现马走日的搜索算法。-The horse walked on at chess analysis, implementation and gallop away on the search algorithm.
Date : 2026-01-19 Size : 65kb User : licunli
[Data structs] tiaoma DL : 0: 跳马算法的实现：考虑国际象棋棋盘上某个位置的一只马，它是否可能只走步，正好走过除起点外的其他个位置各一次，并且最后能够回到初始点（存在哈密顿回路）？-Vault algorithm implementation: considering a location on the chess board of a horse, it may only be walking, just walk in addition to other locations outside the starting point each time, and finally be able to return to the initial point (Hamiltonian circuit )?
Date : 2026-01-19 Size : 222kb User : zhaoxin
[Data structs] xiangqi DL : 0: 数据结构实习里面关于国际象棋马的遍历问题自己编写-Data structures inside the internship through on chess problems to write your own horse
Date : 2026-01-19 Size : 2.36mb User : efgdshgds
[Data structs] AStar_knight DL : 0: A star算法求解的国际象棋骑士，也就是马从一个位置走到另一个位置的最小步数。-A star algorithm chess knight, it is a horse from one location to another location of the minimum number of steps.
Date : 2026-01-19 Size : 892kb User : kexitan
[Data structs] horse DL : 0: 将马随机放在国际象棋的8* 8 棋盘Bord[8Ⅱ8]的某个方格中，马按走棋规则进行移动。要求每个方格上只进入一次，走遍棋盘上全部64个方格。 -Grid of the horse were randomly placed in the 8* 8 chess board Bord [8 Ⅱ 8] of a horse by playing chess rules to move it. Requirements on each square only enter once traveled all the 64 squares on the board.
Date : 2026-01-19 Size : 286kb User : Mr.Wu
[Data structs] mataqipan DL : 0: (1) 问题描述: 设计一个国际象棋的马踏棋盘的演示程序. (2) 基本要求: 将马随机放在国际象棋的8*8棋盘的某个方格中,马按走棋规则进行移动.要求每个方格只进入一次,走遍棋盘上全部64个方格.编制非递归程序,求出马的行走路线,并按求出的路线,将1,2,…,64依次填入一个8*8的方阵,输出之. (3) 程序的输入和输出及程序的功能: 使用者输入一个位置如:3,4.注意中间默认要以”,”隔开.并且数字的大小要在[0,7].程序会根据使用者的要求进行一次以8*8矩阵形式输出结果或演示寻找行走路线的回溯过程. -(1) description of the problem: Design a chess board horse riding board demo program. (2) basic requirements: The horses were placed in the chess board 8* 8 a box, Ma playing chess rules according to mobile. Requires that each box to enter only one, traveled on board all 64 squares. The preparation of non recursive program, seeking to lobby the walking route, and according to the calculated route will be 1,2,... , 64 in order to fill in a 8*8 matrix, the output. (3) the input and output of the program and the function of the program: The user to enter a position such as 3,4. pay attention to the middle of the default to , separated. And the size of the digital to program in [0,7]. according to user s requirement of a 8* 8 matrix to output the results or demo for walking route back in the process.
Date : 2026-01-19 Size : 111kb User : 梁文水