Description: 这是一个棋盘游戏，主要用来检测棋盘中棋子以及演算的算法-This is a board game, mainly used to detect in the chess board, as well as calculus algorithm Platform: |
Size: 3997696 |
Author:齐进 |
Hits:
Description: 题目：八皇后问题。
八皇后问题是指求解如何在国际象棋8*8棋盘上无冲突的放置八个皇后棋子。因为在国际象棋里，皇后的移动方式是横竖交叉，所以在任意一个皇后所在的位置的水平，竖直和斜45度都不能有其他棋子的存在。一个完整的无冲突的八皇后棋子分布成为八皇后问题的一个解。设计思路：我使用了回溯的方法来解决八皇后问题，也就是逐次试探的方法。这个方法是通过函数putchess()对自身的递归调用来实现的。运行程序后，主函数调用putchess()函数在棋盘第一行第一列上放置棋子，开始向下一行递归。每一步的递归中，首先检测待放位置有没有冲突出现，如果没有冲突，就放下棋子，并进入下一行递归，否则检测该行的下一个位置。如果整个一行中都没有可以放置的位置，就退回上一层递归。最后，如果本次放置成功，并且递归调用深度为7，就打印输出结果。-Title: Queen s eight questions.
Queen s eight questions refer to how to solve the 8* 8 chess board placed on the eight conflict-free Queen s pawn. Since at chess, the Queen of the mobile means are横竖cross, so at any one location s level, vertical and inclined 45 degrees can not have other pieces exist. A complete conflict-free distribution of the eight Queen s pawn to become queen eight questions a solution. Design ideas: I use a retrospective method to solve the eight Queen s question, that is, successive test method. This method is through the function putchess () recursive calls of their own to achieve. After running the program, the main function call putchess () function at the first line of the first column of the chessboard placed on a pawn down and his party start recursion. Every step of the recursion, the first question put Detect location appears there is no conflict, if there is no conflict, it is down a pawn, and into the next line recursive, otherwise detect the locatio Platform: |
Size: 30720 |
Author:cl |
Hits:
Description: 国际象棋中皇后可以在横、竖、斜线上不限步数地吃掉其他棋子。如何将N个皇后放在一个国际象棋的棋盘上（有8 * 8个方格），使它们谁也不能被吃掉！这就是著名的八皇后问题。我们现在扩展一下，对于某个满足要求的N皇后的摆放方法，定义一个皇后序列与之对应，即{(x1,y1),(x2,y2)…(xN,yN)}，其中(xi∈[1,N]，yi∈[1,N],N∈[4,16]),其中(xi,yi)为相应摆法中第i个皇后所处的坐标（行数和列数）。那么需要针对这个序列进行检测，检测序列给定的皇后们是否存在可以相互吃掉的情况。(In chess, the queen can eat other pieces on the horizontal, vertical and oblique lines. How to put N empress on a chess board (8 * 8 squares), so that none of them can be eaten. This is the famous eight queen problem. Let's expand now, and define a queen's sequence corresponding to the placement method of a N queen to meet the requirements, that is, {(x1, Y1), (X2, Y2). (xN, yN)}, where (Xi, [1, N], Yi, [1, N], N [4,16]), (Xi, Xi) is the coordinate (row number and column number) of the queen in the corresponding pendulum. Then we need to detect this sequence to detect whether the Queens given by the sequence can eat each other.) Platform: |
Size: 5120 |
Author:youxiaoyu |
Hits:
Search - chess board detect