Search - chess horse

Search - chess horse - List

[Chess Poker games] 中国象棋源代码 DL : 1: CChessUG 小组将在 MantisChess 的基础上开发一个高水准的中国象棋软件，主要实现以下功能：一、较高水平的人机对弈，实现外挂的人工智能插件。二、Internet联网对弈。三、棋谱管理功能。-CChessUG group will develop a high standard in the MantisChess foundation Chinese chess software below, mainly will realize the function: First, compares the high level the man-machine playing chess, the artificial intelligence plug-in unit which outside the realization hangs. Second, Internet networking playing chess. Third, chess manual management function.
Date : 2026-01-19 Size : 143kb User : 马文晓
[Chess Poker games] rute DL : 0: 在m行n列棋盘的S点处有一中国象棋马，给出棋盘上的另一点T，设T在S的右边（如下图所示）。规定马走日字且只能向右走，要从S走到T，马至少要走多少步?-In the m line n chessboard out of the S point has one Chinese chess horse, given chessboard another point T, located the right side of T in S (as in the figure below). Ma date the provisions of the word go and only go to the right, from S go T, Ma, at least the number of steps to go?
Date : 2026-01-19 Size : 215kb User : wu
[Chess Poker games] knight DL : 0: 2、写出6×6方阵的骑士周游的解。要求骑士的起跳位置是任意指定的。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字依次填入6×6的方阵中，并输出。（骑士周游：从起始位置出发，按国际象棋马的走法，不重复地将所有区域恰好走一遍。） -2, write a 6 × 6 square Cavalier travel solution. Requirements of the take-off position Cavalier arbitrary specified. The preparation of non-recursive procedures, and run routes, and routes are obtained, will be followed by fill in the number of 6 × 6 square, and the output. (Cavalier tour: starting from the initial position, according to the international chess horse walk method, not all regions will be repeated just go again.)
Date : 2026-01-19 Size : 1kb User : yang
[Chess Poker games] sy61 DL : 0: 回朔算法，马的周游问题：在n x n棋盘（有n x n个格点的棋盘）的某个格点上有一个中国象棋马，马走日字。求一条周游棋盘的路径，使得马能够从起始位置起沿着该路径每个格点恰好走一次最后回到出发位置。-Retrospective algorithm, horse around the problem: in the checkerboard are like (there are like a checkerboard grid points) of a grid, there is a Chinese chess horse, horse go on the word. 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 : 3kb User : 00
[Chess Poker games] house DL : 0: 马踏棋盘问题描述设计一个国际象棋的马踏遍棋盘的演示程序。2．基本要求将马随机放在国际象棋8*8棋盘的某个方格中，马按走棋规则进行移动。编制非递归程序，求出马的行走路线，-Horse riding problem described in the design of a chessboard chess chessboard horse traveled demo program. 2. The basic requirements will be placed randomly MA 8* 8 chess board in a grid, Ma moves in accordance with the rules of the mobile. The preparation of non-recursive procedures, and run routes,
Date : 2026-01-19 Size : 1kb User : dongchao
[Chess Poker games] qipan DL : 0: 设计一个国际象棋的马踏棋盘的演示程序。以一二维数组Board[8][8]表示国际象棋棋盘，以用户输入任一位置作为马的起始位置，设为(i,j)，其中0≤i，j≤7，马按照走棋的规则在棋盘范围内进行移动。本程序只求出一种遍历路径，用非递归程序实现吗的行走路线。-To design a chess board horse riding demo program. A two-dimensional array Board [8] [8] that the chess board to the user to enter any one location as the initial location of the horse, set (i, j), in which 0 ≤ i, j ≤ 7, in accordance with the following horse the rules of chess board mobile framework. This procedure only a traversal path, the use of non-recursive process routes to achieve it.
Date : 2026-01-19 Size : 9kb User : chissie
[Chess Poker games] mataqipan DL : 0: 将马随机放在国际象棋的8×8棋盘Board[0～7][0～7]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1，2，…，64依次填入一个8×8的方阵，输出之 -Ma Random Chess on the 8 × 8 chessboard Board [0 ~ 7] [0 ~ 7] 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 an 8 × 8 filled the square, the output of
Date : 2026-01-19 Size : 3kb User : 刘洋河
[Chess Poker games] horse10.8 DL : 0: 国际棋盘上马的周游问题，该问题描述了国际象棋棋盘上的一只马，恰好走过除起点外的其它位置各一次，最后回到起点。这条路线称为一条马的Hamilton 周游路线-Launched an international board of the travel issue that describes the chess board on a horse, just walked outside the other locations except the starting point of all time, finally returned to the starting point. This line is called a horse' s Hamilton tour route
Date : 2026-01-19 Size : 57kb User : 于爱华
[Chess Poker games] ma DL : 0: 本程序解决了关于国际象棋中马的周游路线问题，根据给出的初始点可以求出满足条件的所有路径。-This procedure resolved on chess in the horse traveled route, under the given conditions, the initial points can be derived to satisfy all the paths.
Date : 2026-01-19 Size : 521kb User : 荣峰华
[Chess Poker games] bianliwenti DL : 0: 中国象棋马的棋盘遍历程序，对任意位置上放置的一个马，均能选择一个合适的路线，使得该棋子能按象棋的规划不重复地走过棋盘上的每一个位置-Chinese Chess board horse traversal procedures, placed anywhere on a horse, able to choose a suitable route, making the chess pieces can be according to the planning board did not repeatedly traversed a position on every
Date : 2026-01-19 Size : 2kb User : maya
[Chess Poker games] horse_CSDN DL : 0: 跳马的回溯算法（8*8 的国际象棋棋盘上的一只马，恰好走过除起点外的其它63 个位置各一次，最后回到起点。这条路线称为一条马的Hamilton 周游路线。对于给定的m*n 的国际象棋棋盘，m和n均为大于5 的偶数，且|m-n|≤2，该算法找出一条马的Hamilton周游路线。--Vault of the backtracking algorithm (8* 8 chess board on a horse, just walk outside except from the other 63 locations each time, finally returned to the starting point. This line is called a horse' s Hamilton traveled routes. For the a given m* n chess board, m and n are greater than 5, even, and | mn | ≤ 2, the algorithm is to find a horse' s Hamilton traveled routes.--
Date : 2026-01-19 Size : 3kb User : cheneiz
[Chess Poker games] console DL : 0: 象棋马的哈密顿回路算法代码，分治递归的方法。当m n<24时结果正确。这是重新上传，上一次工程中疏漏没有包含源码。-Hamilton horse chess circuit algorithm code, recursive partition method. When mn < 24 hours was correct. This is a re-upload, the last project oversight does not include source code.
Date : 2026-01-19 Size : 3.52mb User : 王丽玮
[Chess Poker games] chess DL : 0: 用vc实现国际象棋，例如棋盘的设计，马，皇后的走法等等各种操作。-Achieved with the vc chess, such as board design, horse, Queen' s moves and so on all kinds of operations.
Date : 2026-01-19 Size : 3.75mb User : 圣王
[Chess Poker games] Horse DL : 0: 国际象棋马的遍历单文档回到原点鼠标控制源代码运行无误 -Chess horses traverse the document back to square one mouse control the source code to run correct
Date : 2026-01-19 Size : 2mb User : seven
[Chess Poker games] ChessHorse DL : 0: 在一个具有8×8个方格的国际象棋盘上，从棋盘的任何一个方格开始，让马按照允许的走步规则（L形走法）走遍所有方格，每个方格至少并且只准走过一次。-In an 8 × 8 squares on the international chess board,start from any squar of chess board,Walking the horse in accordance with the rules allowed (L-shaped moves) traveled all the squars,Each squar and will only be allowed through at least once
Date : 2026-01-19 Size : 162kb User : 周阳宝
[Chess Poker games] Traversal-of-horse DL : 0: 在中国象棋棋盘上，对任一位置上放置的一个马，均能选择一个合适的路线，使得该棋子能按象棋的规则不重复地走过棋盘上的每一个位置。完成以下功能：（1）依次输出所走过的各位置的坐标；（2）最好能画出棋盘的图形形式，并在其上动态的标注行走过程；（3）程序能方便地移植到其它规格的棋盘上。 -In Chinese chess board, the location of any place on a horse, able to select a suitable route, making the pieces do not follow the rules of chess board repeatedly through every position. Complete the following functions: (1) followed by the output through the coordinates of each location (2) better to draw the board' s graphic form, and in its walk on the dynamic process of labeling (3) program can be easily ported to Other specifications of the board.
Date : 2026-01-19 Size : 2kb User : 冰与火
[Chess Poker games] horse DL : 0: ：将马随机放在国际象棋的8X8棋盘Bo阿rd[0..7,0..7]的某个方格中，马按走棋规则进行移动。要求每个方格上只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1，2，…，64依次填入8X8的方阵输出之。- The horses were placed in the 8X8 chess board Bo A rd [0 .. 7,0 .. 7] of a box, the horse to move according to the rules for playing chess. Requires that each box is only entered once, traveled all the 64 squares on a chessboard. The preparation of non-recursive program, seeking to run for the routes, according to find the routes for the digital 1,2, ..., 64 in turn fill the square 8X8 output.
Date : 2026-01-19 Size : 2kb User : Julie
[Chess Poker games] 0810610 DL : 0: 编写程序求解“骑士巡游”问题：在n行n列的棋盘上（如n=5），假设一位骑士（按国际象棋中“马走日”的行走法）从初始坐标位置(x，y)出发，要遍访（巡游）棋盘中的每一个位置有且仅有一次。请编一个程序，为骑士求解巡游“路线图”（或告诉骑士，从某位置出发时，无法遍访整个棋盘 — 问题无解）。由于n比较大的时候输出结果会很多，以至于运行时间很长，没有实际意义，所以本程序只做了n=5的时候的情况。-Write a program for solving the Knight Parade ": n lines n columns on the board (eg, n = 5), assuming that a knight (chess" horse walk "walking method) from the initial coordinate position (x,y), starting to be visited (parade) board in each position and only once. Please compile a program, and solving for Knight Parade "road map" (or tell the knight, starting from a position can not be visited the whole board- no solution). Since n is relatively large when the output result will be a lot of that running time is very long, has no real meaning, so this procedure only when n = 5.
Date : 2026-01-19 Size : 1kb User : MK
[Chess Poker games] Chess DL : 0: 自己编写的关于一个马跳日的小游戏，用的是国际象棋的棋盘，有图形界面。-I have written on the day of a horse jumping games, chess board, a graphical interface.
Date : 2026-01-19 Size : 24kb User : 猫猫大仙
[Chess Poker games] Horse-Stepping-on-board DL : 0: 在传统中国象棋中，马走日型路线。本代码就是按其规则，让马从棋盘任一点开始，输出它可以行走的所有点的坐标。-In traditional Chinese chess, horse go day-type line. The code according to the rules, let the horse from checkerboard any point, the coordinates of all points of output it can walk.
Date : 2026-01-19 Size : 1kb User : 生菜贝贝

« 12 »