C语言五子棋AI版,c语言五子棋(字符版+AI)

c语言五子棋带AI

#include

#include

#include

#include

#include

char qipan[16][16];//设置棋盘变量

int loopa1,loopa2,loopput1,loopput2;

//棋子&电脑变量

char qizi='#';

int cps=0,cpx=0,cpy=0,cpfx=0,playx=0,playy=0;

//更新棋盘

int putqipan()

{

clrscr();//清除屏幕函数

printf("输入1~9或a~f的字符组成一个坐标来放置棋子,两坐标值以空格隔开,如2 6,表示在横坐标为2,纵坐标为6的位置放置一个棋子\n以5颗棋子相连为胜利条件!\n");

//把棋盘各点显示在屏幕上

for (loopput1=0;loopput1<16;loopput1++)

{

for (loopput2=0;loopput2<32;loopput2++)

{

if (loopput2%2==0) printf("%c",qipan[loopput1][loopput2/2]);

else printf(" ");//控制棋盘长度

}

printf("\n");

}

printf("输入坐标>>>>>");

}

//ai下棋指令

bool chessdown()//指定方向下棋

{

int icpx,icpy;

icpx=cpx;

icpy=cpy;

switch (cpfx)

{

case 0:icpx++;break;

case 1:icpx--;break;

case 2:icpy++;break;

case 3:icpy--;break;

case 4:icpx++,icpy++;break;

case 5:icpx++,icpy--;break;

case 6:icpx--,icpy++;break;

case 7:icpx--,icpy--;break;

}

if (qipan[icpx][icpy]!='*'&&qipan[icpx][icpy]!='#'&&(icpx>0&&icpx<=15)&&(icpy>0&&icpy<=15))

{

cpx=icpx;

cpy=icpy;

qipan[cpx][cpy]=qizi;

return true;

}

else return false;

}

bool antidown()//反方向下棋

{

int icpx,icpy;

icpx=cpx;

icpy=cpy;

while (1)

{

switch (cpfx)

{

case 0:icpx--;break;

case 1:icpx++;break;

case 2:icpy--;break;

case 3:icpy++;break;

case 4:icpx--,icpy--;break;

case 5:icpx--,icpy++;break;

case 6:icpx++,icpy--;break;

case 7:icpx++,icpy++;break;

}

if (qipan[icpx][icpy]==qizi);

else if (qipan[icpx][icpy]!='*'&&qipan[icpx][icpy]!='#'&&(icpx>0&&icpx<=15)&&(icpy>0&&icpy<=15))

{

cpx=icpx;

cpy=icpy;

qipan[cpx][cpy]=qizi;

return true;

break;

}

else

{

cps=0;

return false;

break;

}

}

}

bool defence()//阻止对方胜利

