算法-五子棋禁手

超维智能编程

369人浏览 · 2025-01-09 00:34:06

超维智能编程 · 2025-01-09 00:34:06 发布




//三三禁手 
bool checkThreeThree(int row, int col, int player)
{
    
    int directions[4][2] = { {0,1},{1,0},{1,1},{1,-1} };//水平+垂直+对角线
    int size = 8;
    int num = 0;;//初始数量为0
    for (int i = 0; i < 4; i++) {
        int dx = directions[i][0]; //
        int dy = directions[i][1];//
        int beginRow = row - (size - 1) * dx;
        int beginCol = col - (size - 1) * dy;
        for (int j = 0; j <= (size - 1); j++) {
            int begin = j;
            int end = j + (size - 1);
            int bRow = beginRow + j * dx;
            int bCol = beginCol + j * dy;
            int blankNum = 0;
            int currentNum = 0;
            int other = 0;
            int flag = 1;
            for (int k = begin; k <= end; k++) {
                int forR = bRow + (k - begin) * dx;
                int forC = bCol + (k - begin) * dy;
                if (ifRange(forR, forC)) {  //判断再范围之内
                    if (k >= begin + 2 && k <= end - 2) {
                        if (board[forR][forC] == player) {//中间四个必须四个本方
                            currentNum++;
                        }
                        if (board[forR][forC] == 0) {//中间四个必须四个本方
                            blankNum++;
                        }
                    }

                    if (k == begin + 1 || k == end - 1) {
                        int data = board[forR][forC];
                        if (data != 0) {//第二个倒数第二个必须没有棋子
                            flag = 0;
                            break;
                        }
                    }

                    if (k == begin|| k == end) {
                        int data = board[forR][forC];
                        if (data == player) {//第二个倒数第二个必须没有棋子
                            flag=0;
                            break;
                        }
                    }


                }

            }
            if (flag == 1 && blankNum == 1 && currentNum == 3) {
                num++;
            }
           

        }
    }


    if (num >= 2)
        return true;

    return false;
}


//四四禁手 
bool checkFourFour(int row, int col, int player)
{
    int directions[4][2] = { {0,1},{1,0},{1,1},{1,-1} };//水平+垂直+对角线
    int size = 8;
    int num = 0;;//初始数量为0
    for (int i = 0; i < 4; i++) {
        int dx = directions[i][0]; //
        int dy = directions[i][1];//
        int beginRow = row - (size - 1) * dx;
        int beginCol = col - (size - 1) * dy;


        for (int j = 0; j <= (size - 1); j++) {
            int begin = j;
            int end = j + (size - 1);
            int bRow = beginRow + j * dx;
            int bCol = beginCol + j * dy;
            int blankNum = 0;
            int currentNum = 0;
            int other = 0;
            int flag = 1;
            for (int k = begin; k <= end; k++) {
                int forR = bRow + (k - begin) * dx;
                int forC = bCol + (k - begin) * dy;

                    if (ifRange(forR, forC)) {  //判断再范围之内
                        if (k >= begin + 2 && k <= end - 2) {
                            if (board[forR][forC] == player) {//中间四个必须四个本方
                                currentNum++;
                            }
                        }
                        if (k == begin + 1 || k == end - 1) {
                            int data= board[forR][forC];
                            if (data== 0) {//第二个倒数第二个必须没有棋子
                                blankNum++;
                            }
                        }
                    }


                    if (k == begin || k == end) {
                        if (ifRange(forR, forC)) {
                            if (board[forR][forC] != player) {
                                other++;
                            }
                        }
                        else {
                            if (k == -1) {
                                other++;
                            }

                            if (k == end + 1) {
                                other++;
                            }
                        }
                    }
                }

                if (flag && blankNum == 2 && currentNum == 4 && other >= 1) {
                    num++;
                }

            }
        }
      
    
    if (num >= 2)
        return true;

    return false;
}

//长连 
bool checkLong(int row, int col, int dx, int dy, int player)
{
    int count = 1;
    for (int i = 1; i <= 5; i++)
    {
        int r = row + i * dx;
        int c = col + i * dy;
        if (r >= 0 && r < SIZE && c >= 0 && c < SIZE && board[r][c] == player)
        {
            count++;
        }
        else
        {
            break;
        }
    }
    for (int i = 1; i <= 5; i++)
    {
        int r = row - i * dx;
        int c = col - i * dy;
        if (r >= 0 && r < SIZE && c >= 0 && c < SIZE && board[r][c] == player)
        {
            count++;
        }
        else
        {
            break;
        }
    }
    return count >= 6;
}

//长连禁手 
bool checkLongLink(int row, int col, int player)
{
    int directions[4][2] = { {0,1},{1,0},{1,1},{1,-1} };
    for (int i = 0; i < 4; i++)
    {
        if (checkLong(row, col, directions[i][0], directions[i][1], player))
        {
            return true;
        }
    }
    return false;
}


