井字棋(人机对战版)

游戏介绍

井字棋，英文名叫Tic-Tac-Toe，是一种在3*3格子上进行的连珠游戏，和五子棋类似。然后由分别代表O和X的两个游戏者轮流在格子里留下标记（一般来说先手者为X），任意三个标记形成一条直线（包括行、列、对角线、反对角线），则为获胜。

解决策略

重点在于电脑方如何下棋，我们采取估计棋局每个位置的权重，首先要对棋局进行分类。

---3个为空，重要性最低，权值设置为1　　　　//视为暂时不管

---2个空1个对方，重要性次低，权值为10　　　　//一下三个区别不大，可比较随意的设置

----1个空格1个对方1个己方，重要行较低，权值50　

----2个空格1个己方，重要性较高，权值为100

---1个空格2个对方，重要性次高，权值500　　//不堵住会输

---1个空格2个己方，重要性最高，权值1000    //可以直接赢

注意几点：

1、权值之间的间距可以设大一点

2、对每个空位置，权值等于行权值+列权值+对角线权值+反对角线权值，这4中权值都可以用上面的估算，但不做改进会出bug

考虑如下情况：

(1,3)-->(3,1)-->(1,1)-->(2,1)电脑就输了

---->--->-->-->人获胜

关键在于第二步，应该选择一个非角的位置，原因在于此时右上角位置的权值大于中上位置，分析权值的来源