{

int qh1,qh2,qs1,qs2,qp1,qp2,qn1,qn2,qi;

qh1=qh2=qs1=qs2=qp1=qp2=qn1=qn2=0;

char qz;

bool stop=false;

if (qizi=='#') qz='*';

else qz='#';

//两侧封杀

for (qi=1;qipan[playx][playy-qi]==qz;qi++)

qh1++;

for (qi=1;qipan[playx][playy+qi]==qz;qi++)

qh2++;

//横向档棋

if (qh1+qh2+1>=3)

{

if (qipan[playx][playy-qh1-1]!='*'&&qipan[playx][playy-qh1-1]!='#'&&(playx>0&&playx<=15)&&(playy-qh1-1>0&&playy-qh1-1<=15))

{

qipan[playx][playy-qh1-1]=qizi;

stop=true;

return true;

}

else if (qipan[playx][playy+qh2+1]!='*'&&qipan[playx][playy+qh2+1]!='#'&&(playx>0&&playx<=15)&&(playy+qh2+1>0&&playy+qh2+1<=15))

{

qipan[playx][playy+qh2+1]=qizi;

stop=true;

return true;

}

}

if (stop==false )

{

for (qi=1;qipan[playx-qi][playy]==qz;qi++)

qs1++;

for (qi=1;qipan[playx+qi][playy]==qz;qi++)

qs2++;

if (qs1+qs2+1>=3)//竖向挡棋

{

if (qipan[playx-qs1-1][playy]!='*

'&&qipan[playx-qs1-1][playy]!='#'&&(playx-qs1-1>0&&playx-qs1-1<=15)&&(playy>0&&play

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
下面是一个简单的 C 语言五子棋 AI 算法代码示例,使用了极大极小值算法和 alpha-beta 剪枝优化: ```c #include <stdio.h> #include <stdbool.h> #define BOARD_SIZE 15 // 棋盘 int board[BOARD_SIZE][BOARD_SIZE]; // 棋子颜色 #define EMPTY 0 #define BLACK 1 #define WHITE 2 // 赢法数组 int wins[BOARD_SIZE][BOARD_SIZE][572]; int win_count = 0; // 落子得分数组 int score[BOARD_SIZE][BOARD_SIZE]; // 初始化赢法数组 void init_wins() { // 横向赢法 for (int i = 0; i < BOARD_SIZE; i++) { for (int j = 0; j < BOARD_SIZE - 4; j++) { for (int k = 0; k < 5; k++) { wins[i][j + k][win_count] = 1; } win_count++; } } // 竖向赢法 for (int i = 0; i < BOARD_SIZE; i++) { for (int j = 0; j < BOARD_SIZE - 4; j++) { for (int k = 0; k < 5; k++) { wins[j + k][i][win_count] = 1; } win_count++; } } // 斜向赢法 for (int i = 0; i < BOARD_SIZE - 4; i++) { for (int j = 0; j < BOARD_SIZE - 4; j++) { for (int k = 0; k < 5; k++) { wins[i + k][j + k][win_count] = 1; } win_count++; } } // 反斜向赢法 for (int i = 0; i < BOARD_SIZE - 4; i++) { for (int j = BOARD_SIZE - 1; j >= 4; j--) { for (int k = 0; k < 5; k++) { wins[i + k][j - k][win_count] = 1; } win_count++; } } } // 初始化落子得分数组 void init_score() { for (int i = 0; i < BOARD_SIZE; i++) { for (int j = 0; j < BOARD_SIZE; j++) { score[i][j] = 0; } } } // 计算某个位置的落子得分 int calculate_score(int x, int y, int color) { int score = 0; for (int i = 0; i < win_count; i++) { if (wins[x][y][i]) { if (board[x][y] == color) { score += 10; } else if (board[x][y] == EMPTY) { if (wins[x][y][i] == 1) { score += 1; } else if (wins[x][y][i] == 2) { score += 5; } else if (wins[x][y][i] == 3) { score += 100; } else if (wins[x][y][i] == 4) { score += 1000; } } } } return score; } // 计算所有位置的落子得分 void calculate_all_score(int color) { for (int i = 0; i < BOARD_SIZE; i++) { for (int j = 0; j < BOARD_SIZE; j++) { if (board[i][j] == EMPTY) { score[i][j] = calculate_score(i, j, color); } } } } // 判断是否胜利 bool is_win(int x, int y, int color) { for (int i = 0; i < win_count; i++) { if (wins[x][y][i]) { bool win = true; for (int j = 0; j < 5; j++) { if (board[x][y] != color) { win = false; break; } } if (win) { return true; } } } return false; } // 极大极小值算法 int alpha_beta(int depth, int alpha, int beta, int color) { if (depth == 0) { return 0; } calculate_all_score(color); // 极大值节点 if (color == BLACK) { int max_score = -1000000; for (int i = 0; i < BOARD_SIZE; i++) { for (int j = 0; j < BOARD_SIZE; j++) { if (board[i][j] == EMPTY) { if (is_win(i, j, BLACK)) { return 1000000; } int s = score[i][j]; if (s > 0) { board[i][j] = BLACK; int v = alpha_beta(depth - 1, alpha, beta, WHITE); board[i][j] = EMPTY; if (v > max_score) { max_score = v; } if (v > alpha) { alpha = v; } if (alpha >= beta) { return max_score; } } } } } return max_score; } // 极小值节点 else { int min_score = 1000000; for (int i = 0; i < BOARD_SIZE; i++) { for (int j = 0; j < BOARD_SIZE; j++) { if (board[i][j] == EMPTY) { if (is_win(i, j, WHITE)) { return -1000000; } int s = score[i][j]; if (s > 0) { board[i][j] = WHITE; int v = alpha_beta(depth - 1, alpha, beta, BLACK); board[i][j] = EMPTY; if (v < min_score) { min_score = v; } if (v < beta) { beta = v; } if (beta <= alpha) { return min_score; } } } } } return min_score; } } // AI 下棋 void ai_move(int *x, int *y) { int max_score = -1000000; for (int i = 0; i < BOARD_SIZE; i++) { for (int j = 0; j < BOARD_SIZE; j++) { if (board[i][j] == EMPTY) { int s = score[i][j]; if (s > 0) { board[i][j] = BLACK; int v = alpha_beta(5, -1000000, 1000000, WHITE); board[i][j] = EMPTY; if (v > max_score) { max_score = v; *x = i; *y = j; } } } } } } int main() { // 初始化棋盘 for (int i = 0; i < BOARD_SIZE; i++) { for (int j = 0; j < BOARD_SIZE; j++) { board[i][j] = EMPTY; } } // 初始化赢法数组 init_wins(); // 主循环 while (true) { // AI 下棋 int x, y; ai_move(&x, &y); board[x][y] = BLACK; printf("AI: (%d, %d)\n", x, y); // 打印棋盘 for (int i = 0; i < BOARD_SIZE; i++) { for (int j = 0; j < BOARD_SIZE; j++) { printf("%c ", board[i][j] == EMPTY ? '+' : (board[i][j] == BLACK ? 'X' : 'O')); } printf("\n"); } // 判断胜负 if (is_win(x, y, BLACK)) { printf("AI win!\n"); break; } // 玩家下棋 printf("Enter your move (e.g. 7 7): "); int px, py; scanf("%d %d", &px, &py); board[px][py] = WHITE; // 判断胜负 if (is_win(px, py, WHITE)) { printf("You win!\n"); break; } } return 0; } ``` 注意,这是一个非常简单的示例代码,实际应用中可能需要更复杂和更高效的算法。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值