c++实现2048游戏

代码实现

---

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<conio.h>
int sz[6][6],cnt=0;

/*初始化数组*/
void csh()
{
    for (int i = 1;i <= 4;i++)
        for (int j = 1;j <= 4;j++)
            sz[i][j] = 0;

    for (int i = 0;i <= 5;i++)
        sz[0][i] = sz[i][0] = sz[5][i] = sz[i][5] = '*';
}
/*输出数组*/
void sc()
{
    for (int i = 0;i <= 5;i++)
    {
        for (int j = 0;j <= 5;j++)
            if (sz[i][j] == 0)
                printf("   ");
            else if (sz[i][j] == '*')
                printf(" * ");
            else
                printf(" %d ", sz[i][j]);
        printf("
");
    }
    printf("现在您的积分为:%d",cnt);
}

/*随机位置生成2或4*/
void suiji()
{
    int num,*p;
    srand(time(NULL));
    for (int j = 0;j <= 10;j++)
        num = (rand() % 2 + 1) * 2;
    p=&sz[rand() % 4 + 1][rand() % 4 + 1];
    if (*p == 0)
        *p = num;
    else
    { 
        while (*p != 0)
        {
            p = &sz[rand() % 4 + 1][rand() % 4 + 1];
        }
        *p = num;
    }
}

/*控制数组数字向上移动,返回是否移动
        return
            isMove    是否移动
                true    是
                false    否*/
bool up()
{
    bool isMove=false;

    for(int k=1;k<=4;k++)
        for (int i = 2;i <= 4;i++)
            for (int j = 1;j <= 4;j++)
                if (sz[i - 1][j] != '*'&& (sz[i - 1][j] == sz[i][j]|| sz[i - 1][j]==0))
                { 
                    if (sz[i - 1][j] == sz[i][j])
                    {
                        sz[i - 1][j] = sz[i - 1][j] + sz[i][j];
                        sz[i][j] = 0;
                        cnt = cnt + sz[i - 1][j];
                        
                    }
                    else{
                        sz[i -1][j] = sz[i][j];
                        sz[i][j] = 0;
                    }
                    if(sz[i-1][j]!=0)
                        isMove = true;
                }
    return isMove;
}

/*控制数组数字向下移动,返回是否移动
        return
            isMove    是否移动
                true    是
                false    否*/
bool down()
{
    int isMove=false;

    for (int k = 1;k <= 4;k++)
        for (int i = 3;i >= 1;i--)
            for (int j = 1;j <= 4;j++)
                if (sz[i + 1][j] != '*' && (sz[i + 1][j] == sz[i][j] || sz[i + 1][j] == 0))
                {
                    if (sz[i + 1][j] == sz[i][j])
                    {
                        sz[i + 1][j] = sz[i + 1][j] + sz[i][j];
                        sz[i][j] = 0;
                        cnt = cnt + sz[i + 1][j];
                    }
                    else {
                        sz[i + 1][j] = sz[i][j];
                        sz[i][j] = 0;
                    }
                    if (sz[i + 1][j] != 0)
                        isMove = true;
                }
    return isMove;
}

/*控制数组数字向左移动,返回是否移动
        return
            isMove    是否移动
                true    是
                false    否*/
bool left()
{
    int isMove = false;

    for (int k = 1;k <= 4;k++)
        for (int i = 1;i <= 4;i++)
            for (int j = 2;j <= 4;j++)
                if (sz[i][j-1] != '*' && (sz[i][j-1] == sz[i][j] || sz[i][j-1] == 0))
                {
                    if (sz[i][j-1] == sz[i][j])
                    {
                        sz[i][j-1] = sz[i][j-1] + sz[i][j];
                        sz[i][j] = 0;
                        cnt = cnt + sz[i][j-1];
                    }
                    else {
                        sz[i][j-1] = sz[i][j];
                        sz[i][j] = 0;
                    }
                    if (sz[i][j-1] != 0)
                        isMove = true;
                }
    return isMove;
}

/*控制数组数字向右移动,返回是否移动
        return
            isMove    是否移动
                true    是
                false    否*/
bool right()
{
    bool isMove = false;

    for (int k = 1;k <= 4;k++)
        for (int i = 1;i <= 4;i++)
            for (int j = 3;j >= 1;j--)
                if (sz[i][j+1] != '*' && (sz[i][j + 1] == sz[i][j] || sz[i][j + 1] == 0))
                {
                    if (sz[i][j + 1] == sz[i][j])
                    {
                        sz[i][j +1] = sz[i][j + 1] + sz[i][j];
                        sz[i][j] = 0;
                        cnt = cnt + sz[i][j + 1];
                    }
                    else {
                        sz[i][j + 1] = sz[i][j];
                        sz[i][j] = 0;
                    }
                    if (sz[i][j+1] != 0)
                        isMove = true;
                }
    return isMove;
}

/*接收键盘输入，进行判断移动方向，并连接到各个方向函数去，返回是否移动
        return
            isMove    是否移动
                true    是
                false    否*/
bool movePd()
{
    char pd;
    bool isMove;

    pd = _getch();
    while(pd!='w'&& pd != 'W'&& pd != 'A'&& pd != 'a'&& pd != 's'&& pd != 'S'&& pd != 'd'&& pd != 'D')
        pd = _getch();
    switch (pd)
    {
    case 'W':
    case 'w':isMove=up();break;
    case 'S':
    case 's':isMove = down();break;
    case 'A':
    case 'a':isMove = left(); break;
    case 'D':
    case 'd':isMove = right();
    }
    return isMove;
}

/*判断游戏是否结束
    return 
        ture    游戏结束
        false    游戏继续*/
bool isEnd()
{
    for (int i = 1; i <= 4; i++)
        for (int j = 1; j <= 4;j++)
            if (sz[i][j] == 0)
                return false;
    for (int i = 1; i <= 4; i++)
        for (int j = 1; j <= 4; j++)
            if (sz[i][j] == sz[i+1][j]|| sz[i][j] == sz[i - 1][j] || sz[i][j] == sz[i][j+1] || sz[i][j] == sz[i][j-1])
                return false;
    return true;
}
void main()
{
    bool end = false,isMove;

    csh();
    suiji();
    sc();
    while (!end)
    {    
        isMove=movePd();
        if (isMove)
        {        
        system("cls");
        suiji();
        sc();
        end = isEnd();
        }

    }
    printf("
游戏结束！！！
");
    
}

 运行截图

---

 

 题外话

---

看起来很丑对吧，但要美观实在太麻烦了。。。不过反正重点是游戏的实现，美观方面就无所谓了