Search - a-w - CodeBus

Search - a-w - List

[Chess Poker games] wu_zi_qi DL : 0: 五子棋小游戏,显示一个16×16的棋盘。在适当位置显示双方剩余时间，格式为（分：秒）。在棋盘交叉点，按鼠标左键交替放置黑白棋，若原先位置已放子，则拒绝放置。可进行屏幕最小化、最大化和移动操作。若有黑子或白子放下后成五子（纵/横/斜），则提示某方获胜。某方用时到，则提示对方获胜。 -Gobang game, showing a 16 × 16 chessboard. Location at the appropriate time for both the remainder of the format (minutes: seconds). In the cross-board, according to the turn of the left mouse button to place Reversi, if the original location has been sub-let, then refused to place. Screen can be minimized, maximized and mobile operator. If sunspot or Shirako down into five sub-after (vertical/horizontal/oblique), then prompts for a party to win. When a party to, it prompts the other to win.
Date : 2025-12-29 Size : 31kb User :
[Chess Poker games] b-w-chess DL : 0: 一个vc++编的黑白棋的小游戏，，开发游戏的可以- a game named black-white chess for game development.
Date : 2025-12-29 Size : 405kb User : xy
[Chess Poker games] gaiyaoshejishuoming DL : 0: 五子棋概要设计说明书从程序表面看，这是一个二维平面图，所以数据用二维数组来表示，数组两个下标可以表示棋盘上的位置，数组元素的值代表棋格上的状态，共有三种情况，分别是0代表空格，1代表白棋，2代表黑棋。这样程序的主要工作是接收棋手按键操作，棋手1用Up、Down、Left、Right控制光标移动，回车键表示落子。棋手2用W、S、A、D控制光标移动，空格键表示落子。一旦接收到回车键或空格键，说明棋手落子，先判断是否是有效位置，也就是说已经有棋子的位置不能重叠落子。落子成功后，马上判断以该位置为中心的八个方向：上、下、左、右、左上、左下、右上、右下是否有相同颜色的棋子连成五子，如果连成五子，则游戏结束，输出相应的信息。如果想退出游戏，可以按Esc键-Surface from the program, which is a two-dimensional floor plan, so the data represented by two-dimensional array, the array can be expressed both subscript position on the board, the value of array elements on the grid on behalf of the state of chess, a total of three cases, respectively, is 0 for a space, 1 White, 2 for black. The main work of this program is to receive player button operation, player 1 with Up, Down, Left, Right control cursor movement, the Enter key that Laozi. 2 players with the W, S, A, D control cursor movement, the space bar that Laozi. Upon receiving the enter key or space bar, that player Lazi, first determine whether the location is valid, that has been the location of pieces can not overlap Lazi. After the success of Lazi, immediately determine the location of the center of the eight directions: up, down, left, right, left, lower left, upper right, lower right have the same color of the pieces together into five sub, if even as five children, the game is ov
Date : 2025-12-29 Size : 28kb User : yexiushu
[Chess Poker games] QTchees DL : 0: QT象棋源码 #include <qapplication.h> #include "main_form.h" int main( int argc, char ** argv ) { QApplication a( argc, argv ) MainForm w w.initializeAll() w.show() a.connect( &a, SIGNAL( lastWindowClosed() ), &a, SLOT( quit() ) ) return a.exec() } -QT chess source
Date : 2025-12-29 Size : 62kb User : 啊
[Chess Poker games] w DL : 0: 一个小的五子棋代码，从百度文库下的！请见谅！-A small backgammon code library from Baidu under! Please forgive me!
Date : 2025-12-29 Size : 14kb User : 卡卡
[Chess Poker games] Chess DL : 0: 国际象棋是世界上最古老的博弈游戏之一，和中国的围棋、象棋以及日本的将棋同享盛名。据说国际象棋起源于易经的思想，棋盘是一个8*8大小的黑白相间的方阵，对应八八六十四卦，黑白对应阴阳。而我们的主人公小Q，正是国际象棋的狂热爱好者。作为一个顶尖高手，他已不满足于普通的棋盘与规则，于是他跟他的好朋友小W决定将棋盘扩大以适应他们的新规则。小Q找到了一张由N*M个正方形的格子组成的矩形纸片，每个格子被涂有黑白两种颜色之一。小Q想在这种纸中裁减一部分作为新棋盘，当然，他希望这个棋盘尽可能的大。不过小Q还没有决定是找一个正方形的棋盘还是一个矩形的棋盘（当然，不管哪种，棋盘必须都黑白相间，即相邻的格子不同色），所以他希望可以找到最大的正方形棋盘面积和最大的矩形棋盘面积，从而决定哪个更好一些。于是小Q找到了即将参加全国信息学竞赛的你，你能帮助他么？-Chess is the world s oldest game one of the games, and chess, chess and Japanese This will share the chess reputation. Said that the idea of chess originated in the Book of Changes, the board is an 8* 8 Small black and white square corresponds to eighty-eight 60 hexagrams, black and white corresponds to yin and yang. And our Lord Human male is small and Q is the chess enthusiast. As a top players, he has not satisfied Ordinary board and rules, so he decided with his good friend, Small W board to expand to accommodate Are the new rules. Q to find an N* M square lattice composed of rectangular pieces of paper, each A grid is coated with black or white one. Q want to cut part of the new chess in this paper Disk, of course, he hoped that this board as large as possible. Little Q has not been decided is to find a positive The square of the board is a rectangular board (of course, no matter what kind of board must be black & white Lattice different colors), that is adjacent to, so h
Date : 2025-12-29 Size : 1kb User : xqj
[Chess Poker games] EightQueen_bcb6 DL : 0: (This is Borland C++Builder version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have worked on this puzzle and its generalized n-queens problem. The first solutions were provided by Franz Nauck in 1850. Nauck also extended the puzzle to n-queens problem (on an n×n board—a chessboard of arbitrary size). In 1874, S. Günther proposed a method of finding solutions by using determinants, and J.W.L. Glaisher refined this approach. Edsger Dijkstra used this problem in 1972 to illustrate the power of what he called structured programming. He published a highly detailed description of the development of a depth-first backtracking algorithm.
Date : 2025-12-29 Size : 287kb User : yout
[Chess Poker games] EightQueen_java DL : 0: (This is Java version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have worked on this puzzle and its generalized n-queens problem. The first solutions were provided by Franz Nauck in 1850. Nauck also extended the puzzle to n-queens problem (on an n×n board—a chessboard of arbitrary size). In 1874, S. Günther proposed a method of finding solutions by using determinants, and J.W.L. Glaisher refined this approach. Edsger Dijkstra used this problem in 1972 to illustrate the power of what he called structured programming. He published a highly detailed description of the development of a depth-first backtracking algorithm.
Date : 2025-12-29 Size : 118kb User : yout
[Chess Poker games] EightQueen_vb DL : 0: (This is Visual Basic 6 version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have worked on this puzzle and its generalized n-queens problem. The first solutions were provided by Franz Nauck in 1850. Nauck also extended the puzzle to n-queens problem (on an n×n board—a chessboard of arbitrary size). In 1874, S. Günther proposed a method of finding solutions by using determinants, and J.W.L. Glaisher refined this approach. Edsger Dijkstra used this problem in 1972 to illustrate the power of what he called structured programming. He published a highly detailed description of the development of a depth-first backtracking algorithm.
Date : 2025-12-29 Size : 31kb User : yout
[Chess Poker games] EightQueen_vs2008 DL : 0: (This is VS2008 version) The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so was originally proposed in 1848 by the chess player Max Bezzel, and over the years, many mathematicians, including Gauss, have worked on this puzzle and its generalized n-queens problem. The first solutions were provided by Franz Nauck in 1850. Nauck also extended the puzzle to n-queens problem (on an n×n board—a chessboard of arbitrary size). In 1874, S. Günther proposed a method of finding solutions by using determinants, and J.W.L. Glaisher refined this approach. Edsger Dijkstra used this problem in 1972 to illustrate the power of what he called structured programming. He published a highly detailed description of the development of a depth-first backtracking algorithm.
Date : 2025-12-29 Size : 164kb User : yout
[Chess Poker games] TETRISWITHAI DL : 0: AI采用的是只看当前方块的Pierre Dellacherie算法的改进方案，据说可以摆几十W个不死，不过我把一个好算法实现渣了，只能摆到1W左右，最多最多的一次摆到了6W 注释里有对算法的说明-AI uses a look at the current improvement program Pierre Dellacherie algorithm box, put tens of W is said to be immortal, but I put a good algorithm slag, and only placed around 1W, up to a maximum of once placed in a 6W There are notes on the algorithm description
Date : 2025-12-29 Size : 9kb User : vesrl