高考报名时间2022年11月1日还剩 天 距离2023年6月7日高考还有 天
栏目分类:
子分类:
返回
名师互学网用户登录
名师互学网
快速导航关闭
当前搜索
当前分类
前沿技术 软件开发 系统运维 产品运营 生活办公 面试经验 考试题库
子分类
人工智能 大数据 云计算 区块链 物联网 深度学习 机器学习 NLP 计算机视觉 语音识别 其他 大数据系统 数据可视化 数据挖掘与分析 其他 Docker/k8s 虚拟化 云平台 其他 基本原理 数字货币 智能合约 EOS应用 其他 通讯技术 嵌入式开发 单片机 物联网应用 HarmonyOS 其他 后端开发 Web开发 移动开发 游戏开发 Python Java 架构设计 C/C++/C# PHP .Net Go语言 R语言
实用工具
学习工具 小学数学练习 字帖生成 在线画板 函数绘制 拼音字母表 在线词典 黄历查询 亲戚关系计算 安全期计算 中国历史 Excel函数 模拟请求 json格式化 浏览器指纹
热门搜索
路由器设置 木托盘 宝塔面板 儿童python教程 心情低落 朋友圈 vim 双一流学科 专升本 我的学校 日记学校 西点培训学校 汽修学校 情书 化妆学校 塔沟武校 异形模板 西南大学排名 最精辟人生短句 6步教你追回被骗的钱 南昌大学排名 清朝十二帝 北京印刷学院排名 北方工业大学排名 北京航空航天大学排名 首都经济贸易大学排名 中国传媒大学排名 首都师范大学排名 中国地质大学(北京)排名 北京信息科技大学排名
名师互学网 > IT > 软件开发 > 后端开发 > C/C++/C#

(C语言)2048游戏实现

C/C++/C# 更新时间： 发布时间： IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

(C语言)2048游戏实现

文章目录
  • 游戏介绍
  • 效果展示
  • 游戏代码
    • 游戏基础代码详解
      • 光标操作与界面操作
        • 光标位置定义
        • 隐藏光标
      • 代码可读性
      • 数据存放
      • 数据生成
      • 数据处理
        • 指针初始化
        • 数据处理代码
          • 行处理
          • 列处理
          • 向左或向右处理
          • 向上或向下处理
          • 检查是否有可以合并的数字
          • 数据查重
          • 数据合并
      • 游戏界面与数据打印
          • 边框打印（界面初始化）
          • 数据打印
          • 节点美化
      • 游戏结束条件
        • 游戏结束判断
        • 四个方向的判断
        • 行列查满
      • 游戏运行框架整合
      • main函数
  • 游戏完整代码

游戏介绍
  1. 按方向键上下左右，可以实现“2048”游戏数据的整合。
  2. 按R键重开游戏。
  3. 游戏拥有计分系统
效果展示

游戏代码

游戏源代码如下，可以直接在自己的编译器里运行。

 
游戏基础代码详解 
光标操作与界面操作 
光标位置定义 

static void _SetPos(int x, int y)
{
    COORD position;
    HANDLE handle;
    position.X = x;
    position.Y = y;
    handle = GetStdHandle(STD_OUTPUT_HANDLE);
    SetConsoleCursorPosition(handle, position);
}

 
隐藏光标 

static void HidePos()
{
    CONSOLE_CURSOR_INFO cursor_info = {1, FALSE};
    SetConsoleCursorInfo(GetStdHandle(STD_OUTPUT_HANDLE), &cursor_info);
}

 
代码可读性 

一些宏定义
 

//函数返还
#define FALSE 0
#define OK 1
//操作输入
#define UP 72
#define DOWN 80
#define LEFT 75
#define RIGHT 77
//游戏数据
#define SIZE 4
#define HIDE 0
#define TOWER 0

 

双指针
 

typedef struct Sentry//用于处理游戏数据
{
    Map_2048 *TravelSentry;
    Map_2048 *CheckSentry;
} SentryDouble; 

 
数据存放 

将游戏数据存放在二位数组中
 

// 2048游戏数据的存放
typedef int Map_2048;
Map_2048 Map[SIZE + 1][SIZE + 1];
//游戏地图初始化,Map[0][]与Map[][0],用于判断行列是否已满

 
数据生成 

在随机位置生成2或4（2的生成概率为90%，4的生成概率为10%）
 

static status GAME_DataCreate()
{
    int x, y;//地图坐标
    int Weight;//生成概率
    Weight = rand() % 10;//0~9
    srand(time(NULL));
    if (Map[TOWER][TOWER])
        return FALSE;
    while (1)
    {
        x = rand() % SIZE + 1;//1~4
        y = rand() % SIZE + 1;//1~4
        if (!Map[x][y])
            if (Weight)//非0则生成2
            {
                Map[x][y] = 2;
                break;
            }
            else
            {
                Map[x][y] = 4;
                break;
            }
    }
    return OK;
}

 
数据处理 