右上角时，10+10+100(对角线己方），而中上时，10+100(行己方)，所以同样是2空1己方时，己方位于行或列的权重应大于己方位于对角线。

所以按行或列计算时，2空1己方的权值可改为200

代码实现

#include<stdio.h>
#include<Windows.h>

const int ROW = 3;
const int COL = 3;
int chessboard[ROW][COL];
int score[ROW][COL];

void Initmap();
void Showmap();        //打印棋局
bool isWin();        //判断是否有一方获胜
bool isFull();        //判断棋盘是否为满
void PcPlay();        //电脑下棋
void HumanPlay();    //人下棋

int main()
{
    Initmap();
    Showmap();
    while ((!isFull()) && (!isWin()))
    {
        HumanPlay();
        system("cls");
        Showmap();
        if (isWin())
            break;

        Sleep(500);    //模拟实际过程，让电脑慢点，hh
        PcPlay();
        system("cls");
        Showmap();
    }

    if (isFull())
        printf("

平局
");

    system("pause");
    return 0;
}

void Initmap()
{
    for (int i = 0; i < ROW; i++)
        for (int j = 0; j < COL; j++)
            chessboard[i][j] = 1;
}

void Showmap()
{
    for (int i = 0; i < ROW; i++)
    {
        for (int j = 0; j < COL; j++)
        {
            if (chessboard[i][j] == 1)    //"1"代表空
                printf("□");
            if (chessboard[i][j] == 2)    //"2"代表人
                printf("■");
            if (chessboard[i][j] == 5)    //"5"代表电脑
                printf("●");
        }
        printf("
");
    }
}

bool isWin()
{
    int sum = 0;
    for (int i = 0; i < ROW; i++)      //对每行判断是否获胜
    {
        for (int j = 0; j < COL; j++)
            sum += chessboard[i][j];

        if (sum == 6)
        {
            printf("人获胜！
");
            return true;
        }
        if (sum == 15)
        {
            printf("电脑获胜！
");
            return true;
        }
        sum = 0;
    }

    for (int j = 0; j < ROW; j++)      //对每列判断是否获胜
    {
        for (int i = 0; i < COL; i++)
            sum += chessboard[i][j];

        if (sum == 6)
        {
            printf("人获胜！
");
            return true;
        }
        if (sum == 15)
        {
            printf("电脑获胜！
");
            return true;
        }
        sum = 0;
    }

    for (int i = 0; i < ROW; i++)     //对对角线判断是否获胜
        sum += chessboard[i][i];
    if (sum == 6)
    {
        printf("人获胜！
");
        return true;
    }
    if (sum == 15)
    {
        printf("电脑获胜！
");
        return true;
    }

    sum = 0;
    for (int i = 0; i < ROW; i++)     //对反对角线判断是否获胜
        sum += chessboard[i][2 - i];
    if (sum == 6)
    {
        printf("人获胜！
");
        return true;
    }
    if (sum == 15)
    {
        printf("电脑获胜！
");
        return true;
    }

    return false;
}

bool isFull()
{
    for (int i = 0; i < ROW; i++)
        for (int j = 0; j < COL; j++)
            if (chessboard[i][j] == 1)
                return false;
    return true;
}

void HumanPlay()
{
    int x, y;
    printf("请输入棋子的横坐标X:");
    scanf_s("%d", &x);
    printf("请输入棋子的纵坐标Y:");
    scanf_s("%d", &y);

    while (x < 1 || x>3 || y < 1 || y>3)
    {
        printf("
请正确输入！
");
        printf("x,y均属于1~3

");

        printf("请输入棋子的横坐标X:");
        scanf_s("%d", &x);
        printf("请输入棋子的纵坐标Y:");
        scanf_s("%d", &y);
    }

    while (chessboard[3 - y][x - 1] != 1)
    {
        printf("

该位置已被占用！
");
        printf("请选择正确的位置

");
        Sleep(1000);

        printf("
请输入棋子的横坐标X:");
        scanf_s("%d", &x);
        printf("请输入棋子的纵坐标Y:");
        scanf_s("%d", &y);
    }

    chessboard[3 - y][x - 1] = 2;
}

void PcPlay()
{
    int sum = 0;
    for (int i = 0; i < ROW; i++)
        for (int j = 0; j < COL; j++)
            score[i][j] = 0;

    // 对每行进行分数统计
    for (int i = 0; i < ROW; i++)
    {
        for (int j = 0; j < COL; j++)
            sum += chessboard[i][j];

        switch (sum)
        {
        case 3:                     //1+1+1;重要性：最低;权重：1
            for (int k = 0; k < COL; k++)
            {
                if (chessboard[i][k] == 1)
                    score[i][k] += 1;
            }
            break;
        case 4:                     //1+1+2;重要性：次低;权重：10
            for (int k = 0; k < COL; k++)
            {
                if (chessboard[i][k] == 1)
                    score[i][k] += 10;
            }
            break;
        case 8:                    //1+2+5;重要性：较低，权值50
            for (int k = 0; k < COL; k++)
            {
                if (chessboard[i][k] == 1)
                    score[i][k] += 50;
            }
            break;
        case 7:                     //1+1+5;重要性：较高;权重：200
            for (int k = 0; k < COL; k++)
            {
                if (chessboard[i][k] == 1)
                    score[i][k] += 200;     //把行列的重要性比对角线高
            }
            break;
        case 5:                     //1+2+2;重要性：次高;权重：500
            for (int k = 0; k < COL; k++)
            {
                if (chessboard[i][k] == 1)
                    score[i][k] += 500;
            }
            break;
        case 11:                     //1+5+5;重要性：最高;权重：1000
            for (int k = 0; k < COL; k++)
            {
                if (chessboard[i][k] == 1)
                    score[i][k] += 1000;
            }
            break;
        }
        sum = 0;
    }

    // 对每列进行分数统计
    for (int j = 0; j < COL; j++)
    {
        for (int i = 0; i < ROW; i++)
            sum += chessboard[i][j];

        switch (sum)
        {
        case 3:                   
            for (int k = 0; k < COL; k++)
            {
                if (chessboard[k][j] == 1)
                    score[k][j] += 1;
            }
            break;
        case 4:                    
            for (int k = 0; k < COL; k++)
            {
                if (chessboard[k][j] == 1)
                    score[k][j] += 10;
            }
            break;
        case 8:                    
            for (int k = 0; k <
                COL; k++)
            {
                if (chessboard[k][j] == 1)
                    score[k][j] += 50;
            }
            break;
        case 7:                    
            for (int k = 0; k < COL; k++)
            {
                if (chessboard[k][j] == 1)     //1+1+5;重要性：较高;权重：200
                    score[k][j] += 200;  
            }
            break;
        case 5:                    
            for (int k = 0; k < COL; k++)
            {
                if (chessboard[k][j] == 1)
                    score[k][j] += 500;
            }
            break;
        case 11:                  
            for (int k = 0; k < COL; k++)
            {
                if (chessboard[k][j] == 1)
                    score[k][j] += 1000;
            }
            break;
        }
        sum = 0;
    }

    // 对对角线进行分数统计
    for (int i = 0; i < ROW; i++)
        sum += chessboard[i][i];
    switch (sum)
    {
    case 3:                    
        for (int i = 0; i < COL; i++)
        {
            if (chessboard[i][i] == 1)
                score[i][i] += 1;
        }
        break;
    case 4:                   
        for (int i = 0; i < COL; i++)
        {
            if (chessboard[i][i] == 1)
                score[i][i] += 10;
        }
        break;
    case 8:                
        for (int i = 0; i < COL; i++)
        {
            if (chessboard[i][i] == 1)
                score[i][i] += 50;
        }
        break;
    case 7:                     //1+1+5;权重：100
        for (int i = 0; i < COL; i++)
        {
            if (chessboard[i][i] == 1)
                score[i][i] += 100;
        }
        break;
    case 5:                
        for (int i = 0; i < COL; i++)
        {
            if (chessboard[i][i] == 1)
                score[i][i] += 500;
        }
        break;
    case 11:                    
        for (int i = 0; i < COL; i++)
        {
            if (chessboard[i][i] == 1)
                score[i][i] += 1000;
        }
        break;
    }

    // 对反对角线进行分数统计
    sum = 0;
    for (int i = 0; i < ROW; i++)
        sum += chessboard[i][2 - i];
    switch (sum)
    {
    case 3:                    
        for (int i = 0; i < COL; i++)
        {
            if (chessboard[i][2 - i] == 1)
                score[i][2 - i] += 1;
        }
        break;
    case 4:                    
        for (int i = 0; i < COL; i++)
        {
            if (chessboard[i][2 - i] == 1)
                score[i][2 - i] += 10;
        }
        break;
    case 8:
        for (int i = 0; i < COL; i++)
        {
            if (chessboard[i][2 - i] == 1)
                score[i][2 - i] += 50;
        }
        break;
    case 7:                     
        for (int i = 0; i < COL; i++)
        {
            if (chessboard[i][2 - i] == 1)    //1+1+5;权重：100
                score[i][2 - i] += 100;
        }
        break;
    case 5:                   
        for (int i = 0; i < COL; i++)
        {
            if (chessboard[i][2 - i] == 1)
                score[i][2 - i] += 500;
        }
        break;
    case 11:                    
        for (int i = 0; i < COL; i++)
        {
            if (chessboard[i][2 - i] == 1)
                score[i][2 - i] += 1000;
        }
        break;
    }

    int maxRow = 0, maxCol = 0;
    for (int i = 0; i < ROW; i++)
        for (int j = 0; j < COL; j++)
        {
            if (score[i][j] > score[maxRow][maxCol])
            {
                maxRow = i;
                maxCol = j;
            }
        }
    chessboard[maxRow][maxCol] = 5;
}