Description: 马的Hamilton周游路线问题，8*8 的国际象棋棋盘上的一只马，恰好走过除起点外的其它63 个位置各一次，最后回 到起点。这条路线称为一条马的Hamilton 周游路线。对于给定的m*n 的国际象棋棋盘，m和n均为大于5 的偶数，且|m-n|≤2，该算法找出一条马的Hamilton周游路线。-Hamilton horse travel route problem, the 8* 8 chess board on a horse, just walked in addition to the starting point outside the other 63 locations of the first, and finally return to the starting point. This route is called a horse' s Hamilton traveled route. For a given m* n chess board, m and n are even greater than 5, and | mn | ≤ 2, the algorithm to find a horse Hamilton traveled route. Platform: |
Size: 3072 |
Author:yxd |
Hits:
Description: 用数据结构(C语言版)编写程序，实现一个国际象棋的马踏遍棋盘的演示程序。具体要求为：将马随机放在国际象棋的8*8棋盘的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。用堆栈编制非递归程序求出马的行走路线，并按求出的行走路线，将数字1,2,3,……,64依次填入一个8*8的方阵，输出之。 -With the data structure (C language version) to write programs to achieve a chess board horse travels to the demonstration program. Specific requirements are: the horses were randomly placed in the 8* 8 chess board in a box, Ma according to the rules of chess to go mobile. Requires that each box is only entered once, traveled all the 64 squares on a chessboard. The preparation of non-recursive procedure with the stack order 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 matrix, the output of. Platform: |
Size: 4096 |
Author:周敏从 |
Hits:
Description: 设计一个国际象棋的马踏遍棋盘的演示程序。
将马随机放在国际象棋的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. Platform: |
Size: 10240 |
Author:sunyu |
Hits:
Description: 马踏棋盘-设计一个国际象棋的马踏遍棋盘的演示程序。将马随机放在国际象棋的88 棋盘Board88
的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64 个
方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1，2，…，64
依次填入一个88 的阵，输出之。-Horse riding board- design a chess the horse travels chessboard demo program. Horse randomly in 88 of the chess board the Board88 a checkered horse move by playing chess rules. Requirements of each square only enter once, throughout all 64 squares on the chessboard. The preparation of non-recursive program, seeking to run for the routes, and press the routes calculated the numbers 1, 2, ..., 64 turn fill a 88 array, the output of. Platform: |
Size: 1024 |
Author:俞俊 |
Hits:
Search - horse travels the chessboard