在按下方向键上下左右后处理游戏数据
 

 
 
指针初始化 

static status SentryInitialize(int Player_Input, SentryDouble *Sentry, int i)
{
    switch (Player_Input)
    {
    case UP:
        Sentry->TravelSentry = Sentry->CheckSentry = &Map[1][i];
        break;
    case LEFT:
        Sentry->TravelSentry = Sentry->CheckSentry = &Map[i][1];
        break;
    case DOWN:
        Sentry->TravelSentry = Sentry->CheckSentry = &Map[SIZE][SIZE - i + 1];
        break;
    case RIGHT:
        Sentry->TravelSentry = Sentry->CheckSentry = &Map[SIZE - i + 1][SIZE];
        break;
    default:
        break;
    }
    return OK;
}

 
数据处理代码 

static status GAME_DataDeal(int Player_Input)
{
    switch (Player_Input)
    {
    case UP:
    case DOWN:
        GAME_YDataDeal(Player_Input);
        break;
    case LEFT:
    case RIGHT:
        GAME_XDataDeal(Player_Input);
        break;
    default:
        break;
    }
    return OK;
}

 
行处理 

static status GAME_XDataDeal(int Player_Input)
{
    SentryDouble Sentry;
    for (int i = 1; i <= SIZE; i++)
        GAME_XPartDataDeal(Player_Input, &Sentry, i);
    return OK;
}

 
列处理 

static status GAME_YDataDeal(int Player_Input)
{
    SentryDouble Sentry;
    for (int i = 1; i <= SIZE; i++)
        GAME_YPartDataDeal(Player_Input, &Sentry, i);
    return OK;
}

 
向左或向右处理 

static status GAME_XPartDataDeal(int Player_Input, SentryDouble *Sentry, int i)
{
    SentryInitialize(Player_Input, Sentry, i); //指针初始化
    Map_2048 *ExSentry;//哨兵
    ExSentry = (Player_Input == LEFT ? (&Map[i][SIZE]) : (&Map[SIZE - i + 1][1])); //向左或向右处理
    int Sew = Player_Input == LEFT ? 1 : -1; //向左或向右处理                                
    while ((*Sentry->TravelSentry == 0) && (Sentry->TravelSentry != ExSentry)) //排除零
        Sentry->CheckSentry = Sentry->TravelSentry = Sentry->TravelSentry + Sew;
    while (Sentry->TravelSentry != ExSentry)
    {
        Sentry->CheckSentry = Sentry->TravelSentry;
        while (Sentry->CheckSentry != ExSentry)
            CheckSentryDeal(Player_Input, Sentry);//检查是否有可以合并的数字
        Sentry->TravelSentry = Sentry->TravelSentry + Sew;
    }
    return OK;
}

 
向上或向下处理 

static status GAME_YPartDataDeal(int Player_Input, SentryDouble *Sentry, int i)
{
    SentryInitialize(Player_Input, Sentry, i); //指针初始化
    Map_2048 *ExSentry;//哨兵
 
    ExSentry = (Player_Input == UP ? &Map[SIZE][i] : &Map[1][SIZE - i + 1]); //向上或向下处理
    int Sew = (Player_Input == UP ? (SIZE + 1) : -(SIZE + 1));               //向上或向下处理
 
    while ((*Sentry->TravelSentry == 0) && (Sentry->TravelSentry != ExSentry)) //排除零
        Sentry->CheckSentry = Sentry->TravelSentry = Sentry->TravelSentry + Sew;
    while (Sentry->TravelSentry != ExSentry)
    {
        Sentry->CheckSentry = Sentry->TravelSentry;
        while (Sentry->CheckSentry != ExSentry)
            CheckSentryDeal(Player_Input, Sentry);//检查是否有可以合并的数字，并处理
        Sentry->TravelSentry = Sentry->TravelSentry + Sew;
    }
    return OK;
}

 
检查是否有可以合并的数字 

 
 

