五子棋小游戏

#include <iostream>
using namespace std;

#if 1
#define N    15

int chessboard[N + 1][N + 1] = { 0 };

//用来记录轮到玩家1还是玩家2
int whoseTurn = 0;

void initGame(void);
void printChessboard(void);
void playChess(void);
int judge(int, int);

int main(void)
{
	//初始化游戏
	initGame();

	while (1)
	{
		//每次循环自增1，实现玩家轮流下子
		whoseTurn++;

		playChess();
	}

	return 0;
}

void initGame(void)
{
	char c;

	printf("欢迎^_^请输入y进入游戏：");
	c = getchar();
	if ('y' != c && 'Y' != c)
		exit(0);

	system("clear");
	printChessboard();
}

void printChessboard(void)
{
	int i, j;

	for (i = 0; i <= N; i++)
	{
		for (j = 0; j <= N; j++)
		{
			if (0 == i)
				printf("%3d", j);
			else if (j == 0)
				printf("%3d", i);
			else if (1 == chessboard[i][j])
				printf("  X");
			else if (2 == chessboard[i][j])
				printf("  O");
			else
				printf("  *");
		}
		printf("\n");
	}
}

void playChess(void)
{
	int i, j, winner;

	if (1 == whoseTurn % 2)
	{
		printf("轮到玩家1，请输入棋子的位置，格式为行号+空格+列号：");
		scanf("%d %d", &i, &j);

		//修复BUG 
		while(chessboard[i][j] != 0)
		{
			printf("您要下的位置已经被占用了哦，请重新输入："); 
			scanf("%d %d", &i, &j);
		}
		//修复BUG 

		chessboard[i][j] = 1;
	}
	else
	{
		printf("轮到玩家2，请输入棋子的位置，格式为行号+空格+列号：");
		scanf("%d %d", &i, &j);

		//修复BUG 
		while(chessboard[i][j] != 0)
		{
			printf("您要下的位置已经被占用了哦，请重新输入："); 
			scanf("%d %d", &i, &j);
		}
		//修复BUG 

		chessboard[i][j] = 2;
	}

	system("clear");
	printChessboard();

	if (judge(i, j))
	{
		if (1 == whoseTurn % 2)
		{
			printf("玩家1胜！\n");
			exit(0);    //修复BUG 
		}
		else
		{
			printf("玩家2胜！\n");
			exit(0);    //修复BUG 
		}
	}

}

int judge(int x, int y)
{
	int i, j;
	int t = 2 - whoseTurn % 2;

	for (i = x - 4, j = y; i <= x; i++)
	{
		if (i >= 1 && i <= N - 4 && t == chessboard[i][j] && t == chessboard[i + 1][j] && t == chessboard[i + 2][j] && t == chessboard[i + 3][j] && t == chessboard[i + 4][j])
			return 1;
	}
	for (i = x, j = y - 4; j <= y; j++)
	{
		if (j >= 1 && j <= N - 4 && t == chessboard[i][j] && t == chessboard[i][j + 1] && t == chessboard[i][j + 2] && t == chessboard[i][j + 3] && t == chessboard[i][j + 4])
			return 1;
	}
	for (i = x - 4, j = y - 4; i <= x, j <= y; i++, j++)
	{
		if (i >= 1 && i <= N - 4 && j >= 1 && j <= N - 4 && t == chessboard[i][j] && t == chessboard[i + 1][j + 1] && t == chessboard[i + 2][j + 2] && t == chessboard[i + 3][j + 3] && t == chessboard[i + 4][j + 4])
			return 1;
	}
	for (i = x + 4, j = y - 4; i >= 1, j <= y; i--, j++)
	{
		if (i >= 1 && i <= N - 4 && j >= 1 && j <= N - 4 && t == chessboard[i][j] && t == chessboard[i - 1][j + 1] && t == chessboard[i - 2][j + 2] && t == chessboard[i - 3][j + 3] && t == chessboard[i - 4][j + 4])
			return 1;
	}

	return 0;
}

#endif