Description: 骑士从棋盘左下角出发到右下角的走法有多少种？本程序用动态规划的方法实现-Cavaliers starting from the lower left-hand corner of the chessboard of the lower right hand corner of the law to the number of species? This dynamic process planning method Platform: |
Size: 1009 |
Author:吴地瓜 |
Hits:
Description: n皇后问题算法。
* 把棋盘看成一个坐标系，以左下角为原点（0,0)。坐标系的每个点为一个Point类。
* 每个皇后为一个皇后对象Queen。
* 判断一个点的坐标是否在，一个皇后控制的范围的函数为Queen.isUnderControl(point)。
-n Queen's Algorithm. * Chessboard as a coordinate system to lower left-hand corner of the origin (0,0). The coordinates of each point of a Point class. * Each Queen's Queen's target for a Queen. * A judgment whether the coordinates of points in, a Queen's control of the function of Queen.isUnderControl (point) . Platform: |
Size: 4186 |
Author:tangying |
Hits:
Description: 该程序为中国象棋智能下棋引擎.该项目系在Visual Studio.net 2003下所建的Win32控制台项目（使用其它版本的编译器只需新建一个Win32控制台项目，然后逐一加入所有的.cpp文件和.h文件即可），其目的只是简单地测试引擎。因而该程序不提供用户着法的合法性检测，以及棋局的结束处理等。
下棋方式：
用户按输入起点坐标、终点坐标的方式下棋；
（棋盘左下角计作(0,0)，右上角计作(8,9)）
同样，程序反馈起点坐标、终点坐标作为计算机方的走棋行为。
例如：
用户第一步走：炮二平五
则输入7242，回车
计算机回应：马8进7
则屏幕输出79 67-the procedures for Chinese chess smart chess engine. The project was officially in the Department of 2,003 under construction Win32 console project (using other versions of the compiler only one new Win32 Console and then one by one to all. cpp files and the. h document can be), its purpose is simply to test the engines. Thus the procedure does not provide users with the legitimacy of law detection, and the end of the game to handle. Playing chess ways : by user input coordinates of the starting point and ending coordinates of a chess game; (Chessboard dollars for the lower left-hand corner (0,0). Total for the upper right-hand corner (8,9)) Similarly, the feedback process coordinates starting and ending coordinates as a computer game to take the act. For example : users take the first ste Platform: |
Size: 25048 |
Author:dzy |
Hits:
Description: 有多种方法喔!西洋棋中骑士的走法与象棋的马类似,只能横向二格,纵向一格或者横向一格,纵向两格(但是西洋棋棋子必须放在格子中),第1步有2种走法,第二步就有5种走法.今有5*5的棋盘,并将骑士的第一步放于左上角(0,0)的位置,试找出一个路径,使骑士在25步内把剩下的24个位置全部走完.输出结果时,将骑士的路径显示于的5*5的方格中,每一方格内显示出走到此方格内为第同步的数字. -are many ways! Chinese chess knight of the law and take a horse like chess, only two horizontal lattice, a vertical or horizontal one lattice lattice, two vertical lattice (but chess piece must be placed on the lattice), with a further two species go, The second step will take five species law. this is a 5 * 5 chessboard, and the Knights up in the upper left corner, the first step (0, 0) position and try to find a path, Knight to make the 25-step within the remaining 24 locations completed all. Output results, Knight will be on display on the path of the 5 * 5 box, Each box shows left here for the first box synchronization figures. Platform: |
Size: 3964 |
Author:tongyaozhang |
Hits:
Description: 棋盘填数问题 在N*N的棋盘上（1<=N<=10）请填入1，2，...N2共N2个数，使得任意两个相邻的数之和为素数。 填写的方案如： 在这里我们约定：左上角的格子里必须放数字1。 输出：如有多种解，则输出第一行，第一列之和为最小的排列方案；若无解，则输出“NO Answer”-chessboard fill in N * N on the chessboard (1LT; = Nlt; = 10) Please insert 1,2, ... N2 N2 total number, making any two adjacent few and as a prime number. Fill in the program, such as : Here, we agreed : the upper left corner of the grid must be put in the yard a figure. Output : For a variety of solutions, the first line of output, the first out and as a program with the smallest; If not solved, then the output "NO Answer" Platform: |
Size: 880 |
Author:信仰 |
Hits:
Description: 棋盘填数问题 在N*N的棋盘上（1<=N<=10）请填入1，2，...N2共N2个数，使得任意两个相邻的数之和为素数。 填写的方案如： 在这里我们约定：左上角的格子里必须放数字1。 输出：如有多种解，则输出第一行，第一列之和为最小的排列方案；若无解，则输出“NO Answer”-chessboard fill in N* N on the chessboard (1LT; = Nlt; = 10) Please insert 1,2, ... N2 N2 total number, making any two adjacent few and as a prime number. Fill in the program, such as : Here, we agreed : the upper left corner of the grid must be put in the yard a figure. Output : For a variety of solutions, the first line of output, the first out and as a program with the smallest; If not solved, then the output "NO Answer" Platform: |
Size: 1024 |
Author:信仰 |
Hits:
Description: 骑士从棋盘左下角出发到右下角的走法有多少种？本程序用动态规划的方法实现-Cavaliers starting from the lower left-hand corner of the chessboard of the lower right hand corner of the law to the number of species? This dynamic process planning method Platform: |
Size: 1024 |
Author:吴地瓜 |
Hits:
Description: n皇后问题算法。
* 把棋盘看成一个坐标系，以左下角为原点（0,0)。坐标系的每个点为一个Point类。
* 每个皇后为一个皇后对象Queen。
* 判断一个点的坐标是否在，一个皇后控制的范围的函数为Queen.isUnderControl(point)。
-n Queen's Algorithm.* Chessboard as a coordinate system to lower left-hand corner of the origin (0,0). The coordinates of each point of a Point class.* Each Queen's Queen's target for a Queen.* A judgment whether the coordinates of points in, a Queen's control of the function of Queen.isUnderControl (point) . Platform: |
Size: 4096 |
Author:tangying |
Hits:
Description: 有多种方法喔!西洋棋中骑士的走法与象棋的马类似,只能横向二格,纵向一格或者横向一格,纵向两格(但是西洋棋棋子必须放在格子中),第1步有2种走法,第二步就有5种走法.今有5*5的棋盘,并将骑士的第一步放于左上角(0,0)的位置,试找出一个路径,使骑士在25步内把剩下的24个位置全部走完.输出结果时,将骑士的路径显示于的5*5的方格中,每一方格内显示出走到此方格内为第同步的数字. -are many ways! Chinese chess knight of the law and take a horse like chess, only two horizontal lattice, a vertical or horizontal one lattice lattice, two vertical lattice (but chess piece must be placed on the lattice), with a further two species go, The second step will take five species law. this is a 5* 5 chessboard, and the Knights up in the upper left corner, the first step (0, 0) position and try to find a path, Knight to make the 25-step within the remaining 24 locations completed all. Output results, Knight will be on display on the path of the 5* 5 box, Each box shows left here for the first box synchronization figures. Platform: |
Size: 4096 |
Author:tongyaozhang |
Hits:
Description: 中国象棋。该项目系在Visual Studio.net 2003下所建的Win32控制台项目（使用其它版本的编译器只需新建一个Win32控制台项目，然后逐一加入所有的.cpp文件和.h文件即可），其目的只是简单地测试引擎。因而该程序不提供用户着法的合法性检测，以及棋局的结束处理等。
下棋方式：
用户按输入起点坐标、终点坐标的方式下棋；
（棋盘左下角计作(0,0)，右上角计作(8,9)）
同样，程序反馈起点坐标、终点坐标作为计算机方的走棋行为。
例如：
用户第一步走：炮二平五
则输入7242，回车
计算机回应：马8进7
则屏幕输出79 67
-Chinese chess. The project is in Visual Studio.net 2003 built under Win32 console project (using the other version of the compiler simply create a new Win32 console project, and then adding one by one all. Cpp files and. H file can be), its The purpose of simply testing the engine. Thus the program does not provide users with the legitimacy of law detection, and treatment, such as the end game. Play chess the way: the user input according to the starting point coordinates, end coordinates of the way a game of chess (lower left-hand corner of the chessboard for the (0,0), the upper right corner of dollars for (8,9)) Similarly, the starting point coordinates of the feedback process, the end of the coordinates as a computer side acts moves. For example: the user first step: 5 artillery Erping enter 7242, enter the computer in response to: Mr MA 8 into 7-screen output 79 67 Platform: |
Size: 557056 |
Author:ouyang |
Hits:
Description: 使用java开发的马行线问题，实现方式各不不同
在半张中国象棋的棋盘上，一只马从左下角跳到右上角，只允许往右跳，不允许往左跳，问能有多少种跳步方案。（绝对原创）-Using java to develop horse line issue and realize the different ways in each half of Chinese chess chessboard, a horse jumping from the upper right corner of the lower-left corner, allowing only the right jump, jump to the left are not allowed to ask how many step-by-step program of dancing. (Absolute original) Platform: |
Size: 2048 |
Author:胡峰宇 |
Hits:
Description: acm算法设计：
描述：
国际象棋车可以水平或垂直的任何方在同一行或同一列的棋盘。
找到一些最短路径的一个车可以从一个角落里一个棋盘的斜对面角落。
输入：
一整数n为行数和列的棋盘。0 < n <=16
输出：
数量的最短路径。
例输入：
3或4
例输出：
6或20 -Description：
A chess rook can move horizontally or vertically to any square in the same row or in the same column of a chessboard.
Find the number of shortest paths by which a rook can move from one corner of a chessboard to the diagonally opposite corner。
Input：
a interger number n is row and column of chessboard. 0 < n <=16
Output：
the number of shortest paths.
Sample Input：
3or4
Sample Output：
6or20 Platform: |
Size: 211968 |
Author:张波 |
Hits:
Description: This an corner detection of chessboard pattern using the OpenCV function encapsulated in a DLL.
Using the getData.m you can try it with the example picture.-This is an corner detection of chessboard pattern using the OpenCV function encapsulated in a DLL.
Using the getData.m you can try it with the example picture. Platform: |
Size: 20681728 |
Author:Guilherme |
Hits:
Description: 在半张中国象棋的棋盘上，一只马从左下角到右上角，只允许往右跳，不允许往左跳，问能有多少种跳步方案。
-In half a sheet of Chinese chess chessboard, a horse from lower left to upper right corner, allowing only right and jump, jump to the left is not allowed to ask how many hops to have the program. Platform: |
Size: 1024 |
Author:杨梅 |
Hits:
Description: 残缺棋盘问题中利用分而治之的方法，将覆盖2k×2k残缺棋盘的问题转化为覆盖较小残缺棋盘的问题。2k×2k棋盘一个很自然的划分方法就是将它划分为如图1a所示的4个2k-1×2k-1棋盘。当完成这种划分后，4个小棋盘中仅仅有一个棋盘存在残缺方格（因为原来的2k×2k棋盘仅仅有一个残缺方格）。首先用三格板填充中心处把剩下的3个小棋盘转变为残缺棋盘，如图1b所示，其中原2k×2k棋盘中的残缺方格落入左上角的2k-1×2k-1棋盘，分割填充后产生四个小的残缺棋盘，然后，任务转变为分别填充四个小的2k-1×2k-1残缺棋盘，之后可以将每个2k-1×2k-1分别再进行划分。-Board of incomplete problem to divide and rule method, will cover 2 k x 2 k incomplete board into smaller the problem of incomplete board. 2 k x 2 k board a natural division method is divided into as shown in figure 1 a shows the four 2 k-1 x 2 k-1 board. When finished this classification, four small board only have a chessboard exist incomplete squares (because of the original 2 k x 2 k board has only a damaged box). First with three case board at the center of the filling the rest of the three small board into incomplete board, as shown in figure 1 b shows, including the original 2 k x 2 k board of incomplete fall into the top left corner of the box 2 k-1 x 2 k-1 board, divided the generation after filling the incomplete four small board, then, the task into four small were filled with 2 k-1 x 2 k-1 incomplete board, after every 2 k-can be 1 x 2 k-1 respectively to divide again.
Platform: |
Size: 15360 |
Author:李记 |
Hits:
Description: 用于相机标定的棋盘角点检测程序，包含伪角点去除，亚像素角点提取-Chessboard corner detection procedures for camera calibration, including the removal of the pseudo-corner, subpixel corner extraction Platform: |
Size: 2048 |
Author:什么 |
Hits:
Search - chessboard corner