static status CheckSentryDeal(int Player_Input, SentryDouble *Sentry)
{
 
    switch (Player_Input)
    {
    case UP:
        Sentry->CheckSentry = Sentry->CheckSentry + SIZE + 1;
        break;
    case DOWN:
        Sentry->CheckSentry = Sentry->CheckSentry - (SIZE + 1);
        break;
    case LEFT:
        Sentry->CheckSentry = Sentry->CheckSentry + 1;
        break;
    case RIGHT:
        Sentry->CheckSentry = Sentry->CheckSentry - 1;
        break;
    default:
        break;
    }
    if ((*Sentry->CheckSentry == *Sentry->TravelSentry) && (*Sentry->CheckSentry != 0))
        if (RangeSentryDeal(Player_Input, *Sentry) && *Sentry->TravelSentry != 2048)//查重且可以合并
        {
            DataMerge(Sentry);//合并
            return OK;
        }
    return FALSE;
}

 
数据查重 

找到两个相同的数据，并判断是否可以合并
 

static status RangeSentryDeal(int Player_Input, SentryDouble Sentry)
{
    int I;
    int Sew;
    Map_2048 *RangeSentry;
    switch (Player_Input)
    {
    case UP:
    case LEFT:
        Sew = Player_Input == UP ? (SIZE + 1) : 1;
        I = (Sentry.CheckSentry - Sentry.TravelSentry) / Sew;
        RangeSentry = Sentry.TravelSentry;
        while (I--)
        {
            RangeSentry = RangeSentry + Sew;
            if (*RangeSentry != 0 && *RangeSentry != *Sentry.TravelSentry)
                return FALSE;
        }
        break;
    case DOWN:
    case RIGHT:
        Sew = Player_Input == DOWN ? (SIZE + 1) : 1;
        I = (Sentry.TravelSentry - Sentry.CheckSentry) / Sew;
        RangeSentry = Sentry.CheckSentry;
        while (I--)
        {
            RangeSentry = RangeSentry + Sew;
            if (*RangeSentry != 0 && *RangeSentry != *Sentry.CheckSentry)
                return FALSE;
        }
        break;
    default:
        break;
    }
    return OK;
}

 
数据合并 

将两个数据合并
 

static status DataMerge(SentryDouble *Sentry)
{
    *Sentry->TravelSentry = (*Sentry->TravelSentry) * 2;
    *Sentry->CheckSentry = HIDE;
    return OK;
}

 
游戏界面与数据打印 
边框打印（界面初始化） 

打印游戏运行的边框
 

static status GAME_DataInitialize()
{
    for (int i = 0; i < 2; i++)
    {
        SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),51);
        _SetPos(0, i * 13);
        printf("■■■■■■■■■■■■■■");
        for (int j = 0; j < 14; j++)
        {
            _SetPos(i * 26, j);
            printf("■");
        }
    }
    return OK;
}

 
数据打印 

根据Map打印数据
 

static status GAME_DataShow()
{
    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), 7);
    for (int i = 0; i < 4; i++)
    {
        for (int j = 0; j < 4; j++)
        {
            switch (Map[j + 1][i + 1])
            {
            case 2:
                Node_Beautiy(i, j, 191);
                break;
            case 4:
                Node_Beautiy(i, j, 159);
                break;
            case 8:
                Node_Beautiy(i, j, 175);
                break;
            case 16:
                Node_Beautiy(i, j, 223);
                break;
            case 32:
                Node_Beautiy(i, j, 207);
                break;
            case 64:
                Node_Beautiy(i, j, 71);
                break;
            case 128:
                Node_Beautiy(i, j, 143);
                break;
            case 256:
                Node_Beautiy(i, j, 63);
                break;
            case 512:
                Node_Beautiy(i, j, 31);
                break;
            case 1024:
                Node_Beautiy(i, j, 79);
                break;
            case 2048:
                Node_Beautiy(i, j, 78);
                break;
            case 0:
                SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), 255);
                _SetPos(2 + 6 * i, 1 + 3 * j);
                printf("      ");
                _SetPos(2 + 6 * i, 2 + 3 * j);
                printf("      ");
                _SetPos(2 + 6 * i, 3 + 3 * j);
                printf("      ");
                break;
            default:
                break;
            }
        }
    }
    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), 15);
    return OK;
}

 
节点美化 

将数据美化
 

static status Node_Beautiy(int i, int j, int color)//在i，j坐标打印并根据 color 美化数据
{
    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), color);
    for (int w = 1; w <= 3; w++)
    {
        _SetPos(2 + 6 * i, w + 3 * j);
        w == 2 ? printf("%4d  ", Map[j + 1][i + 1]) : printf("      ");
    }
    return OK;
}

 
游戏结束条件 

 
 
游戏结束判断 

