CSharp-lianliankan

一个用Visal C++编写的俄罗斯方块小程序。(A used Visal C++ Prepared Tetris applet.)

简单五子棋，简单学习算法，很弱的AI，原文是Python语句，现改写位c++(Simple backgammon, simple learning algorithm, very weak AI, the original is a Python statement, is now rewritten bit c++)

台湾人写的五子棋源码，很早以前收集的，看了几天才懂！(Taiwanese wrote renju source, the collection of long ago, after reading a few days can understand!)

说明：  简单的实现了六子棋的功能，小白做的，希望大家多多关照。(Simple realization of the six chess function, made by Xiaobai, I hope you care more.)

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

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)

C语言游戏——五子棋，文中详细描述了五子棋游戏的设计规则，如何操作，而且有注释，可以简单明了的看懂操作(C language games- backgammon, backgammon paper describes in detail the design rules of the game, how to operate, and there are notes, you can understand straightforward operation)

gobang五子棋，实现可视化和双人对战 ，另外人机对战还待完善(Gobang, to achieve visualization and double battle, and the man-machine battle is yet to be improved.)

在一个8×8国际象棋盘上，有8个皇后，每个皇后占一格；要求皇后间不会出现相互"攻击"的现象,即不能有两个皇后处在同一行、同一列或同一对角线上。问共有多少种不同的方法。 本算法采用一维数组来进行处理。数组的下标i表示棋盘上的第i列，a[i]的值表示皇后在第i列所放的位置。如：a[1]=5，表示在棋盘的第一例的第五行放一个皇后。(8 × 8 in a chess set, there s eight, each accounting for a Queen s grid request will not be any mutual between Queen s attack phenomenon, that can not have two Queen s in the same line, the same row or the same diagonal. Asked the total number of different ways. This algorithm uses one-dimensional array to be processed. Array subscript i said i chessboard first out, a [i] value that s in the first place i listed by location. Such as: a [1] = 5, said the first cases in the chessboard of the fifth line of a Queen s release.)