connectsix

五子棋，建立一个棋盘，黑白方相互对下，判断输赢！(fivechess)

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

五子棋，wcf服务端客户端。可聊天。。。。。。。( wuziqi wpf-wcf)

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

简易的中国象棋游戏，用VC++.net编程(Chinese chess)

残缺棋盘问题的VC++实现，用分而治之方法解决此问题(Defective chessboard problem VC++ Realize, using divide and conquer method to solve this problem)

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

JAVA写的简单五子棋程序,无人工智能，两个玩家玩(JAVA written backgammon, no artificial intelligence, two players play)

这是一个象棋游戏，它的运行环境是Linux、Unix之类的操作系统。不仅如此，该游戏也可以在Windows环境下展开配置。尽管这较为复杂。(Chess game working on linux like Operating system。)

说明：  象棋马的哈密顿回路算法代码，分治递归的方法。当m n<24时结果正确。这是重新上传，上一次工程中疏漏没有包含源码。(Hamilton horse chess circuit algorithm code, recursive partition method. When mn &lt 24 hours was correct. This is a re-upload, the last project oversight does not include source code.)