static status GAME_OverJudge()
{
    if (Map[TOWER][TOWER])
    {
        Map_2048 Over[SIZE + 1][SIZE + 1];
        Map_2048 DataSumTemp, DataSum;
        for (int i = 0; i <= SIZE; i++)
            for (int j = 0; j <= SIZE; j++)
            {
                DataSumTemp += Map[i][j];
                Over[i][j] = Map[i][j];
            }
        DataSumTemp -= 9;
        if (!GAME_OverPartJudge(UP, DataSumTemp, DataSum, Over))
            return 2;
        if (!GAME_OverPartJudge(DOWN, DataSumTemp, DataSum, Over))
            return 2;
        if (!GAME_OverPartJudge(LEFT, DataSumTemp, DataSum, Over))
            return 2;
        if (!GAME_OverPartJudge(RIGHT, DataSumTemp, DataSum, Over))
            return 2;
        return OK;
    }
    else
        return FALSE;
}

 
四个方向的判断 

static status GAME_OverPartJudge(int Player_Input, Map_2048 DataSumTemp, Map_2048 DataSum, Map_2048 Over[][SIZE + 1])
{
    DataSum = 0;
    GAME_DataDeal(Player_Input);
    GAME_DataCreate();
    for (int i = 1; i <= SIZE; i++)
        for (int j = 1; j <= SIZE; j++)
        {
            if (Over[i][j] != Map[i][j])
            {
                for (int w = 0; w <= SIZE; w++)
                    for (int r = 0; r <= SIZE; r++)
                    {
                        Map[w][r] = Over[w][r];
                    }
                return FALSE;
            }
        }
    return OK;
}

 
行列查满 

static status GAME_DataTowerDeal()
{
    int j, i;
    for (i = 1; i <= SIZE; i++)
    {
        for (j = 1; j <= SIZE; j++)
            if (!Map[i][j])
                break;
        if (j == SIZE + 1)
            Map[i][TOWER] = 1;
        else
            Map[i][TOWER] = 0;
    }
 
    for (i = 1; i <= SIZE; i++)
    {
        for (j = 1; j <= SIZE; j++)
            if (!Map[j][i])
                break;
        if (j == SIZE + 1)
            Map[TOWER][i] = 1;
        else
            Map[TOWER][i] = 0;
    }
    for (i = 1; i <= SIZE; i++)
        if (!Map[i][TOWER] || !Map[TOWER][i])
            break;
    Map[TOWER][TOWER] = (i == SIZE + 1 ? 1 : 0);
    return OK;
}

 
游戏运行框架整合 

static status GAME_PLAY()
{
    system("mode con cols=28 lines=17 ");//游戏窗口大小定义
    HidePos();
    GAME_DataInitialize();//界面初始化
    int Player_Input, count = 0;
    for (int i = 0; i <= SIZE; i++)//数据全零
        for (int j = 0; j <= SIZE; j++)
            Map[i][j] = 0;
    for (int i = 0; i < 3; i++) //初始化
        GAME_DataCreate();
    GAME_DataShow();//数据打印
    _SetPos(0, 14);
    printf("                                  ");
    _SetPos(0, 15);
    printf("                                  ");//数据显示
    while (1)
    {
        _SetPos(0, 14);
        SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), 15);
        printf("得分:%5d ", count);
        printf("重开:R");//得分显示
    InputAgain:
        Player_Input = _getch();
        if (Player_Input == 224)
            Player_Input = _getch();//识别玩家输入
        else if (Player_Input == (int)'R' || Player_Input == (int)'r')
            main();
        else
            goto InputAgain;
 
        GAME_DataDeal(Player_Input);//数据处理
        DataReorganize(Player_Input);//数据整理
        GAME_DataTowerDeal();//数据插满
        GAME_DataShow();//数据显示
 
        Sleep(100);//等待新数据生成
        GAME_DataCreate();//数据生成
        GAME_DataTowerDeal();//数据插满
        GAME_DataShow();//数据显示
 
        if (GAME_OverJudge() == 1)//游戏结束查询
            break;
        else if (!GAME_OverJudge())
            count++;
        HidePos();
    }
    _SetPos(0, 15);
    printf("游戏结束 ");

Again:
    printf("是否再来一次？(Y)/(N)");
    char Player_in;
    Player_in = getchar();
    if (Player_in == 'Y' || Player_in == 'y')
        main();
    else if (Player_in == 'N' || Player_in == 'n')
        return OK;
    else
        goto Again;
}

 
main函数 

int main()
{
    GAME_PLAY();
    return 0;
}

 
游戏完整代码 

游戏源代码如下，可以直接在自己的编译器里运行。
 

#include 
#include 
#include 
#include 
#include 
#include 
 
//函数返还
#define FALSE 0
#define OK 1
//操作输入
#define UP 72
#define DOWN 80
#define LEFT 75
#define RIGHT 77
//游戏数据
#define SIZE 4
#define HIDE 0
#define TOWER 0
 
