ttq

五子棋人机对战，离线存档，可以悔棋，切换先手(Backgammon machine war, offline archive can undo switch the upper hand)

Function: // riffle Description: // 洗牌,然后随机的得到9张牌,要求九张牌不能有重复. Calls: // Called By: // main() Table Accessed: //被修改的表（此项仅对于牵扯到数据库操作的程序） Table Updated: // 被修改的表（此项仅对于牵扯到数据库操作的程序） Input: //Card card[] 牌结构, int size 结构数组的大小 Output: //(Function:// riffle Description:// shuffle, and then randomly get nine cards, requiring nine cards can not be duplicated. Calls:// Called By:// main () Table Accessed:// modified table ( This only involves the operation of the database for the program) Table Updated:// modified table (this only involves the operation of the database for the program) Input:// Card card [] licensing structure, int size structure of the array size Output ://)

说明：  [趣味程序导学Visual.Cpp].董未名.文字版MFC，全是游戏实例([gout program guiding Visual. Cpp]. Tung. Text version MFC weiming，All game example)

网狐原版网站后台，绝对完整！超值！！！！(code wh web aaaaaaa)

人机下棋：在3×3棋盘上，计算机为一方，用户为一方，交替画“X”和“O”，在行、列、对角线上谁先练成一条直线谁就获得胜利。用类的思想完成，具体功能要求如下： （1）状态显示：计算机可正确显示棋盘，给出提示信息和胜负判断。 （2）用户选择：用户可以选择是先下还是后下，并选择棋子是“X”还是“O”。 （3）每一步都用图形化方式顺序输出 (Man-machine chess: on the 3 X 3 board, the computer for one party, the user for a party, draw an X and O alternately, in the row, column and diagonal who practice who would win in a straight line. Finish, with the ideas of the class specific functional requirements are as follows: (1) status display: the computer can correctly display board, giving prompt information and the outcome of judgment. (2) the user choice: the user can next is first or after, and the pieces is a X or O .)

象棋是一种完全知识博弈，本书介绍一些技术应用于这种博弈(Chess is a game full of knowledge, the book introduces some of the techniques used in this game)

说明：  俄罗斯方块 一道简易的俄罗斯方块的制作 附源代码(Tetris Tetris together simple source code for the production of by-laws)

这是一个苏拉卡尔塔的程序 包括界面设计和后台代码(This is a program of Surakarta, including interface design and code-behind)

该工程是一个非常完整的,优化的五子棋源代码(VC),可以帮你学习路径选择算法和vc编程.(The project is a very complete, optimized Gobang source code (VC), can help you learn the path selection algorithm and programming vc.)

： N皇后问题，在一个N×N国际象棋盘 上，有N个皇后，每个皇后占一格；要求皇后间不会出现 相互“攻击”的现象，即不能有两个皇后处在同一行、同一 列或同一对角线上。问共有多少种不同的方法。下图以4 个皇后为例，说明一个正确的解（ N是一个大于等于2并 且小于等于100的整数）(: N queens problem, a NN chess disk, N-Queen, Queen of the grid requirements between each other " attack" phenomenon does not appear in the Queen' s, that can not have two queens in the same row , the same column or on the diagonal. Asked a total of a number of different ways. The following diagram 4 Queen, for example, indicating that a correct solution (N is a number greater than or equal to 2 and less than or equal to an integer of 100))