Search - chess horse

Search - chess horse - List

[Other] knignt DL : 0: 求解骑士游历问题的程序。骑士游历问题是在8X8格的国际象棋棋盘上随意放置一个马，按照马走“日”字的规则对马进行操作，问是否能够不重复的走遍棋盘的每个格。-Cavaliers traveled problem solving process. Cleveland traveled problem is the 8x8 grid of international chess pieces on dumped a horse, according to Ma take "days" to the rules word for horse operations, asked whether not to repeat the chessboard visited each grid.
Date : 2026-01-19 Size : 15kb User :
[Other] chess DL : 0: java实现的一个算法，主要功能是在n*n的棋盘上，马步遍历，从一个起始点开始，在遍历所有的棋盘后，看能否回到起始点。若有路径，则显示出来-java realize an algorithm, the main function in the n* n chessboard, horse traverse from a starting point for the beginning of the chessboard in the traversal of all, the ability to look back to the starting point. If the path is displayed
Date : 2026-01-19 Size : 1kb User : 莫海波
[Other] chess DL : 0: 马踏棋盘的演示 -Horse riding horse riding demonstration chessboard chessboard demo
Date : 2026-01-19 Size : 15kb User : lq
[Other] mazhouyou DL : 0: 在n x n棋盘（有n x n个格点的棋盘）的某个格点上有一个中国象棋马，马走日字。求一条周游棋盘的路径，使得马能够从起始位置起沿着该路径每个格点恰好走一次最后回到出发位置。-In the chessboard are like (have are like a checkerboard grid points) of a grid, there is a Chinese chess Ma, Ma date the word go. Seek a path around the board, making horse to starting from the initial position along the path happens to go for each grid point a final return to the starting position.
Date : 2026-01-19 Size : 1.81mb User : kineapple
[Other] mataqipan DL : 0: 将马随即放在国际象棋的8×8棋盘Board[8][8]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1,2,……,64依次填入一个8×8的方阵，输出之。测试数据：由读者指定。可自行指定一个马的初始位置(i,j),0<=i,j<=7。-Ma was on the chess board 8 × 8 of the Board [8] [8] on a grid, Ma 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 obtained routes, the number 1,2, ... ..., 64 followed by an 8 × 8 filled the square, the output of. Test data: designated by the readers. Self-designation of a horse s initial position (i, j), 0 <= i, j <= 7.
Date : 2026-01-19 Size : 22kb User : gaoliming
[Other] mataqipan DL : 0: 国际象棋中马踏棋盘历遍棋盘的走法，各个位置均可以实现。-Chess board calendar of horse riding all over the board walk method can be achieved in various locations.
Date : 2026-01-19 Size : 1kb User : 杨正
[Other] horse DL : 0: this is a program to move horse in che-this is a program to move horse in chess
Date : 2026-01-19 Size : 1kb User : gladiator
[Other] chess DL : 0: 棋盘算法，在给定大小的方格状棋盘上, 将棋子”马”放在指定的起始位置 , 棋子”马” 的走子的规则为必须在棋盘上走”日”字从棋子”马”的起始位置开始, 搜索出一条可行的路径, 使得棋子”马”能走遍棋盘上的所有落子点, 而且每个落子点只能走一次 -Checkerboard algorithm, given the size of the square-shaped board, will be a pawn of " horses" on the specified start position, the pieces of " horses" take the child must be the rules of the board to the " day" word from a pawn " horses, " starting position of the beginning, search out a feasible path, makes the piece" Horse " can be traveled on board all the Lazi, and they can only go once every Lazi point
Date : 2026-01-19 Size : 1.8mb User : 王军
[Other] mataqipan DL : 0: 设计一个国际象棋的马踏遍棋盘的演示程序。将马随机放在国际象棋的8×8棋盘Board[8][8]的某个方格中，马按走棋规则（见题集p98）进行移动。要求每个方格只进入一次，走边棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1,2,3,…,64依次填入一个8×8的方阵，输出之。 -To design a chess board horse travels to the demonstration program. The horses were randomly placed in 8 × 8 chess board Board [8] [8] in a box, horse by walking chess rules (see the title set p98) to move it. Requires that each box is only entered once, take the side of all the 64 squares on a chessboard. The preparation of non-recursive procedures, seeking to run for walking routes, and then find the routes will be the number 1,2,3, ..., 64 in turn fill in an 8 × 8 of the square, the output of.
Date : 2026-01-19 Size : 10kb User : sunyu
[Other] qishixunyou DL : 0: 编写程序求解骑士巡游问题：在n行n列的棋盘上（如n=5），假设一位骑士（按象棋中“马走日”的行走法）从初始坐标位置(x1，y1)出发，要遍访（巡游）棋盘中的每一个位置一次。请编一个程序，为骑士求解巡游“路线图”（或告诉骑士，从某位置出发时，无法遍访整个棋盘 — 问题无解）。当n=5时，意味着要在5行5列的棋盘的25个“点”处，按骑士行走规则，依次将1至25这25个“棋子”（数码）分别摆放到棋盘上（摆满25个位置则成功，否则失败问题无解）。例如，当n=5且初始坐标位置定为(1，1) — 即最左上角的那个点时，如下是一种巡游“路线图”。程序执行后的输出结果为： (x1,y1)? => (1=>5, 1=>5) : 1 1 1 6 15 10 21 14 9 20 5 16 19 2 7 22 11 8 13 24 17 4 25 18 3 12 23-Knight Parade programming to solve the problem: in n rows n columns of the board (such as n = 5), assuming a knight (in chess in the "horse to go on" walking method) from the initial coordinates (x1, y1) starting , to be sung (Parade) board in the position of each of the first. Please compile a program to solve for the Knight Parade "road map" (or tell the knight, starting from a position when not visiting with the board- the problem no solution).
Date : 2026-01-19 Size : 312kb User : 廖
[Other] Hamilton DL : 0: 8*8 的国际象棋棋盘上的一只马，恰好走过除起点外的其它 63 个位置各一次，最后回到起点。这条路线称为一条马的 Hamilton 周游路线。对于给定的 m*n 的国际象棋棋盘，m 和n均为大于5的偶数，且|m-n|≤2，试设计一个分治算法找出一条马的Hamilton周游路线。编程任务：对于给定的偶数m，n≥6，且|m-n|≤2，编程计算 m*n 的国际象棋棋盘一条马的Hamilton 周游路线。 -8* 8 chess board on a horse just walked outside than from the other 63 positions each time, and finally returned to the starting point. This line is called a horse' s Hamilton travel routes. For a given m* n chess board, m and n are even greater than 5, and | mn | ≤ 2, the partition algorithm to design a test to find a horse of Hamilton travel routes. Programming task: For a given even number m, n ≥ 6, and | mn | ≤ 2, programming computing m* n chess board a horse Hamilton travel routes.
Date : 2026-01-19 Size : 4kb User : ahangin
[Other] main DL : 0: 骑士巡游问题：在n行n列的棋盘上（如n=5），假设一位骑士（按象棋中“马走日”的行走法）从初始坐标位置(x1，y1)出发，要遍访（巡游）棋盘中的每一个位置一次。请编一个程序，为骑士求解巡游“路线图”（或告诉骑士，从某位置出发时，无法遍访整个棋盘 — 问题无解）-Knight Parade Question: n row n column board (such as n = 5), assuming a knight (in chess in the " horse to go on" walking method) from the initial coordinates (x1, y1) starting to times Interview (Parade) board in the position of each of the first. Please compile a program to solve for the Knight Parade " road map" (or tell the knight, starting from a position when not visiting with the board- the problem no solution)
Date : 2026-01-19 Size : 1kb User : 吉玉
[Other] zjxiangqi DL : 0: 马踏棋盘，马子在中国象棋棋盘上实现无返回走回所有路程，采用递归，打印出所有设计方案-Horse riding board on the chess board in China, Ma no return back to the all away, using recursion to print out all design
Date : 2026-01-19 Size : 178kb User : 章杰
[Other] tiaoma DL : 0: 跳马问题,就是64个国际象棋格子,任意位置放一个马,如何不重复地把格子走完。-The 64 Chess lattice any position to put a horse
Date : 2026-01-19 Size : 1kb User : xuyan
[Other] The-horse-step-board DL : 0: 马踏棋盘、在文件中分别可选择国际象棋和中国象棋~！-The horse step board、In the file are can choose chess and Chinese chess
Date : 2026-01-19 Size : 2kb User : 小双
[Other] main DL : 0: 根据象棋中马走日规则，规定骑士走的路径，打印骑士走的步数-According to the chess horse day rules require Knight walking the path, print the number of steps to go by the Knight
Date : 2026-01-19 Size : 2kb User : 小山
[Other] Chess-Board-of-traverse DL : 0: 国际象棋棋盘上实现马的遍历（原创），遍历过程有图片显示和路径显示两种方式-Horse on chess board to achieve the ergodic (original), traversal path display a picture display and two ways
Date : 2026-01-19 Size : 3.91mb User : 1
[Other] CHESS DL : 0: The horse moves on a chessboard so that the whole house of sacrifice and not refuse any house twice. be fun.
Date : 2026-01-19 Size : 1kb User : h191_91448549
[Other] MaTaQiPan DL : 0: 马踏棋盘象棋版，自动求出马从棋盘上所有点出发而踏遍所有点的路线并保存在文件中，使用了贪心算法-Horse riding board version of chess, automatic run the board on all points and all over all the points of the route and save the file, using the greedy algorithm
Date : 2026-01-19 Size : 3kb User : 黄英杰
[Other] ma-zhou-you-wen-ti DL : 0: 实验国际象棋棋盘上某位置的马，它是否可能只走63步-Experimental international chess board on a position of the horse, whether it may only take 63 steps
Date : 2026-01-19 Size : 1kb User : 孙卫兵

« 12 »