#include <stdio.h>
#include <string.h>
#define N 15
int qipan[N][N];
int test_win(int x, int y, int qipan[][N]); //XY任意一人下的子的位置
{
int i = 0;
int j = 0;
if (qipan[i][j] != 0))
{for (i = 0; i < N; i++)
{
for (j = 0; j < N - 4; j++)
{
if (qipan[i][j] == qipan[i][j + 1]
&& qipan[i][j + 1] == qipan[i][j + 2]
&& qipan[i][j + 2] == qipan[i][j + 3]
&& qipan[i][j + 3] == qipan[i][j + 4] //横着检查
)
{
return qipan[i][j]; //返回数值1/2
}
if (qipan[i][j] == qipan[i + 1][j]
&& qip