Search - chess horse

Search - chess horse - List

[Algorithm] 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 周游路线。 Input 输入数据的第一行有2个正整数m和 n，表示给定的国际象棋棋盘由 m行，每行n个格子组成。 Output 将计算出的马的Hamilton周游路线用下面的2 种表达方式输出。第 1 种表达方式按照马步的次序给出马的 Hamilton 周游路线。马的每一步用所在的方格坐标(x，y)来表示。x表示行的坐标，编号为 0，1，…，m-1；y表示列的坐标，编号为 0， 1，…，n-1。起始方格为（0，0）。第 2 种表达方式在棋盘的方格中标明马到达该方格的步数。（0，0）方格为起跳步，并标明为第1步。 -8* 8 chess board on a horse, just walk outside than from the other 63 positions each time, and finally back To the starting point. This line is called Hamilton a horse 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 tasks: For a given even number m, n ≥ 6, and | mn | ≤ 2, programming computing m* n chess board a horse Hamilton Travel routes. Input The first line of input data are two positive integers m and n, that a given chessboard By the m lines of n-grid component. Output The calculated travel route horse Hamilton 2 with the following expression of the output. The first one kind of expression is given in accordance with the order of the horse Horse Hamilton travel routes. Horse with each step of the square where Grid coordinates (x, y) to represent. the coordinates of x that line, numbered 0,1, ..., m-1 y co
Date : 2026-01-19 Size : 16kb User : zhang
[Algorithm] code DL : 0: 天马行空（马走日字不重复地走完整张N*N棋盘）求解算法-This is the algorithm which can let the horse go all over the chess board without repeating.
Date : 2026-01-19 Size : 2kb User : 时风瞬
[Algorithm] knight DL : 0: 在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 the initial coordinates (x1, y1) starting to visited (Parade) Each board in the first place. 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.)
Date : 2026-01-19 Size : 130kb User : 蔡哲文
[Algorithm] knight2 DL : 0: 8*8的国际象棋棋盘上的一只马，恰好走过除起点外的其它63个位置各一次，最后回到起点，这条线路成为马的一条Hamilton周游路线-8* 8 chess board on a horse, just walked the other outside the starting point of the 63 position each time, and finally back to the starting point, the lines become a horse of a Hamilton traveled route
Date : 2026-01-19 Size : 1kb User : 游素青
[Algorithm] the-horse-working-in-the-chass DL : 0: 实现马踏棋盘的功能。输入：马的初始位置。输出：马踏棋盘的路径。利用贪心算法+回朔算法实现！可以产生全部可能的路径！而且可以可视化的输出动态行走路径！-implementation of the horse working in the chess.
Date : 2026-01-19 Size : 4kb User : 飞天狐
[Algorithm] KnightTour DL : 0: 骑士巡游问题的算法。骑士巡游的问题简述如下：在国际象棋攀上某一位置放置一个马的棋子，然后采用象棋中“马走日字”股则，要求这匹马能不重复地走完25个格子。本实例用枚举方法求解骑士巡游问题。程序可自定义棋盘的大小，先输出标志矩阵，然后输入骑士在棋盘的初始位置，即可给出其中的一种解法。-Knight Parade algorithm problem. Knight Parade problems are summarized as follows: Place a horse chess piece on climbing a location, and then using chess " horse to go on the word" shares, requiring repeated this horse can not finish the 25 squares. The examples of enumeration method for solving the problem knights parade. Program can be custom-sized chessboard, the first output flag matrix, and then enter the initial position of the knight on the board, you can give them a solution.
Date : 2026-01-19 Size : 1kb User :