wuziqiyouxi

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

一个简单的五子棋程序，可以人机对弈，采用opencv1.0+vc6.0，来自于网上(A simple backgammon procedures can be man-machine chess, using opencv1.0+ vc6.0, the Internet)

20点小游戏，学会它可以让你在朋友前炫耀一下。(this case is a 20-point game, learn which will allow you to show off at a friend s before)

控制台编的五子棋游戏，用的贪心算法，AI不算太高，但希望对像我一样菜的同学有所启发……(Console compiled 331 games, with the greedy algorithm)

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

五子棋小程序，实现双人对抗，能完成悔棋，复盘，等基本功能。在玩棋时，能自动判禁手以及判赢。(Gobang small procedures, to achieve double confrontation, to complete悔棋, rehabilitation sites, such as basic features. Playing chess, they can automatically cut the hands and sub-contractors to win.)

基于Visual C++实现的局域网象棋游戏，Socket通信，多线程。(design the chess game by use Visual C++ , Socket technology, Mutil Thread.)

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

苏拉卡尔塔棋的源码，可实现人机对战，和搜索树的层次选择(Surakarta chess source code, enabling crew war, and the level of the search tree selection)

这是一个用VC写的五子棋人机对战程序(This is a VC was the man-machine players 331 procedures)