typedef int status;
typedef int Map_2048;
typedef struct Sentry
{
    Map_2048 *TravelSentry;
    Map_2048 *CheckSentry;
} SentryDouble; //哨兵工具包
 
static void _SetPos(int x, int y); //移动光标到X、Y位置
static void HidePos();             //隐藏光标
 
static status GAME_PLAY();                                                                                             //游戏启动
static status GAME_DataShow();                                                                                         //打印游戏数据
static status GAME_DataInitialize();                                                                                   //图案初始化
static status GAME_DataCreate();                                                                                       //随机生成的2
static status GAME_DataDeal(int Player_Input);                                                                         //根据输入处理已有数据
static status GAME_XDataDeal(int Player_Input);                                                                        //行处理
static status GAME_YDataDeal(int Player_Input);                                                                        //列处理
static status GAME_XPartDataDeal(int Player_Input, SentryDouble *Sentry, int i);                                       //行部分处理
static status GAME_YPartDataDeal(int Player_Input, SentryDouble *Sentry, int i);                                       //列部分处理
static status SentryInitialize(int Player_Input, SentryDouble *Sentry, int i);                                         //根据Player_Input推进哨兵进入下一阶段
static status CheckSentryDeal(int Player_Input, SentryDouble *Sentry);                                                 // CheckSentry运行
static status DataMerge(SentryDouble *Sentry);                                                                         //数据合并
static status RangeSentryDeal(int Player_Input, SentryDouble Sentry);                                                  //通过RangeSentry查询CheckSentry——TravelSentry之间是否全零
static status DataReorganize(int Player_Input);                                                                        //数据整理
static status GAME_DataTowerDeal();                                                                                    //数据查满
static status GAME_OverJudge();                                                                                        //结束查询
static status GAME_OverPartJudge(int Player_Input, Map_2048 DataSumTemp, Map_2048 DataSum, Map_2048 Over[][SIZE + 1]); //四方向判断
static status Node_Beautiy(int i, int j, int color);                                                                   //节点美化
Map_2048 Map[SIZE + 1][SIZE + 1];                                                                          //游戏地图初始化,Map[0][]与Map[][0],用于判断行列是否已满
 
int main()
{
    GAME_PLAY();
    return 0;
}
 
static status GAME_DataInitialize()
{
    for (int i = 0; i < 2; i++)
    {
        SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),51);
        _SetPos(0, i * 13);
        printf("■■■■■■■■■■■■■■");
        for (int j = 0; j < 14; j++)
        {
            _SetPos(i * 26, j);
            printf("■");
        }
    }
    return OK;
}
 
static status GAME_OverPartJudge(int Player_Input, Map_2048 DataSumTemp, Map_2048 DataSum, Map_2048 Over[][SIZE + 1])
{
    DataSum = 0;
    GAME_DataDeal(Player_Input);
    GAME_DataCreate();
    for (int i = 1; i <= SIZE; i++)
        for (int j = 1; j <= SIZE; j++)
        {
            if (Over[i][j] != Map[i][j])
            {
                for (int w = 0; w <= SIZE; w++)
                    for (int r = 0; r <= SIZE; r++)
                    {
                        Map[w][r] = Over[w][r];
                    }
                return FALSE;
            }
        }
    return OK;
}
 
static status GAME_OverJudge()
{
    if (Map[TOWER][TOWER])
    {
        Map_2048 Over[SIZE + 1][SIZE + 1];
        Map_2048 DataSumTemp, DataSum;
        for (int i = 0; i <= SIZE; i++)
            for (int j = 0; j <= SIZE; j++)
            {
                DataSumTemp += Map[i][j];
                Over[i][j] = Map[i][j];
            }
        DataSumTemp -= 9;
        if (!GAME_OverPartJudge(UP, DataSumTemp, DataSum, Over))
            return 2;
        if (!GAME_OverPartJudge(DOWN, DataSumTemp, DataSum, Over))
            return 2;
        if (!GAME_OverPartJudge(LEFT, DataSumTemp, DataSum, Over))
            return 2;
        if (!GAME_OverPartJudge(RIGHT, DataSumTemp, DataSum, Over))
            return 2;
        return OK;
    }
    else
        return FALSE;
}
 
static void _SetPos(int x, int y)
{
    COORD position;
    HANDLE handle;
    position.X = x;
    position.Y = y;
    handle = GetStdHandle(STD_OUTPUT_HANDLE);
    SetConsoleCursorPosition(handle, position);
}
 
static void HidePos()
{
    CONSOLE_CURSOR_INFO cursor_info = {1, FALSE};
    SetConsoleCursorInfo(GetStdHandle(STD_OUTPUT_HANDLE), &cursor_info);
}
 
