five

： 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))

VC编程游戏,这本电子书不是太难，书中罗列了几个经典的小游戏：五子棋，俄罗斯方块。。。。(use VC++ to design little games,it is not very complex,which can help the VC beginers )

这是一个vc++的中国象棋的程序设计，较为方便(This is a vc++ programming Chinese chess, more convenient)

实现五子棋的功能，且是一个比较简单移动的程序(Realize the function of renju, and is a relatively simple mobile program )

幻影围棋棋源代码，参加计算机博弈比大赛亚军的代码。(Phantom Go chess source code, to participate in a computer game than the runner-up code.)

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 ://)

socket实现象棋游戏联网，程序中iP和port已指定，运行时根据自己的ip改下就行(chinese chess)

网络版本的五子棋.支持聊天,支持20桌同时进行游戏.(network version of the 331. Chat support, the support of 20 tables simultaneously game.)

一个五子棋源码 .(a source.)

中国象棋 重庆大学出版社出版的《PC游戏编程（人机博弈）》一书的配套光盘内容。( Discs supporting Chongqing University Press published "PC game programming (man-machine game)," a book)