五子棋游戏（图形化界面）——C语言代码实现

#include<stdio.h>
#include<graphics.h>
#include<conio.h>

#define WIDTH 40
#define ROW_COL 15

void BoardInit();
void PieceDrawing(int x, int y, int* cnt, int* map);
int JudgeBoundary(int a);
int WinJudge(int* map);

int main()
{
	MOUSEMSG msg;
	int cnt = 0;		//记录轮数
	int map[ROW_COL][ROW_COL] = { 0 };

	BoardInit();

	while (1)
	{
		//持续监听鼠标点击事件
		msg = GetMouseMsg();
		if (msg.uMsg == WM_LBUTTONDOWN)
		{
			PieceDrawing(msg.x, msg.y, &cnt, &map[0][0]);
		}
	}

	return 0;
}

void BoardInit()
{
	//绘制棋盘
	initgraph(WIDTH * (ROW_COL + 1), WIDTH * (ROW_COL + 1));//初始化窗口大小
	setbkcolor(YELLOW);//背景颜色
	cleardevice();//用背景颜色遮盖原始屏幕
	setlinestyle(PS_SOLID, 2);//设置成实线，宽度为2个像素实线的粗细
	setcolor(RGB(0, 0, 0));//设置成黑色，前景颜色 不能用setlinrcolor因为没有定义line
	settextcolor(RGB(0, 0, 0));
	settextstyle(50, 0, _T("Consolas"));
	for (int i = 1; i <= ROW_COL; i++)
	{
		line(i * WIDTH, WIDTH, i * WIDTH, ROW_COL * WIDTH);//x改变，平行于与y轴的线
		line(WIDTH, i * WIDTH, ROW_COL * WIDTH, i * WIDTH);//y改变，平行于x轴的线
	}
}

void PieceDrawing(int x, int y, int* cnt, int* map)
{
	x = JudgeBoundary(x) - 1;
	y = JudgeBoundary(y) - 1;
	int* p = map + x + y * ROW_COL;
	if (x != -1 && y != -1 && *p == 0)
	{
		(*cnt)++;
		if ((*cnt) % 2 == 0)
		{
			setfillcolor(RGB(255, 255, 255));
			*p = -1;
		}
		else
		{
			setfillcolor(RGB(0, 0, 0));
			*p = 1;
		}
		fillcircle((x + 1) * WIDTH, (y + 1) * WIDTH, WIDTH / 2 - 1);
		int isWin = WinJudge(map);
		printf("iswin:%d\n", isWin);
		if (isWin != 0)
		{
			printf("game over\n");
			if (isWin > 0)
			{
				outtextxy(WIDTH, WIDTH * ROW_COL / 2, _T("黑子获胜"));
			}
			else
			{
				outtextxy(WIDTH, WIDTH * ROW_COL / 2, _T("白子获胜"));
			}
			while (1)
			{
				//持续监听鼠标点击事件
				MOUSEMSG msg = GetMouseMsg();
				if (msg.uMsg == WM_LBUTTONDOWN)
				{
					*cnt = 0;
					for (int i = 0; i < ROW_COL; i++)
					{
						for (int j = 0; j < ROW_COL; j++)
						{
							*(map + i + j * ROW_COL) = 0;
						}
					}
					closegraph();
					BoardInit();
					break;
				}
			}
		}
	}
}

int JudgeBoundary(int a)
{
	//找到鼠标点击处最近的落子点
	if (a % WIDTH < WIDTH * 0.3)
	{
		a = a / WIDTH;
	}
	else if (a % WIDTH > WIDTH * 0.7)
	{
		a = a / WIDTH + 1;
	}
	else
	{
		a = 0;
	}

	if (a > ROW_COL)
	{
		a = 0;
	}
	return a;
}

int WinJudge(int* map)
{
	int isWin = 0;
	int x[4] = { -1,0,1,1 };
	int y[4] = { -1,-1,-1,0 };
	//搜索是否有五子连珠
	for (int i = 0; i < ROW_COL; i++)
	{
		for (int j = 0; j < ROW_COL; j++)
		{
			int* p = map + j*ROW_COL + i;
			for (int k = 0; k < 4; k++)
			{
				if (i + 2 * x[k] >= 0 && i + 2 * x[k] < ROW_COL &&
					i - 2 * x[k] >= 0 && i - 2 * x[k] < ROW_COL &&
					j + 2 * y[k] >= 0 && j + 2 * y[k] < ROW_COL &&
					j - 2 * y[k] >= 0 && i - 2 * y[k] < ROW_COL)
				{
					isWin = *(p + x[k] + y[k] * ROW_COL) + *(p + 2 * x[k] + 2 * y[k] * ROW_COL) + *(p - x[k] - y[k] * ROW_COL) + *(p - 2 * x[k] - 2 * y[k] * ROW_COL) + *p;
					//printf("search:%d\n", isWin);
					if (abs(isWin)==5)
					{
						return isWin;
					}
				}
			}
		}
	}
	return 0;
}