static status GAME_DataCreate()
{
    int x, y;
    int Weight;
    Weight = rand() % 10;
    srand(time(NULL));
    if (Map[TOWER][TOWER])
        return FALSE;
    while (1)
    {
        x = rand() % SIZE + 1;
        y = rand() % SIZE + 1;
        if (!Map[x][y])
            if (Weight)
            {
                Map[x][y] = 2;
                break;
            }
            else
            {
                Map[x][y] = 4;
                break;
            }
    }
 
    return OK;
}
 
static status GAME_YDataDeal(int Player_Input)
{
    SentryDouble Sentry;
    for (int i = 1; i <= SIZE; i++)
        GAME_YPartDataDeal(Player_Input, &Sentry, i);
    return OK;
}
 
static status GAME_XDataDeal(int Player_Input)
{
    SentryDouble Sentry;
    for (int i = 1; i <= SIZE; i++)
        GAME_XPartDataDeal(Player_Input, &Sentry, i);
    return OK;
}
 
static status GAME_DataDeal(int Player_Input)
{
    switch (Player_Input)
    {
    case UP:
    case DOWN:
        GAME_YDataDeal(Player_Input);
        break;
    case LEFT:
    case RIGHT:
        GAME_XDataDeal(Player_Input);
        break;
    default:
        break;
    }
    return OK;
}
 
static status CheckSentryDeal(int Player_Input, SentryDouble *Sentry)
{
 
    switch (Player_Input)
    {
    case UP:
        Sentry->CheckSentry = Sentry->CheckSentry + SIZE + 1;
        break;
    case DOWN:
        Sentry->CheckSentry = Sentry->CheckSentry - (SIZE + 1);
        break;
    case LEFT:
        Sentry->CheckSentry = Sentry->CheckSentry + 1;
        break;
    case RIGHT:
        Sentry->CheckSentry = Sentry->CheckSentry - 1;
        break;
    default:
        break;
    }
    if ((*Sentry->CheckSentry == *Sentry->TravelSentry) && (*Sentry->CheckSentry != 0))
        if (RangeSentryDeal(Player_Input, *Sentry) && *Sentry->TravelSentry != 2048)
        {
            DataMerge(Sentry);
            return OK;
        }
    return FALSE;
}
 
static status RangeSentryDeal(int Player_Input, SentryDouble Sentry)
{
    int I;
    int Sew; //缀
    Map_2048 *RangeSentry;
    switch (Player_Input)
    {
    case UP:
    case LEFT:
        Sew = Player_Input == UP ? (SIZE + 1) : 1;
        I = (Sentry.CheckSentry - Sentry.TravelSentry) / Sew;
        RangeSentry = Sentry.TravelSentry;
        while (I--)
        {
            RangeSentry = RangeSentry + Sew;
            if (*RangeSentry != 0 && *RangeSentry != *Sentry.TravelSentry)
                return FALSE;
        }
        break;
    case DOWN:
    case RIGHT:
        Sew = Player_Input == DOWN ? (SIZE + 1) : 1;
        I = (Sentry.TravelSentry - Sentry.CheckSentry) / Sew;
        RangeSentry = Sentry.CheckSentry;
        while (I--)
        {
            RangeSentry = RangeSentry + Sew;
            if (*RangeSentry != 0 && *RangeSentry != *Sentry.CheckSentry)
                return FALSE;
        }
        break;
    default:
        break;
    }
    return OK;
}
 
static status SentryInitialize(int Player_Input, SentryDouble *Sentry, int i)
{
    switch (Player_Input)
    {
    case UP:
        Sentry->TravelSentry = Sentry->CheckSentry = &Map[1][i];
        break;
    case LEFT:
        Sentry->TravelSentry = Sentry->CheckSentry = &Map[i][1];
        break;
    case DOWN:
        Sentry->TravelSentry = Sentry->CheckSentry = &Map[SIZE][SIZE - i + 1];
        break;
    case RIGHT:
        Sentry->TravelSentry = Sentry->CheckSentry = &Map[SIZE - i + 1][SIZE];
        break;
    default:
        break;
    }
    return OK;
}
 
static status GAME_XPartDataDeal(int Player_Input, SentryDouble *Sentry, int i)
{
    SentryInitialize(Player_Input, Sentry, i); //哨兵初始化
 
    Map_2048 *ExSentry;
    ExSentry = (Player_Input == LEFT ? (&Map[i][SIZE]) : (&Map[SIZE - i + 1][1])); //塔
    int Sew = Player_Input == LEFT ? 1 : -1;                                       //缀
 
    while ((*Sentry->TravelSentry == 0) && (Sentry->TravelSentry != ExSentry)) //排除零
        Sentry->CheckSentry = Sentry->TravelSentry = Sentry->TravelSentry + Sew;
    
 
    while (Sentry->TravelSentry != ExSentry)
    {
        Sentry->CheckSentry = Sentry->TravelSentry;
        while (Sentry->CheckSentry != ExSentry)
        {
            CheckSentryDeal(Player_Input, Sentry);
        }
        Sentry->TravelSentry = Sentry->TravelSentry + Sew;
    }
    return OK;
}
 
