三子棋及五子棋的实现

可以修改ROW和COL的数量来实现n子棋,对于五子棋来讲,将棋盘和数组的行数列数都加大,然而五子棋只需要判断4次,所以分开设置,即可实现大棋盘五子棋

对于五子棋来讲,需要更大的棋盘

test.c

#define _CRT_SECURE_NO_WARNINGS 1


#include "game.h"
void menu()
{
	printf("***********  《三子棋》 ************\n");
	printf("***********   1.玩游戏  ************\n");
	printf("***********   0.退出游戏  **********\n");
	printf("************************************\n");
}

void game()
{
	char board[ROW][COL];
	init(board, ROW, COL);
	print_board(board, ROW, COL);
	char ret = 0;
	while (1)
	{
		
		player(board, ROW, COL);
		print_board(board, ROW, COL);
		ret = is_win(board, ROW, COL);
		if (ret != 'c')
		{
			break;
		}

		
		computer(board, ROW, COL);
		print_board(board, ROW, COL);
		ret = is_win(board, ROW, COL);
		if (ret != 'c')
		{
			break;
		}
	}
	if (ret == '#')
	{
		printf("电脑赢了\n");
	}
	 if (ret == '*')
	{
		printf("玩家赢了\n");
	}
	 if (ret == 'Q')
	{
		 printf("平局\n");
	}
	


}
int main()
{
	srand((unsigned int)time(NULL));
	int input = 0;
	do
	{
		menu();
		printf("请选择->");
		scanf("%d", &input);
		switch(input)
		{
			case 1:
				game();
				break;
			case 0:
				printf("游戏结束\n");
				break;
			default:
				printf("输入错误,重新输入\n");
				break;
		}
	} while (input);
	
	return 0;
}

game.h

#pragma once

#include <stdio.h>
#include <time.h>
#include <stdlib.h>
#define ROW 3
#define COL 3
#define win_number ROW-1  //三子棋 三连子判断2次 4连判断3次 5连判断4次 为ROW-1次


void init(char board[ROW][COL], int row, int col); //传入3行3列,用3行3列接收

void print_board(char board[ROW][COL], int row, int col);

void player(char board[ROW][COL], int row, int col);

void computer(char board[ROW][COL], int row, int col);

char is_win(char board[ROW][COL], int row, int col);

game.c

#define _CRT_SECURE_NO_WARNINGS 1

#include "game.h"
void init(char board[ROW][COL], int row, int col)  //初始化,数组全为空格
{
	int i = 0;
	for (i = 0; i < row; i++)
	{
		int j = 0;
		for (j = 0; j < col; j++)
		{
			board[i][j] = ' ';
		}
	}
}

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


void player(char board[ROW][COL], int row, int col)
{
	printf("玩家下棋,输入位置\n");
	while (1)
	{
		printf("请输入要下棋的坐标:>\n");
		int x = 0;
		int y = 0;
		
		scanf("%d %d", &x, &y);          
		if (x >= 1 && x <= row && y >= 1 && y <= col)
		{
			if (board[x - 1][y - 1] == ' ')
			{
				board[x - 1][y - 1] = '*';
				break;
			}
			else
			{
				printf("已经有子重新下:\n");
				
			}
		}
		else
		{
			printf("输入错误,重新下:\n");
			
		}
	}
	
}


void computer(char board[ROW][COL], int row, int col)
{//0-32767范围的随机数,取余3得到范围0-2的随机数,取余row得到范围0-row-1的随机数
	printf("电脑下棋\n");
	while (1)
	{
		int x = rand() % row;
		int y = rand() % col;
		if (board[x][y] == ' ')
		{
			board[x][y] = '#';
			break;
		}
		
	}
}

int is_full(char board[ROW][COL], int row, int col) //判断棋盘是否满了,满了返回1
{
	for (int i = 0; i < row; i++)
	{
		for (int j = 0; j < col; j++)
		{
			if (board[i][j] == ' ')
				return 0;
		}
	}
	return 1;
}

char is_win(char board[ROW][COL], int row, int col)
{
	//返回#电脑赢  *玩家赢  c继续下棋 Q平局(棋盘满了)
	
	for (int i = 0; i < row; i++)  //判断行是否三连子
	{
		int count = 0;
		for (int j = 0; j < col-1; j++)
		{
			
			if (board[i][j] == board[i][j + 1]&&board[i][j]!=' ')
				count++;
			if (count == win_number)
				return board[i][j];
			

		}
	}
	for (int j = 0; j < col; j++) //判断列是否三连子
	{
		int count = 0;
		for (int i = 0; i < row - 1; i++)
		{
			
			if (board[i][j] == board[i + 1][j] && board[i][j] != ' ')
				count++;
			if (count == win_number)
				return board[i][j];
		}
	}

	int count1 = 0;
	for (int i = 0; i < row-1; i++)  //判断↘对角线,坐标(0,0) (1,1)(2,2)
	{
		
	
			if (board[i][i] == board[i + 1][i + 1] && board[i][i] != ' ')
					count1++;
				if (count1 == win_number)
				{
					return board[i][i];
				}
		}
	


	

	int n = 0;
	int x = row - 1;
	int y = 0;
	int count2 = 0;
	while (n < row - 1)      //判断↙对角线(根据4子棋坐标判断规律)
	{
			
			if (board[x][y] == board[x - 1][y + 1] && board[x][y] != ' ')
				count2++;
			x = x - 1;
			y = y + 1;
			if (count2 == win_number)
			{
				return board[x][y];
			}
			n++;
		}
		
		
	if (is_full(board,row,col) == 1)
	{
		return 'Q';   //平局
	}
	//else
	
		return 'c';//游戏继续
	
	}
			
			

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值