井字棋(人機對戰版)

游戲介紹

井字棋，英文名叫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("\n\n平局\n");

    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("\n");
    }
}

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("人獲勝！\n");
            return true;
        }
        if (sum == 15)
        {
            printf("電腦獲勝！\n");
            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("人獲勝！\n");
            return true;
        }
        if (sum == 15)
        {
            printf("電腦獲勝！\n");
            return true;
        }
        sum = 0;
    }

    for (int i = 0; i < ROW; i++)     //對對角線判斷是否獲勝
        sum += chessboard[i][i];
    if (sum == 6)
    {
        printf("人獲勝！\n");
        return true;
    }
    if (sum == 15)
    {
        printf("電腦獲勝！\n");
        return true;
    }

    sum = 0;
    for (int i = 0; i < ROW; i++)     //對反對角線判斷是否獲勝
        sum += chessboard[i][2 - i];
    if (sum == 6)
    {
        printf("人獲勝！\n");
        return true;
    }
    if (sum == 15)
    {
        printf("電腦獲勝！\n");
        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("\n請正確輸入！\n");
        printf("x,y均屬於1~3\n\n");

        printf("請輸入棋子的橫坐標X:");
        scanf_s("%d", &x);
        printf("請輸入棋子的縱坐標Y:");
        scanf_s("%d", &y);
    }

    while (chessboard[3 - y][x - 1] != 1)
    {
        printf("\n\n該位置已被占用！\n");
        printf("請選擇正確的位置\n\n");
        Sleep(1000);

        printf("\n請輸入棋子的橫坐標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;
}