static status GAME_YPartDataDeal(int Player_Input, SentryDouble *Sentry, int i)
{
    SentryInitialize(Player_Input, Sentry, i); //哨兵初始化
    Map_2048 *ExSentry;
 
    ExSentry = (Player_Input == UP ? &Map[SIZE][i] : &Map[1][SIZE - i + 1]); //塔
    int Sew = (Player_Input == UP ? (SIZE + 1) : -(SIZE + 1));               //缀
 
    while ((*Sentry->TravelSentry == 0) && (Sentry->TravelSentry != ExSentry)) //排除零
        Sentry->CheckSentry = Sentry->TravelSentry = Sentry->TravelSentry + Sew;
    while (Sentry->TravelSentry != ExSentry)
    {
        Sentry->CheckSentry = Sentry->TravelSentry;
        while (Sentry->CheckSentry != ExSentry)
            CheckSentryDeal(Player_Input, Sentry);
        Sentry->TravelSentry = Sentry->TravelSentry + Sew;
    }
    return OK;
}
 
static status DataMerge(SentryDouble *Sentry)
{
    *Sentry->TravelSentry = (*Sentry->TravelSentry) * 2;
    *Sentry->CheckSentry = HIDE;
    return OK;
}
 
static status DataReorganize(int Player_Input)
{
    SentryDouble Sentry;
    Map_2048 *ExSentry; //塔
    int Sew;            //缀
    for (int i = 1; i <= SIZE; i++)
    {
        if (Player_Input == LEFT || Player_Input == RIGHT)
        {
            ExSentry = (Player_Input == LEFT ? &Map[i][SIZE] : &Map[SIZE - i + 1][1]); //塔
            Sew = (Player_Input == LEFT ? 1 : -1);                                     //缀
        }
        else if (Player_Input == UP || Player_Input == DOWN)
        {
            ExSentry = (Player_Input == UP ? &Map[SIZE][i] : &Map[1][SIZE - i + 1]); //塔
            Sew = (Player_Input == UP ? SIZE + 1 : -(SIZE + 1));                     //缀
        }
        SentryInitialize(Player_Input, &Sentry, i);
        while (Sentry.TravelSentry != ExSentry)
        {
            if (*Sentry.TravelSentry == 0)
            {
                Sentry.CheckSentry = Sentry.TravelSentry;
                while (Sentry.CheckSentry != ExSentry)
                {
                    Sentry.CheckSentry = Sentry.CheckSentry + Sew;
                    if (*Sentry.CheckSentry != 0)
                    {
                        *Sentry.TravelSentry = *Sentry.CheckSentry;
                        *Sentry.CheckSentry = 0;
                        break;
                    }
                }
            }
            Sentry.TravelSentry = Sentry.TravelSentry + Sew;
        }
    }
    return OK;
}
 
static status Node_Beautiy(int i, int j, int color)
{
    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), color);
    for (int w = 1; w <= 3; w++)
    {
        _SetPos(2 + 6 * i, w + 3 * j);
        w == 2 ? printf("%4d  ", Map[j + 1][i + 1]) : printf("      ");
    }
    return OK;
}
 
static status GAME_DataShow()
{
    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), 7);
    for (int i = 0; i < 4; i++)
    {
        for (int j = 0; j < 4; j++)
        {
            switch (Map[j + 1][i + 1])
            {
            case 2:
                Node_Beautiy(i, j, 191);
                break;
            case 4:
                Node_Beautiy(i, j, 159);
                break;
            case 8:
                Node_Beautiy(i, j, 175);
                break;
            case 16:
                Node_Beautiy(i, j, 223);
                break;
            case 32:
                Node_Beautiy(i, j, 207);
                break;
            case 64:
                Node_Beautiy(i, j, 71);
                break;
            case 128:
                Node_Beautiy(i, j, 143);
                break;
            case 256:
                Node_Beautiy(i, j, 63);
                break;
            case 512:
                Node_Beautiy(i, j, 31);
                break;
            case 1024:
                Node_Beautiy(i, j, 79);
                break;
            case 2048:
                Node_Beautiy(i, j, 78);
                break;
            case 0:
                SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), 255);
                _SetPos(2 + 6 * i, 1 + 3 * j);
                printf("      ");
                _SetPos(2 + 6 * i, 2 + 3 * j);
                printf("      ");
                _SetPos(2 + 6 * i, 3 + 3 * j);
                printf("      ");
                break;
            default:
                break;
            }
        }
    }
    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), 15);
    return OK;
}
 
