C语言实现三维五子棋（双人对战版）_立体五子棋代码-程序员宅基地

技术标签： C/C++ 二维数组三维 c语言三维五子棋的胜负判断五子棋

问题难点

棋盘如何显示？
胜负如何判断？

程序特点

运用结构体数组的知识，结构体内保存字符型二维数组。
结构体数组表示了棋盘厚度，字符型二维数组表示当前棋盘状态。
胜负评判系统分为当前平面棋盘检查与竖直方向检查。

程序不足

没有禁手限制，存在不公平
仅是双人对战版本，没有AI系统

C语言代码

#include<stdio.h>
#include<Windows.h>
#include<time.h>
#include<stdlib.h>
#include<string.h>
#include<conio.h> 
#define MAXIMUS 5 //定义棋盘大小(5*5个方框)
#define chess_number 30//定义棋盘高度
int count = 0, move_x = 0, move_y = 0, x = 0, y = 0, chess_num = chess_number / 2, chess_num_0;
struct MyStruct_0
{
    char ChessBoard[MAXIMUS][MAXIMUS];
}MyStruct_0[chess_number];

这里的棋盘高度是指：竖直方向棋盘个数
move_x：为棋子横坐标。x：为光标横坐标
实际初始状态为第15个棋盘，但用户显示为chess_num第零个棋盘，这样能够避免判断胜负不方便判断的情况

/*棋盘初始化*/
void Initialize()
{
    for (int i = 0; i < MAXIMUS; i++)
    {
        for (int j = 0; j < MAXIMUS; j++)
        {
            MyStruct_0[chess_num].ChessBoard[i][j] = ' ';
        }
    }
    MyStruct_0[chess_num].ChessBoard[x][y] = '+';
}

该函数目的：将棋盘棋子的地方用’ ‘代替。
显示初始光标位置

/*画棋盘*/
void DrawBoard()
{
    printf("\n当前棋盘位置(w,s调整)：%d\n", chess_num_0);
    printf("当前棋盘棋子情况：\n");
    printf("o:\n");
    for (int i = 0; i < MAXIMUS; i++)
    {
        for (int j = 0; j < MAXIMUS; j++)
        {
            if (MyStruct_0[chess_num].ChessBoard[i][j] == 'o')
                printf("(%d,%d) ", i, j);
        }
    }
    printf("\n*:\n");
    for (int i = 0; i < MAXIMUS; i++)
    {
        for (int j = 0; j < MAXIMUS; j++)
        {
            if (MyStruct_0[chess_num].ChessBoard[i][j] == '*')
                printf("(%d,%d) ", i, j);
        }
    }
    printf("\n---------------------------------------------\n\n");
    printf("┏");
    for (int i = 0; i < MAXIMUS - 1; i++)
        printf("─┳");
    printf("─┓\n");

    for (int i = 0; i< MAXIMUS - 1; i++)
    {
        for (int j = 0; j < MAXIMUS; j++)
        {
            printf("│%c ", MyStruct_0[chess_num].ChessBoard[i][j]);
        }
        printf("│\n");
        printf("┣");

        for (int i = 0; i < MAXIMUS - 1; i++)
        {
            printf("─╋"); 
        }
        printf("─┫\n");
    }

    for (int i = 0; i < MAXIMUS; i++)
    {
        printf("│%c ", MyStruct_0[chess_num].ChessBoard[MAXIMUS - 1][i]);
    }

    printf("│\n");
    printf("┗");
    for (int i = 0; i < MAXIMUS - 1; i++)
        printf("─┻");
    printf("─┛\n");
}

