当前位置：网站首页>【C语言】AI三子棋的成长之路
【C语言】AI三子棋的成长之路
2022-07-29 14:00:00 【ecember】
技术宅，拯救世界！
作者：@ecember
专栏：《从0开始——C语言》
对读者的话：相信奇迹的人本身和奇迹一样伟大
| 感谢大家的点赞 和关注 ，如果有需要可以看我主页专栏哟 |
1. 前言
生命中最快乐的事情是拼搏，而非成功，生命中最痛苦的是懒散，而非失败。大家好，这里是ecember。今天ecember来带大家写一写简单的三子棋小游戏，并一步步优化我们的憨憨AI。（以下结果均在VS2022中编译）。
2. 主体游戏实现
2.1 最终AI效果展现
平局
电脑赢
那么玩家有没有可能赢呢？肯定有可能。那么这个AI还需要改进的地方就交给友友们了。相信上述和电脑对弈的的过程我都是尽量想构成两路开花，但是这个AI十分聪明，每次都堵了关键的一步，让人十分之头疼。这难道是巧合吗？这就是这个AI的厉害之处。
2.2 主体函数
1.头文件包含
#include <stdio.h>
#include <time.h>
#include <string.h>
#include <stdlib.h>
#include <Windows.h>
2.全局变量
//game.h文件下
#define ROW 3
#define COL 3
//game.c文件下
int count = 0;
int p3 = 0, p4 = 0;
3.使用的函数及其功能
//初始化棋盘
void InitBoard(char board[ROW][COL], int row, int col);
//打印棋盘
void DisplayBoard(char board[ROW][COL], int row, int col);
//玩家下棋
void player1_move(char board[ROW][COL], int row, int col);
void player2_move(char board[ROW][COL], int row, int col);
//电脑下棋
void computer_move(char board[ROW][COL], int row, int col);//随机下棋
//判断输赢
char is_win(char board[ROW][COL], int row, int col);
//菜单
void menu();
//AI对弈
void game1();
//玩家对弈
void game2();
//选择模式
void test();
2.3 各函数源码
gest.h
#pragma once
#include <stdio.h>
#include <time.h>
#include <string.h>
#include <stdlib.h>
#include <Windows.h>
#define ROW 3
#define COL 3
//初始化棋盘
void InitBoard(char board[ROW][COL], int row, int col);
//打印棋盘
void DisplayBoard(char board[ROW][COL], int row, int col);
//玩家下棋
void player1_move(char board[ROW][COL], int row, int col);
void player2_move(char board[ROW][COL], int row, int col);
//电脑下棋
void computer_move(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
#include "game.h"
int count = 0;
int p3 = 0, p4 = 0;
void InitBoard(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 DisplayBoard(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)
{
for (j = 0; j < col; j++)
{
printf("---");
if (j < col - 1)
{
printf("|");
}
}
printf("\n");
}
}
}
void player1_move(char board[ROW][COL], int row, int col)
{
int x = 0;
int y = 0;
printf("玩家1下棋\n");
while (1)
{
printf("请输入坐标：>");
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("坐标非法, 请重新输入！");
}
}
}
void player2_move(char board[ROW][COL], int row, int col)
{
int x = 0;
int y = 0;
printf("玩家2下棋\n");
while (1)
{
printf("请输入坐标：>");
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("坐标非法, 请重新输入！");
}
}
}
void computer_move(char board[ROW][COL], int row, int col)
{
int x = 0;
int y = 0;
printf("你的对手正在思考中：\n");
Sleep(2000);
while (0 == k)
{
x = rand() % row;//0 - 2
y = rand() % col;//0 - 2
if (board[x][y] == ' ')
{
board[x][y] = '#';
break;
}
}
}
static int is_full(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++)
{
if (board[i][j] == ' ')
{
return 0;
}
}
}
return 1;//满了
}
char is_win(char board[ROW][COL], int row, int col)
{
int i = 0;
for (i = 0; i < row; i++)
{
if (board[i][0] == board[i][1] && board[i][1] == board[i][2] && board[i][1] != ' ')
{
count = 0;
return board[i][1];
}
}
//判断列
for (i = 0; i < col; i++)
{
if (board[0][i] == board[1][i] && board[1][i] == board[2][i] && board[1][i] != ' ')
{
count = 0;
return board[1][i];
}
}
//对角线
if (board[0][0] == board[1][1] && board[1][1] == board[2][2] && board[1][1] != ' ')
{
count = 0;
return board[1][1];
}
if (board[0][2] == board[1][1] && board[1][1] == board[2][0] && board[1][1] != ' ')
{
count = 0;
return board[1][1];
}
//判断平局
if (is_full(board, row, col) == 1)
{
count = 0;
return 'Q';
}
//游戏继续
return 'C';
}
test.c
#define _CRT_SECURE_NO_WARNINGS
//测试三子棋游戏的逻辑
#include "game.h"
void menu()
{
printf("*******************\n");
printf("******1.Man machine combat ********\n");
printf("******2.Play with Man *************\n");
printf("******3.Exit the game *************\n");
printf("\n");
printf("----1p : '*'----\n");
printf("----2p ：'#'----\n");
printf("----cp ：'#'----\n");
printf("\n");
}
void game1()
{
char ret = 0;
//存放下期的数据
char board[ROW][COL] = {
0 };
//初始化棋盘为全空格
InitBoard(board, ROW, COL);
//打印棋盘
DisplayBoard(board, ROW, COL);
while (1)
{
//玩家下棋
player1_move(board, ROW, COL);
DisplayBoard(board, ROW, COL);
//判断输赢
ret = is_win(board, ROW, COL);
if (ret != 'C')
{
break;
}
//电脑下棋
computer_move(board, ROW, COL);
DisplayBoard(board, ROW, COL);
ret = is_win(board, ROW, COL);
if (ret != 'C')
{
break;
}
}
Sleep(1000);
system("cls");
DisplayBoard(board, ROW, COL);
if (ret == '*')
{
printf("恭喜你，击败了电脑\n");
}
else if (ret == '#')
{
printf("很可惜，你输了，再练习练习吧\n");
}
else
{
printf("平局，可以再开一局战胜电脑哦\n");
}
printf("\n");
}
void game2()
{
char ret = 0;
//存放下期的数据
char board[ROW][COL] = {
0 };
//初始化棋盘为全空格
InitBoard(board, ROW, COL);
//打印棋盘
DisplayBoard(board, ROW, COL);
while (1)
{
//p1下棋
player1_move(board, ROW, COL);
DisplayBoard(board, ROW, COL);
//判断输赢
ret = is_win(board, ROW, COL);
if (ret != 'C')
{
break;
}
//p2下棋
player2_move(board, ROW, COL);
DisplayBoard(board, ROW, COL);
ret = is_win(board, ROW, COL);
if (ret != 'C')
{
break;
}
}
Sleep(1000);
system("cls");
DisplayBoard(board, ROW, COL);
if (ret == '*')
{
printf("p1胜利\n");
}
else if (ret == '#')
{
printf("p2胜利\n");
}
else
{
printf("平局\n");
}
printf("\n");
}
//什么情况游戏结束
//玩家赢 = '*
//电脑赢 = '#
//平局 = 'q';
//继续 = 'c';
void test()
{
int input = 0;
srand((unsigned int)time(NULL));
do
{
menu();
printf("请选择:>");
scanf("%d", &input);
switch (input)
{
case 1:
game1();
break;
case 2:
game2();
break;
case 3:
printf("退出游戏\n");
break;
default:
printf("输入错误\n");
break;
}
} while (input != 3);
}
int main()
{
test();
return 0;
}
但这里我们的双人对弈模式虽然没什么问题，但跟电脑对弈的时候，发现这个电脑就跟憨憨一样。下面我们来对其进行优化。
3. 憨憨AI的封神之路
3.1 判赢优化
//电脑优化1
int judge_cop(char board[ROW][COL], int row, int col);
这里我们为电脑增加了判赢功能，即可以判断自己在哪里构成了两个子，并在此步骤下在第三个子处。
int judge_cop(char board[ROW][COL], int row, int col)
{
int i = 0;
int k = 0;
while (0 == k)
{
//电脑在行上能赢
for (i = 0; i < row; i++)
{
if (board[i][0] == '#' && board[i][1] == '#' && board[i][2] == ' ')
{
board[i][2] = '#';
k = 1;
break;
}
if (board[i][0] == '#' && board[i][2] == '#' && board[i][1] == ' ')
{
board[i][1] = '#';
k = 1;
break;
}
if (board[i][1] == '#' && board[i][2] == '#' && board[i][0] == ' ')
{
board[i][0] = '#';
k = 1;
break;
}
}
if (1 == k)
{
break;
}
//电脑在列上能赢
for (i = 0; i < col; i++)
{
if (board[0][i] == '#' && board[1][i] == '#' && board[2][i] == ' ')
{
board[2][i] = '#';
k = 1;
break;
}
if (board[0][i] == '#' && board[2][i] == '#' && board[1][i] == ' ')
{
board[1][i] = '#';
k = 1;
break;
}
if (board[1][i] == '#' && board[2][i] == '#' && board[0][i] == ' ')
{
board[0][i] = '#';
k = 1;
break;
}
}
if (1 == k)
{
break;
}
//电脑在对角线上能赢
if (board[0][0] == '#' && board[1][1] == '#' && board[2][2] == ' ')
{
board[2][2] = '#';
k = 1;
break;
}
if (board[0][0] == '#' && board[2][2] == '#' && board[1][1] == ' ')
{
board[1][1] = '#';
k = 1;
break;
}
if (board[1][1] == '#' && board[2][2] == '#' && board[0][0] == ' ')
{
board[0][0] = '#';
k = 1;
break;
}
if (board[0][2] == '#' && board[1][1] == '#' && board[2][0] == ' ')
{
board[2][0] = '#';
k = 1;
break;
}
if (board[0][2] == '#' && board[2][0] == '#' && board[1][1] == ' ')
{
board[1][1] = '#';
k = 1;
break;
}
if (board[1][1] == '#' && board[2][0] == '#' && board[0][2] == ' ')
{
board[0][2] = '#';
k = 1;
break;
}
break;
}
return k;
}
3.2 堵塞优化
//电脑优化2
int judge_player(char board[ROW][COL], int row, int col);
这里功能可以判断玩家是否下一步能赢，如果能赢，则进行堵塞。
int judge_player(char board[ROW][COL], int row, int col)
{
int i = 0;
int k = 0;
while (0 == k)
{
//玩家在行上能赢
for (i = 0; i < row; i++)
{
if (board[i][0] == '*' && board[i][1] == '*' && board[i][2] == ' ')
{
board[i][2] = '#';
k = 1;
break;
}
if (board[i][0] == '*' && board[i][2] == '*' && board[i][1] == ' ')
{
board[i][1] = '#';
k = 1;
break;
}
if (board[i][1] == '*' && board[i][2] == '*' && board[i][0] == ' ')
{
board[i][0] = '#';
k = 1;
break;
}
}
if (1 == k)
{
break;
}
//玩家在列上能赢
for (i = 0; i < col; i++)
{
if (board[0][i] == '*' && board[1][i] == '*' && board[2][i] == ' ')
{
board[2][i] = '#';
k = 1;
break;
}
if (board[0][i] == '*' && board[2][i] == '*' && board[1][i] == ' ')
{
board[1][i] = '#';
k = 1;
break;
}
if (board[1][i] == '*' && board[2][i] == '*' && board[0][i] == ' ')
{
board[0][i] = '#';
k = 1;
break;
}
}
if (1 == k)
{
break;
}
//玩家在对角线上能赢
if (board[0][0] == '*' && board[1][1] == '*' && board[2][2] == ' ')
{
board[2][2] = '#';
k = 1;
break;
}
if (board[0][0] == '*' && board[2][2] == '*' && board[1][1] == ' ')
{
board[1][1] = '#';
k = 1;
break;
}
if (board[1][1] == '*' && board[2][2] == '*' && board[0][0] == ' ')
{
board[0][0] = '#';
k = 1;
break;
}
if (board[0][2] == '*' && board[1][1] == '*' && board[2][0] == ' ')
{
board[2][0] = '#';
k = 1;
break;
}
if (board[0][2] == '*' && board[2][0] == '*' && board[1][1] == ' ')
{
board[1][1] = '#';
k = 1;
break;
}
if (board[1][1] == '*' && board[2][0] == '*' && board[0][2] == ' ')
{
board[0][2] = '#';
k = 1;
break;
}
break;
}
return k;
}
3.3 特况优化
这里针对部分在第一步或者第二步玩家可能出现两路开花的情况进行了优化。
//电脑优化3
int cop_pro1(char board[ROW][COL], int row, int col);
//电脑优化4
int cop_pro2(char board[ROW][COL], int row, int col);
int cop_pro1(char board[ROW][COL], int row, int col)
{
int x = 0;
int y = 0;
int k = 0;
if (board[1][1] == '*')
{
while (1)
{
x = rand() % row;//0 - 2
y = rand() % col;//0 - 2
if (board[x][y] == ' ')
{
if ((x == 0 && y == 2) || (x == 2 && y == 0) || (x == 0 && y == 0) || (x == 2 && y == 2))
{
board[x][y] = '#';
k = 1;
break;
}
}
}
}
else if(board[0][0] == '*' || board[2][2] == '*' || board[0][2] == '*' || board[2][0] == '*')
{
board[1][1] = '#';
k = 1;
}
else
{
while (1)
{
x = rand() % row;//0 - 2
y = rand() % col;//0 - 2
if (board[x][y] == ' ')
{
if (x == p3 || y == p4)
{
board[x][y] = '#';
k = 1;
break;
}
}
}
}
return k;
}
int cop_pro2(char board[ROW][COL], int row, int col)
{
int x = 0;
int y = 0;
int k = 0;
if (board[0][0] == '*' && board[2][2] == '*' && board[1][1] == '#')
{
while (1)
{
x = rand() % row;//0 - 2
y = rand() % col;//0 - 2
if (board[x][y] == ' ')
{
if ((x == 0 && y == 2) || (x == 2 && y == 0))
{
continue;
}
else
{
board[x][y] = '#';
k = 1;
break;
}
}
}
}
else if (board[0][2] == '*' && board[2][0] == '*' && board[1][1] == '#')
{
while (1)
{
x = rand() % row;//0 - 2
y = rand() % col;//0 - 2
if (board[x][y] == ' ')
{
if ((x == 0 && y == 0) || (x == 2 && y == 2))
{
continue;
}
else
{
board[x][y] = '#';
k = 1;
break;
}
}
}
}
else if (board[0][0] == '*' && board[1][1] == '*' && board[2][2] == '#')
{
while (1)
{
x = rand() % row;//0 - 2
y = rand() % col;//0 - 2
if (board[x][y] == ' ')
{
if ((x == 0 && y == 2) || (x == 2 && y == 0))
{
board[x][y] = '#';
k = 1;
break;
}
}
}
}
else if (board[2][2] == '*' && board[1][1] == '*' && board[0][0] == '#')
{
while (1)
{
x = rand() % row;//0 - 2
y = rand() % col;//0 - 2
if (board[x][y] == ' ')
{
if ((x == 0 && y == 2) || (x == 2 && y == 0))
{
board[x][y] = '#';
k = 1;
break;
}
}
}
}
else if (board[0][2] == '*' && board[1][1] == '*' && board[2][0] == '#')
{
while (1)
{
x = rand() % row;//0 - 2
y = rand() % col;//0 - 2
if (board[x][y] == ' ')
{
if (x == 0 && y == 0 || x == 2 && y == 2)
{
board[x][y] = '#';
k = 1;
break;
}
}
}
}
else if (board[2][0] == '*' && board[1][1] == '*' && board[0][2] == '#')
{
while (1)
{
x = rand() % row;//0 - 2
y = rand() % col;//0 - 2
if (board[x][y] == ' ')
{
if (x == 0 && y == 0 || x == 2 && y == 2)
{
board[x][y] = '#';
k = 1;
break;
}
}
}
}
else if (board[1][1] == ' ')
{
board[1][1] = '#';
k = 1;
}
return k;
}
好了，上述部分分别添加到对应的game.h和game.c文件中即可，变化后的computer_move函数如下：
void computer_move(char board[ROW][COL], int row, int col)
{
int x = 0;
int y = 0;
printf("你的对手正在思考中：\n");
Sleep(2000);
int k = judge_cop(board, row, col);
if (0 == k)
{
k = judge_player(board, row, col);
}
if (0 == k && 0 == count)
{
k = cop_pro1(board, row, col);
count++;
}
if (0 == k && 1 == count)
{
k = cop_pro2(board, row, col);
count++;
}
while (0 == k)
{
x = rand() % row;//0 - 2
y = rand() % col;//0 - 2
if (board[x][y] == ' ')
{
board[x][y] = '#';
break;
}
}
}
以上就是我们对AI的全部优化。
4. 结语
到这，我们的 《AI三子棋的成长之路》 已经接近尾声了，后续我还会持续更新C语言相关内容，学习永无止境，就会永远只会留给有准备的人。希望我的博客对大家有所帮助，如果喜欢的可以 点赞+收藏哦，也随时欢迎大家在评论区及时指出我的错误。
边栏推荐
- Work Efficiency - Fifteen minutes allows you to quickly learn Markdown syntax to proficient in typesetting practice notes
- 1192. 奖金
- 【JS面试题】面试官问我：遍历一个数组用 for 和 forEach 哪个更快？
- 力扣541. 反转字符串 II ----双指针解法
- Redis-NoSql
- C＃实现线程管理类
- 已解决SyntaxError: invalid character in identifier
- 工作效率-十五分钟让你快速学习Markdown语法到精通排版实践备忘
- 性能优化竟白屏，难道真是我的锅？
- 国产手机将用户变成它们的广告肉鸡，难怪消费者都买iPhone了
猜你喜欢
关于知识付费的一些思考
FPGA刷题——跨时钟域传输（FIFO+打拍+握手）
The core principles of electronic games
【FreeSwitch开发实践】自定义模块创建与使用
教育部等五部门联合推荐优质课外资源，腾讯产品青少年模式首发
全开放式耳机怎么样？不塞耳朵的蓝牙耳机推荐
何为擦除机制，泛型的上界？
Violence recursion to dynamic programming 02 (very clever game of CARDS)
深开鸿：万物智联的大江上，升起一轮开源鸿蒙月
R Error in ：missing values are not allowed in subscripted assignments of data frames
随机推荐
C＃线程操作UI控件
带你搞懂 Redis 中的两个策略
阿里巴巴 CTO 程立：开源是基础软件的源头！
搞直播啦，千视超高清4K NDI编解码器8月3日19:00准时开播
【论文阅读】异常检测的视频通过Self-Supervised和多任务学习
国内helm快速安装和添加常用charts仓库
中国互联网科技企业群狼围攻，谷歌终于遭受重挫导致利润大跌，它为推动鸿蒙的发展而后悔...
即时通讯移动端开发之网络连接优化
【Postman】下载与安装（新手图文教程）
根据msql表的结构自动生成gorm的struct
解决：Parameter 0 of method ribbonServerList in com.alibaba.cloud.nacos.ribbon.NacosRibbonClientConfigu
PAT 甲级 A1021 Deepest Root
rk3399驱动添加电池adc开机检测功能
The reason for Apple's official price reduction has been found, and it is also facing declining sales and even inventory problems
【10点公开课】：快手GPU/FPGA/ASIC异构平台的应用探索
深开鸿：万物智联的大江上，升起一轮开源鸿蒙月
How much do you know about futures contracts
马尔可夫跳变线性系统最优控制的研究现状与进展
1184. 欧拉回路
Alibaba CTO Cheng Li: open source is the source of basic software!