//三三禁手 
bool checkThreeThree(int row, int col, int player)
{
    
    int directions[4][2] = { {0,1},{1,0},{1,1},{1,-1} };//水平+垂直+对角线
    int size = 8;
    int num = 0;;//初始数量为0
    for (int i = 0; i < 4; i++) {
        int dx = directions[i][0]; //
        int dy = directions[i][1];//
        int beginRow = row - (size - 1) * dx;
        int beginCol = col - (size - 1) * dy;
        for (int j = 0; j <= (size - 1); j++) {
            int begin = j;
            int end = j + (size - 1);
            int bRow = beginRow + j * dx;
            int bCol = beginCol + j * dy;
            int blankNum = 0;
            int currentNum = 0;
            int other = 0;
            int flag = 1;
            for (int k = begin; k <= end; k++) {
                int forR = bRow + (k - begin) * dx;
                int forC = bCol + (k - begin) * dy;
                if (ifRange(forR, forC)) {  //判断再范围之内
                    if (k >= begin + 2 && k <= end - 2) {
                        if (board[forR][forC] == player) {//中间四个必须四个本方
                            currentNum++;
                        }
                        if (board[forR][forC] == 0) {//中间四个必须四个本方
                            blankNum++;
                        }
                    }

                    if (k == begin + 1 || k == end - 1) {
                        int data = board[forR][forC];
                        if (data != 0) {//第二个倒数第二个必须没有棋子
                            flag = 0;
                            break;
                        }
                    }

                    if (k == begin|| k == end) {
                        int data = board[forR][forC];
                        if (data == player) {//第二个倒数第二个必须没有棋子
                            flag=0;
                            break;
                        }
                    }


                }

            }
            if (flag == 1 && blankNum == 1 && currentNum == 3) {
                num++;
            }
           

        }
    }


    if (num >= 2)
        return true;

    return false;
}


//四四禁手 
bool checkFourFour(int row, int col, int player)
{
    int directions[4][2] = { {0,1},{1,0},{1,1},{1,-1} };//水平+垂直+对角线
    int size = 8;
    int num = 0;;//初始数量为0
    for (int i = 0; i < 4; i++) {
        int dx = directions[i][0]; //
        int dy = directions[i][1];//
        int beginRow = row - (size - 1) * dx;
        int beginCol = col - (size - 1) * dy;


        for (int j = 0; j <= (size - 1); j++) {
            int begin = j;
            int end = j + (size - 1);
            int bRow = beginRow + j * dx;
            int bCol = beginCol + j * dy;
            int blankNum = 0;
            int currentNum = 0;
            int other = 0;
            int flag = 1;
            for (int k = begin; k <= end; k++) {
                int forR = bRow + (k - begin) * dx;
                int forC = bCol + (k - begin) * dy;

                    if (ifRange(forR, forC)) {  //判断再范围之内
                        if (k >= begin + 2 && k <= end - 2) {
                            if (board[forR][forC] == player) {//中间四个必须四个本方
                                currentNum++;
                            }
                        }
                        if (k == begin + 1 || k == end - 1) {
                            int data= board[forR][forC];
                            if (data== 0) {//第二个倒数第二个必须没有棋子
                                blankNum++;
                            }
                        }
                    }


                    if (k == begin || k == end) {
                        if (ifRange(forR, forC)) {
                            if (board[forR][forC] != player) {
                                other++;
                            }
                        }
                        else {
                            if (k == -1) {
                                other++;
                            }

                            if (k == end + 1) {
                                other++;
                            }
                        }
                    }
                }

                if (flag && blankNum == 2 && currentNum == 4 && other >= 1) {
                    num++;
                }

            }
        }
      
    
    if (num >= 2)
        return true;

    return false;
}

//长连 
bool checkLong(int row, int col, int dx, int dy, int player)
{
    int count = 1;
    for (int i = 1; i <= 5; i++)
    {
        int r = row + i * dx;
        int c = col + i * dy;
        if (r >= 0 && r < SIZE && c >= 0 && c < SIZE && board[r][c] == player)
        {
            count++;
        }
        else
        {
            break;
        }
    }
    for (int i = 1; i <= 5; i++)
    {
        int r = row - i * dx;
        int c = col - i * dy;
        if (r >= 0 && r < SIZE && c >= 0 && c < SIZE && board[r][c] == player)
        {
            count++;
        }
        else
        {
            break;
        }
    }
    return count >= 6;
}

//长连禁手 
bool checkLongLink(int row, int col, int player)
{
    int directions[4][2] = { {0,1},{1,0},{1,1},{1,-1} };
    for (int i = 0; i < 4; i++)
    {
        if (checkLong(row, col, directions[i][0], directions[i][1], player))
        {
            return true;
        }
    }
    return false;
}

乐奇 Rokid 开放社区

更多推荐

KOReader 安装教程：电子墨水屏上重排 PDF，免费电子书阅读器

在电子墨水屏上读 PDF，要么放大拖拽，要么只能看原版的小字。KOReader 是一款面向电子墨水屏的开源、免费电子书阅读器，支持 PDF、EPUB、DjVu、FB2 等十几种格式，还能把固定版式的 PDF 重排成适合小屏的排版。## 📌 这类人值得装- **啃 PDF 论文的人**：学术论文、技术文档、扫描版书籍重排之后，文字按屏幕宽度排，不用再在放大和翻页之间来回切。- **多设备

乐奇 Rokid 开放社区

Hyperswitch config_importer 实战：将 TOML 配置文件一键转换为 Kubernetes 环境变量

本文以 Hyperswitch 仓库中的 `config_importer` 工具 crate 为核心，完整讲解它如何把 Hyperswitch 的 TOML 配置文件（如 `config/development.toml`、`config/deployments/drainer.toml`）转换为环境变量的键值对，并导出为 Kubernetes 可用的 JSON 数组格式。读完本文，你将掌握该工

乐奇 Rokid 开放社区

AI眼镜微型件连接激光焊和胶接怎么选

所谓智能眼镜微型件连接工艺选型，是指在镜腿铰链、中梁、摄像头模组、FPC 与 PCB 互连、腔体密封、塑料壳体这些尺度在亚毫米到数毫米之间的连接界面上，按热预算、接头强度、气密要求与疲劳寿命四项约束，在激光熔焊、激光锡焊、回流焊、电阻焊、结构胶接与超声波焊之间做出取舍的工艺决策方法（来源：精密焊接在智能眼镜制造中的应用行业资料）。