C语言如何实现三子棋

#define _CRT_SECURE_NO_WARNINGS 1
 
#include "game.h"
 
 
void menu()
{
	printf("******************\n");
	printf("******1.play******\n");
	printf("******0.exit******\n");
	printf("******************\n");
}
 
 
void game()
{
	char arr[ROW][COL] = { 0 };
	init_arr(arr, ROW, COL);
	show_arr(arr, ROW, COL);
}
 
int main()
{
	int input = 0;
	do
	{
		menu();
		printf("请选择->: ");
		scanf("%d", &input);
		switch (input)
		{
		case 1:
			printf("开始游戏\n");
			game();
			break;
		case 0:
			printf("退出游戏");
			break;
		default:
			printf("输入错误请重新输入\n");
			break;
		}
	} while (input);
	return 0;
}

#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#define ROW 3
#define COL 3 //这里的设置是为了方便以后改动
 
void init_arr(char arr[ROW][COL], int row, int col);//小写是为了不与常量名冲突
 
void show_arr(char arr[ROW][COL], int row, int col);//打印数组

void init_arr(char arr[ROW][COL], int row, int col)
{
	int i = 0;
	int j = 0;
	for (i = 0; i < row; i++)
	{
		for (j = 0; j < col; j++)
		{
			arr[i][j] = ' ';
		}
	}
}

void show_arr(char arr[ROW][COL], int row, int col)
{
	int i = 0;
	int j = 0;
	for (i = 0; i < row; i++)
	{
		for (j = 0; j < col; j++)
		{
			printf(" %c ", arr[i][j]);
			if (j < col - 1)
			{
				printf("|");
			}
		}
		printf("\n");
		for (j = 0; j < col; j++) 
		{
			printf("---");
			if (j < col - 1)
			{
				printf("|");
			}
		}
		printf("\n");
	}
}

 
void player(char arr[ROW][COL], int row, int col)
{
	int x = 0;
	int y = 0;
	while (1)
	{
		printf("请输入坐标->: ");
		scanf("%d %d", &x, &y);
		if (x >= 1 && x <= row && y >= 1 && y <= col)
		{
			if (' ' == arr[x - 1][y - 1])
			{
				arr[x - 1][y - 1] = '*';
				break;
			}
			else
			{
				printf("该坐标已被占用，请重新输入");
			}
		}
		else
		{
			printf("坐标非法，请重新输入");
		}
	}
}

void computer(char arr[ROW][COL], int row, int col)
{
	while (1)
	{
		int x = rand() % row;
		int y = rand() % col;
		if (' ' == arr[x][y])
		{
			arr[x][y] = '#';
			break;
		}
	}
}

	int i = 0;
	int j = 0;
	//行胜利
	for (i = 0; i < row; i++)
	{
		int count = 0;
		for (j = 0; j < col-1; j++)
		{
			if (arr[i][j] == arr[i][j + 1] && arr[i][j] != ' ')
			{
				count++;
				if (count == 2)
				{
					return arr[i][j];
				}
			}
			else
			{
				break;
			}
		}
	}

for (j = 0; j < col; j++)
	{
 
		int count = 0;
		for (i = 0; i < row - 1; i++)
		{
			if (arr[i][j] == arr[i+1][j] && arr[i][j] != ' ')
			{
				count++;
				if (count == row - 1)
				{
					return arr[i][j];
				}
			}
			else
			{
				break;
			}
		}
	}

	//对角
	//主对角
	int count = 0;
	for (i = 0; i < row-1; i++)
	{
			
			if (arr[i][i] == arr[i + 1][i + 1] && arr[i][i] != ' ')
			{
				count++;
				if (count == row - 1)
				{
					return arr[i][i];
				}
			}
			else
				break;
		
	}

//反对角
	for (i = 0; i < row; i++)
	{
		for (j = 1; j < col; j++)
		{
			int count = 0;
			if (arr[i][col - j] == arr[i + 1][col - j - 1]&& arr[i][col-j] != ' ')
			{
				count++;
				if (count == row - 1)
				{
					return arr[i][i];
				}
			}
			else
				break;
		}
	}

int is_full(char arr[ROW][COL], int row, int col)
{
	int i = 0;
	int j = 0;
	int count = 0;
	for (i = 0; i < row; i++)
	{
		for (j = 0; j < col; j++)
		{
			if (' ' == arr[i][j])
				return 0;
			else
				count++;
			if (count == row * col)
				return 1;
		}
	}
}
 
 
if (1 == is_full(arr, row, col))
	{
		return 'Q';
	}