穷举五子棋

本想穷举五子棋必胜点,可惜呀,这货穷举太不现实了,代码写出来了,根本没办法运行出来结果

#include <sys/time.h>
#include <stdio.h>
#include <stdbool.h>


#define RL 17
char *s[14] = {[1]="┌","┐","└","┘","├","┤","┬","┴","┼","○","●","×","#"};

int five[RL][RL];

void init(void);
void print(void);
int cs(int i, int j, int chess);

int main(void)
{
	int i, j, chess = 10;
	init();
	for (i = 1; i < RL-1; i++) {
		for (j = 1; j < RL-1; j++) {
			if (five[i][j] != 10 || five[i][j] != 11) {
				struct timeval tis,tie;
				gettimeofday(&tis,NULL);
				int tmp = cs(i,j,chess);
				gettimeofday(&tie,NULL);
				printf("%g\n", tie.tv_sec-tis.tv_sec);
				five[i][j] = tmp == chess ? five[i][j] : tmp == 0 ? 13 : 12;
			}
		}
	}
	print();
	//scanf("%d%d", &i, &j);
	return 0;
}

void init(void)
{
	five[1][1] = 1;
	for (int i = 2; i < RL-2; i++)
		five[1][i] = 7;
	five[1][RL-2] = 2;
	for (int i = 2; i < RL-2; i++) {
		five[i][1] = 5;
		for (int j = 2; j < RL-2; j++) 
			five[i][j] = 9;
		five[i][RL-2] = 6;
	}
	five[RL-2][1] = 3;
	for (int i = 2; i < RL-2; i++)
		five[RL-2][i] = 8;
	five[RL-2][RL-2] = 4;
}

void print(void)
{
	for (int i = 0; i < RL-1; i++)
		printf("%2d", i);
	putchar('\n');
	for (int i = 1; i < RL-1; i++) {
		printf("%2d", i);
		for (int j = 1; j < RL-1; j++)
			printf("%s", s[five[i][j]]);
		putchar('\n');
	}
}

bool full()
{
	for (int i = 1; i < RL-1; i++)
		for (int j = 1; j < RL-1; j++)
			if (five[i][j] != 10 && five[i][j] != 11) return false;
	return true;
}

int ad(int i, int j, int m, int n)
{
	if (five[i][j] == five[i-m][j-n])
		return ad(i+m, j+n, m, n) + 1;
	return 0;
}



bool win(int i, int j)
{
	return (ad(i,j-1,0,-1) + ad(i,j+1,0,1)) > 3 ||
		(ad(i-1,j,-1,0) + ad(i+1,j,1,0)) > 3 ||
		(ad(i-1,j-1,-1,-1) + ad(i+1,j+1,1,1)) > 3 ||
		(ad(i-1,j+1,-1,1) + ad(i+1,j-1,1,-1)) > 3;
}

int cs(int i, int j, int chess) 
{
	int tmp = five[i][j];
	five[i][j] = chess;
	if (win(i,j)) {
		five[i][j] = tmp;
		return chess;
	}
	else if (full()) {
		five[i][j] = tmp;
		return 0;
	}
	bool draw = false;
	for (int m = 1; m < RL-1; m++) {
		for (int n = 1; n < RL-1; n++) {
			if (five[m][n] == 10 || five[m][n] == 11) continue;
			int mid = cs(m, n, chess==10 ? 11 : 10);
			if (mid == (chess==10 ? 11 : 10)) {
				five[i][j] = tmp;
				return (chess==10 ? 11 : 10);
			}
			if (mid == 0)
				draw = true;
		}
	}
	five[i][j] = tmp;
	return draw ? 0 : chess;
}