static status GAME_DataTowerDeal()
{
    int j, i;
    for (i = 1; i <= SIZE; i++)
    {
        for (j = 1; j <= SIZE; j++)
            if (!Map[i][j])
                break;
        if (j == SIZE + 1)
            Map[i][TOWER] = 1;
        else
            Map[i][TOWER] = 0;
    }
 
    for (i = 1; i <= SIZE; i++)
    {
        for (j = 1; j <= SIZE; j++)
            if (!Map[j][i])
                break;
        if (j == SIZE + 1)
            Map[TOWER][i] = 1;
        else
            Map[TOWER][i] = 0;
    }
    for (i = 1; i <= SIZE; i++)
        if (!Map[i][TOWER] || !Map[TOWER][i])
            break;
    Map[TOWER][TOWER] = (i == SIZE + 1 ? 1 : 0);
    return OK;
}
 
static status GAME_PLAY()
{
    system("mode con cols=28 lines=17 ");
    HidePos();
    GAME_DataInitialize();
    int Player_Input, count = 0;
    for (int i = 0; i <= SIZE; i++)
        for (int j = 0; j <= SIZE; j++)
            Map[i][j] = 0;
    for (int i = 0; i < 3; i++) //初始化
        GAME_DataCreate();
    GAME_DataShow();
    
    while (1)
    {
        HidePos();
        _SetPos(0, 14);
        SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), 15);
        printf("得分:%5d ", count);
        printf("重开:R");
        HidePos();
    InputAgain:
        Player_Input = _getch();
        if (Player_Input == 224)
            Player_Input = _getch();
        else if (Player_Input == (int)'R' || Player_Input == (int)'r')
            main();
        else
            goto InputAgain;
 
        GAME_DataDeal(Player_Input);
        DataReorganize(Player_Input);
        GAME_DataTowerDeal();
        GAME_DataShow();
 
        Sleep(100);
        GAME_DataCreate();
        GAME_DataTowerDeal();
        GAME_DataShow();
 
        if (GAME_OverJudge() == 1)
            break;
        else if (!GAME_OverJudge())
            count++;
        HidePos();
    }
    _SetPos(0, 15);
    printf("游戏结束 ");

Again:
    printf("是否再来一次？(Y)/(N)");
    char Player_in;
    Player_in = getchar();
    if (Player_in == 'Y' || Player_in == 'y')
        main();
    else if (Player_in == 'N' || Player_in == 'n')
        return OK;
    else
        goto Again;
}









转载请注明：文章转载自 www.mshxw.com


本文地址：https://www.mshxw.com/it/989759.html















C/C++/C#相关栏目本月热门文章













热门相关搜索






路由器设置
木托盘
宝塔面板
儿童python教程
心情低落
朋友圈
vim
双一流学科
专升本
我的学校
日记学校
西点培训学校
汽修学校
情书
化妆学校
塔沟武校
异形模板
西南大学排名
最精辟人生短句
6步教你追回被骗的钱
南昌大学排名
清朝十二帝
北京印刷学院排名
北方工业大学排名
北京航空航天大学排名
首都经济贸易大学排名
中国传媒大学排名
首都师范大学排名
中国地质大学(北京)排名
北京信息科技大学排名
中央民族大学排名
北京舞蹈学院排名
北京电影学院排名
中国戏曲学院排名
河北政法职业学院排名
河北经贸大学排名
天津中德应用技术大学排名
天津医学高等专科学校排名
天津美术学院排名
天津音乐学院排名
天津工业大学排名
北京工业大学耿丹学院排名
北京警察学院排名
天津科技大学排名
北京邮电大学(宏福校区)排名
北京网络职业学院排名
北京大学医学部排名
河北科技大学排名
河北地质大学排名
河北体育学院排名















学习工具


代数计算器


三角函数


解析几何


立体几何






知识解答


教育知识


百科知识


生活知识


常识知识






写作必备


作文大全


作文素材


句子大全



实用范文






关于我们


关于我们


联系我们


网站地图






 交流群

名师互学网交流群




名师互学网客服

名师互学网客服












名师互学网 版权所有 (c)2021-2022      ICP备案号：晋ICP备2021003244-6号
 








我们一直用心在做

关于我们
文章归档
网站地图
联系我们

版权所有 (c)2021-2022 MSHXW.COM


ICP备案号：晋ICP备2021003244-6号