/*判断胜负*/
int Win_Or_Not()
{
    /*水平判断*/
    int W_ = 0, B_ = 0, i;
    for (i = 1; i < 5; i++){ if (move_x - i >= 0 && MyStruct_0[chess_num].ChessBoard[move_x - i][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else break; }
    for (i = 1; i < 5; i++){ if (move_x + i<MAXIMUS&&MyStruct_0[chess_num].ChessBoard[move_x + i][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else break; }
    if (W_ >= 4)
        return 1;
    for (i = 1; i < 5; i++){ if (move_x - i >= 0 && MyStruct_0[chess_num].ChessBoard[move_x - i][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else break; }
    for (i = 1; i < 5; i++){ if (move_x + i<MAXIMUS&&MyStruct_0[chess_num].ChessBoard[move_x + i][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else break; }
    if (B_ >= 4)
        return 2;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else { break; } }
    if (B_ == 4)
        return 2;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x + i][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x - i][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x + i][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x - i][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else { break; } }
    if (B_ == 4)
        return 2;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x + i][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x - i][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o')W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x + i][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num].ChessBoard[move_x - i][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*')B_++; else { break; } }
    if (B_ == 4)
        return 2;


    /*立体判断*/

    /*0号方向*/
    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else {
   break;} }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;

    /*1号方向*/
    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;

    /*2号方向*/
    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x - i][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x + i][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x - i][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x + i][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;

    /*3号方向*/
    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x - i][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x + i][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x - i][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x + i][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;

    /*4号方向*/
    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x - i][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x + i][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x - i][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x + i][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;

    /*5号方向*/
    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;

    /*6号方向*/
    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x + i][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x - i][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x + i][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x - i][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;

    /*7号方向*/
    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x + i][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x - i][move_y] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x + i][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x - i][move_y] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;

    /*8号方向*/
    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x + i][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x - i][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x + i][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x - i][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;

    int sum = 0;
    for (int i = 0; i < MAXIMUS; i++)
    {
        for (int j = 0; j < MAXIMUS; j++)
        {
            if (MyStruct_0[chess_num].ChessBoard[i][j] == 'o' || MyStruct_0[chess_num].ChessBoard[i][j] == '*')
                sum += 1;
        }
    }
    if (sum == MAXIMUS*MAXIMUS)
        return 3;

    return 0;
}

这里是最重要的胜负判断函数。比较笨拙，能力有限。

这里以1号方向为例讲解。

/*1号方向*/
    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y - i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y + i] == 'o'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == 'o') W_++; else { break; } }
    if (W_ == 4)
        return 1;

    W_ = 0, B_ = 0;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num + i].ChessBoard[move_x][move_y - i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;
    for (i = 1; i < 5; i++){ if (MyStruct_0[chess_num - i].ChessBoard[move_x][move_y + i] == '*'&&MyStruct_0[chess_num].ChessBoard[move_x][move_y] == '*') B_++; else { break; } }
    if (B_ == 4)
        return 2;

W_ = 0, B_ = 0。记录双方当前连子数目。达到五个子后返回不同的数值来判断胜方。
MyStruct_0[chess_num + i].ChessBoard[move_x][move_y - i]表示当前第chess_num个棋盘的状态
每下一个子分为两部分。己方与对方。同时，将一条直线上的棋子数判断分为一半一半来判断。
一共九个方向。能想的来么？

void RunGame()
{
    int input;
    system("cls");
    DrawBoard();//打印棋盘
    input = getch();//等待键盘按下一个字符
    if (input == 27)//如果是ESC则退出程序
    {
        exit(0);
    }
    else if (char(input) == 'c')
    {
        MyStruct_0[chess_num].ChessBoard[x][y] = ' ', move_x = x, move_y = y;
    }
    else if (char(input) == 'w')
    {
        chess_num_0++;
        chess_num++;
    }
    else if (char(input) == 's')
    {
        chess_num_0--;
        chess_num--;
    }
    else if (input == 0x20)//如果是空格则开始走子
    {
        if (count % 2 == 0)
            MyStruct_0[chess_num].ChessBoard[x][y] = 'o', move_x = x, move_y = y;
        else
            MyStruct_0[chess_num].ChessBoard[x][y] = '*', move_x = x, move_y = y;

        count += 1;
    }
    else if (input == 0xE0)//如果按下的是方向键，会填充两次输入，第一次为0xE0表示按下的是控制键
    {
        if (MyStruct_0[chess_num].ChessBoard[x][y] != '*'&&MyStruct_0[chess_num].ChessBoard[x][y] != 'o')
            MyStruct_0[chess_num].ChessBoard[x][y] = ' ';
        input = getch();//获得第二次输入信息

        switch (input)//判断方向键方向并移动光标位置
        {
        case 0x4B:
            y--;
            break;
        case 0x48:
            x--;
            break;
        case 0x4D:
            y++;
            break;
        case 0x50:
            x++;
            break;
        }

        if (x<0)x = MAXIMUS - 1;//如果光标位置越界则移动到对侧
        if (y<0)y = MAXIMUS - 1;
        if (x >= MAXIMUS)x = 0;
        if (y >= MAXIMUS)y = 0;

        if (MyStruct_0[chess_num].ChessBoard[x][y] != '*'&&MyStruct_0[chess_num].ChessBoard[x][y] != 'o')
            MyStruct_0[chess_num].ChessBoard[x][y] = '+';
    }

    system("cls");
    DrawBoard();//打印棋盘
    printf("当前对局数：%d\n", count);
    printf("稍等...\n");
    Sleep(100);
}

这里是主要的操作函数。
input = getch();//等待键盘按下一个字符 if (input == 27)//如果是ESC则退出程序 { exit(0); }
这个代码实现了对于键盘输入的类型转换，inpu为int型
else if (char(input) == 'c') { MyStruct_0[chess_num].ChessBoard[x][y] = ' ', move_x = x, move_y = y; }
这里提供了悔一步棋的操作，很简单，就只是将棋子变成’ ‘即可。
else if (char(input) == 'w') { chess_num_0++; chess_num++; }
chess_num_0：界面显示当前棋盘数
chess_num：实际棋盘数组的数值大小
`else if (input == 0x20)//如果是空格则开始走子
{
if (count % 2 == 0)
MyStruct_0[chess_num].ChessBoard[x][y] = ‘o’, move_x = x, move_y = y;
else
MyStruct_0[chess_num].ChessBoard[x][y] = ‘*’, move_x = x, move_y = y;
```
count += 1;
```
}`
如果输入空格则会将当前的光标坐标（x，y）依照当前局数奇偶来觉得是’o’还是’*’
执行完赋值操作后，局数加一

`else if (input == 0xE0)//如果按下的是方向键，会填充两次输入，第一次为0xE0表示按下的是控制键
{
if (MyStruct_0[chess_num].ChessBoard[x][y] != ‘*’&&MyStruct_0[chess_num].ChessBoard[x][y] != ‘o’)
MyStruct_0[chess_num].ChessBoard[x][y] = ’ ‘;
input = getch();//获得第二次输入信息

switch (input)//判断方向键方向并移动光标位置
{
case 0x4B:
    y--;
    break;
case 0x48:
    x--;
    break;
case 0x4D:
    y++;
    break;
case 0x50:
    x++;
    break;
}

if (x<0)x = MAXIMUS - 1;//如果光标位置越界则移动到对侧
if (y<0)y = MAXIMUS - 1;
if (x >= MAXIMUS)x = 0;
if (y >= MAXIMUS)y = 0;

if (MyStruct_0[chess_num].ChessBoard[x][y] != '*'&&MyStruct_0[chess_num].ChessBoard[x][y] != 'o')
    MyStruct_0[chess_num].ChessBoard[x][y] = '+';

当是方向键的时候，需要将’+’光标赋值给当前棋盘，并且将原来的位置的字符赋值为’ ‘
没进行一次方向键操作，便需要对于x和y值进行变动
当然还有超越棋盘边界的情况

if (x<0)x = MAXIMUS - 1;//如果光标位置越界则移动到对侧
        if (y<0)y = MAXIMUS - 1;
        if (x >= MAXIMUS)x = 0;
        if (y >= MAXIMUS)y = 0;

这段代码便解决了这个问题

int main()
{
    system("title 五子棋(方框版) — J.m制作");//设置标题
    system("mode con cols=60 lines=40");//设置窗口大小
    system("color F0");//设置颜色
    Initialize();

    while (true)
    {
        if (Win_Or_Not() == 1)
        {
            system("cls");
            DrawBoard();
            printf("游戏结果： o Win\n");
            system("pause");
        }
        if (Win_Or_Not() == 2)
        {
            system("cls");
            DrawBoard();
            printf("游戏结果: * Win\n");
            system("pause");
        }
        if (Win_Or_Not() == 3)
        {
            system("cls");
            DrawBoard();
            printf("游戏结果: 平局\n");
            system("pause");
        }
        RunGame();
    }

    return 0;
}

这里是主函数，需要注意的是这个程序永远不会退出，即使胜负已定。因为考虑到需要玩家查看当前棋盘状态，所以便没有设置结束。

本文链接：https://blog.csdn.net/weixin_39541632/article/details/77781882

原作者删帖不实内容删帖广告或垃圾文章投诉

智能推荐

计算机丢失concrt140,小编教你解决concrt140 dll 【解决教程】的技巧_-程序员宅基地

文章浏览阅读4.5w次。近日有小伙伴发现电脑出现问题了，在突然遇到concrt140 dll时不知所措了，对于concrt140 dll带来的问题，其实很好解决concrt140 dll带来的问题，下面小编跟大家介绍concrt140 dll解决方法：丢失CONCRT140.dll，怎么办？答：分析及解决：网上下载这个DLL文件，将其放置到system32目录下面。重启系统，或者在CMD下面运行regsvr32*.dl..._concrt140.dll下载教程

微信小程序源码案例大全_微信小程序switch页面demo-程序员宅基地

文章浏览阅读4.3k次，点赞4次，收藏62次。微信小程序demo：足球，赛事分析小程序简易导航小程序demo：办公审批小程序Demo：电魔方小程序demo：借阅伴侣微信小程序demo：投票微信小程序demo：健康生活小程序demo：文章列表demo 微商城（含微信小程序）完整源码+配置指南微信小程序Demo：一个简单的工作系统微信小程序Demo：用于聚会的小程序微信小程序Demo：Growth 是一款..._微信小程序switch页面demo

SLAM学习笔记(Code2)----刚体运动、Eigen库_eigen.determinant-程序员宅基地

文章浏览阅读2.2k次。2.1除了#include<iostream>之外的头文件#include <Eigen/Core>//Core:核心#include <Eigen/Dense>//求矩阵的逆、特征值、行列式等#include <Eigen/Geometry>//Eigen的几何模块，可以利用矩阵完成如旋转、平移/***其他***/#include <ctime>//可用于计时，比较哪个程序更快#include <cmath>//包含a_eigen.determinant

图像梯度-sobel算子-程序员宅基地

文章浏览阅读1w次，点赞12次，收藏61次。（1）理论部分x 水平方向的梯度，其实也就是右边 - 左边，有的权重为1，有的为2 。若是计算出来的值很大说明是一个边界。y 竖直方向的梯度，其实也就是下面减上面，权重1，或2 。若是计算出来的值很大说明是一个边界。图像的梯度为：有时简化为：即：（2）程序部分函数：Sobelddepth 通常取 -1，但是会导致结果溢出，检测不出边缘，故使..._sobel算子

cuda10.1和cudnn7.6.5百度网盘下载链接（Linux版）_cudnn7.6网盘下载-程序员宅基地

文章浏览阅读3.6k次，点赞17次，收藏8次。cuda10.1和cudnn7.6.5百度网盘下载链接（Linux版）在官网下载不仅慢，，，主要是还总失败。。终于下载成功了，这里给出百度网盘下载链接，希望可以帮到别人百度网盘下载链接提取码: vyg5_cudnn7.6网盘下载

Python正则表达式大全-程序员宅基地

文章浏览阅读9.3w次，点赞69次，收藏427次。定义：正则表达式是对字符串（包括普通字符（例如，a 到 z 之间的字母）和特殊字符（称为“元字符”））操作的一种逻辑公式，就是用事先定义好的一些特定字符、及这些特定字符的组合，组成一个“规则字符串”，这个“规则字符串”用来表达对字符串的一种过滤逻辑。正则表达式是一种文本模式，该模式描述在搜索文本时要匹配的一个或多个字符串。上面都是官方的说明，我自己的理解是（仅供参考）：通过事先规定好一些特殊字符的匹配规则，然后利用这些字符进行组合来匹配各种复杂的字符串场景。比如现在的爬虫和数据分析，字符串校验等等都需要用_python正则表达式

随便推点

NILM（非侵入式电力负荷监测）学习笔记 —— 准备工作（一）配置环境NILMTK Toolkit_nilmtk学习-程序员宅基地

文章浏览阅读1.9w次，点赞27次，收藏122次。安装Anaconda，Python，pycharm我另一篇文章里面有介绍https://blog.csdn.net/wwb1990/article/details/103883775安装NILMTK有了上面的环境，接下来进入正题。NILMTK官网：http://nilmtk.github.io/因为官方安装流程是基于linux的（官方安装流程），我这里提供windows..._nilmtk学习

k8s-pod 控制器-程序员宅基地

文章浏览阅读826次，点赞20次，收藏28次。如果实际 Pod 数量比指定的多那就结束掉多余的，如果实际数量比指定的少就新启动一些Pod，当 Pod 失败、被删除或者挂掉后，RC 都会去自动创建新的 Pod 来保证副本数量，所以即使只有一个 Pod，我们也应该使用 RC 来管理我们的 Pod。label 与 selector 配合，可以实现对象的“关联”，“Pod 控制器” 与 Pod 是相关联的 —— “Pod 控制器”依赖于 Pod，可以给 Pod 设置 label，然后给“控制器”设置对应的 selector，这就实现了对象的关联。