基础篇
（1）胜负判定
<em>五子棋</em>的胜负判定的条件是其中一方下棋以后，横线、竖线、右上斜线或者右下斜线任一方向出现五子相连，即可判定获胜。此处用递归方法即可实现。
var is_win = false;
var ModuleWinnerCheck = {
checkWinner: function(color, num) {
var col = n...
本文主要介绍<em>五子棋</em>核心<em>算法</em>，利用了<em>一个</em>三维数组来判断4个方向的棋子数，具体代码如下：
public class block
{
//判断0为白棋1为黑棋
private int type;
public int Type
{
get { return type; }
set { type = value; }
}
pr...
Problem Description
The ACM Team of WHU is planning an online AI arena for Go-bang (Five in a Row). Now, we need some help.
We all know the famous game "Five in a Row". It is traditionally played with go pieces (black and white stones) on a go
board (15x15 intersections). The winner is the first player to get an unbroken row of five stones horizontally, vertically, or
diagonally.
We now have an uncompleted game, that is to say, yet no one won. You are required to tell us that whether the next player
could win within one step or not.
Input
The input consists of multiple test cases. The first line of input contains an integer T, which is the number of test cases.
Each test case is a 15 * 15 go board, 'B' represent for a black stone while 'W' for white ones. '.' represents cross with no
stone represented by 0.
[Technical Specification]
T is an integer, and T .
Sample Input
2
........W......
..W......W...B.
.W....B........
.W.......W.....
..BB....W......
...B...........
....B........WW
...........B...
....W..........
.W..B.B....WBB.
BW........B.W.B
...............
W.....BB.W....W
B..B.W.BB....B.
........WW.....
...B...W..BBW..
W..WBW..W...B..
...W..WBW......
.....BWW..B.B..
..BW.B.B..W....
B..W..WBW......
B......B......W
B.B...B....W...
....B.WB...B...
B.W............
.....WW...B....
..B.....B...W.W
.W.........WBW.
B..............
..W.B...W..W..B
Sample Output
NO
YES
电脑AI篇
（3）Minimax<em>算法</em>（极小极大值搜索<em>算法</em>）
这是<em>五子棋</em>AI进行下子位置判断的基本方法，是整个AI最核心的<em>算法</em>。
A minimax algorithm is a recursive algorithm for choosing the next move in an n-player game, usually a two-player game. A valu...
<em>五子棋</em>是一种受大众广泛喜爱的游戏，其规则<em>简单</em>，变化多端，非常富有趣味性和消遣性。这里设计和实现了<em>一个</em>人机对下的<em>五子棋</em>程序，采用了博弈树的方法，应用了剪枝和最大最小树原理进行搜索发现最好的下子位置。介绍<em>五子棋</em>程序的数据结构、评分规则、胜负判断方法和搜索<em>算法</em>过程。一、相关的数据结构 关于盘面情况的表示，以链表形式表示当前盘面的情况，目的是可以允许用户进行悔棋、回退等操作。 CList St
