← 都来码 / Dolaima← 例程索引objc/app/g2048.m▶ 在浏览器里试玩 原文

objc/app/g2048.m · 11918 字节 · 下载原文

▶ 在浏览器里试玩

// 2048 —— 用 **ObjC** 写的手机小游戏(合并 / 数字)
// 2048 — a small phone game written in **ObjC** (merge / numbers)
//
// 玩法(与 `Examples/c/app/game2048.c` / `Examples/python/app/game2048.py` 同一套):
// Gameplay (same rules as the C / Python versions):
//   · 4×4 棋盘,方向键 / 点屏幕四边往一个方向滑;
//   · a 4x4 board; arrow keys / tapping one of the four screen edges slide everything that way;
//   · 相同数字相撞合成两倍、得分加上合成值,每滑一次冒一个新数字(10% 是 4);
//   · equal numbers merge and score the merged value; each slide spawns a new tile (4 with 10% odds);
//   · 到 2048 算赢(还能继续),没空格且四邻无相等算输;ESC / R 重开。
//   · reaching 2048 wins (you may keep playing); no empty cell and no adjacent equal pair loses; ESC / R restarts.
//
// ## 合并的**先后**容易写错
// ## The **merge order** is easy to get wrong
//
// 一次滑动里每个块只许合并一次(`4 4 4 4` 滑一次是 `8 8`,不是 `16`),所以从滑动方向的**最远端**往回收。
// Each tile may merge only once per slide (`4 4 4 4` becomes `8 8`, not `16`), so collapse from the far end.
//
// ## 写法约束(见 `Examples/objc/app/snake.m` 文件头)
// ## Style constraints (see the header of `Examples/objc/app/snake.m`)
//
//   · 循环更新写 `i = i + 1`;数组没有初始化列表,逐元素赋值;
//   · loop updates are `i = i + 1`; arrays have no initializer lists — assign element by element;
//   · 颜色写负数十进制;状态放**一个**文件级数组 `A[]`,辅助函数一律无参。
//   · colours are negative decimals; state lives in **one** file-level array `A[]`, helpers take no arguments.
//
// 跑法 —— 手机:`vml run examples/objc/g2048.m`
// How to run — on the phone: `vml run examples/objc/g2048.m`
// 跑法 —— 桌面:`vmlcli Examples/objc/g2048.m --screen 480x640 --frames /tmp/fr`
// How to run — on the desktop: `vmlcli Examples/objc/g2048.m --screen 480x640 --frames /tmp/fr`

#include <vml_ui.h>
#import <vml_ui.h>

// 状态表:
//   0..15 = 棋盘;16..19 = 合并缓冲;20..23 = 原值快照
//   24=SCORE 25=WON 26=LOST 27=SEED 28=CELL 29=OX 30=OY 31=SW 32=SH
//   33=LANG 34=FRAMES 35=I 36=K 37=D 38=J 39=N 40=OUT 41=PICK
//   42=CHANGED 43=T 44=TX 45=TY 46=TID 47=DL 48=DR 49=DT 50=DB 51=FOOT_Y 52=CELL_H
int A[53];

#define MAX_FRAMES 20000

#define C_BG    -15724520        // 0xFF101018
#define C_TEXT  -1513232         // 0xFFE8E8F0
#define C_DIM   -6643536         // 0xFF9AA0B0

char g_num[12];

char* numstr(int v) {
    int n = 0;
    int m = 0;
    char tmp[12];
    if (v < 0) { g_num[0] = '-'; v = -v; n = 1; }
    if (v == 0) { g_num[n] = '0'; g_num[n + 1] = 0; return g_num; }
    while (v > 0) { tmp[m] = (char)('0' + v % 10); v = v / 10; m = m + 1; }
    while (m > 0) { m = m - 1; g_num[n] = tmp[m]; n = n + 1; }
    g_num[n] = 0;
    return g_num;
}

void relayout() {
    A[31] = ui_scr_get_w();
    A[32] = ui_scr_get_h();
    if (A[31] <= 0) { A[31] = 360; }
    if (A[32] <= 0) { A[32] = 620; }
    // 小屏把棋盘往上提,给 4 行格子留出高度
    if (A[32] < 360) { A[30] = 64; }
    else { A[30] = 120; }
    A[28] = (A[31] - 20) / 4;
    // 高度也要放得下棋盘 + 底部提示
    A[52] = (A[32] - A[30] - 40) / 4;
    if (A[52] < A[28]) { A[28] = A[52]; }
    if (A[28] < 6) { A[28] = 6; }
    A[29] = (A[31] - 4 * A[28]) / 2;
    if (A[29] < 4) { A[29] = 4; }
    A[51] = A[30] + 4 * A[28] + 26;
    if (A[51] > A[32] - 14) { A[51] = A[32] - 14; }
}

void spawn() {
    A[39] = 0;
    A[35] = 0;
    while (A[35] < 16) {
        if (A[A[35]] == 0) { A[39] = A[39] + 1; }
        A[35] = A[35] + 1;
    }
    if (A[39] == 0) { return; }
    A[27] = (A[27] * 1103 + 12345) % 32768;
    A[41] = (A[27] / 256) % A[39];
    A[35] = 0;
    while (A[35] < 16) {
        if (A[A[35]] == 0) {
            if (A[41] == 0) {
                A[27] = (A[27] * 1103 + 12345) % 32768;
                if ((A[27] / 256) % 10 == 0) { A[A[35]] = 4; }
                else { A[A[35]] = 2; }
                A[35] = 16;
            } else {
                A[41] = A[41] - 1;
            }
        }
        if (A[35] < 16) { A[35] = A[35] + 1; }
    }
}

void newGame() {
    A[35] = 0;
    while (A[35] < 16) {
        A[A[35]] = 0;
        A[35] = A[35] + 1;
    }
    A[24] = 0;
    A[25] = 0;
    A[26] = 0;
    A[34] = 0;
    A[27] = 20261;
    spawn();
    spawn();
}

void readLine() {
    A[35] = 0;
    while (A[35] < 4) {
        if (A[37] == 0) { A[16 + A[35]] = A[A[36] * 4 + A[35]]; }
        if (A[37] == 1) { A[16 + A[35]] = A[A[36] * 4 + (3 - A[35])]; }
        if (A[37] == 2) { A[16 + A[35]] = A[A[35] * 4 + A[36]]; }
        if (A[37] == 3) { A[16 + A[35]] = A[(3 - A[35]) * 4 + A[36]]; }
        A[35] = A[35] + 1;
    }
}

void writeLine() {
    A[35] = 0;
    while (A[35] < 4) {
        if (A[37] == 0) { A[A[36] * 4 + A[35]] = A[16 + A[35]]; }
        if (A[37] == 1) { A[A[36] * 4 + (3 - A[35])] = A[16 + A[35]]; }
        if (A[37] == 2) { A[A[35] * 4 + A[36]] = A[16 + A[35]]; }
        if (A[37] == 3) { A[(3 - A[35]) * 4 + A[36]] = A[16 + A[35]]; }
        A[35] = A[35] + 1;
    }
}

// 滑一次:从远端收拢 + 每个块只合并一次;有变化返回 1
int slide() {
    A[42] = 0;
    A[36] = 0;
    while (A[36] < 4) {
        readLine();
        A[35] = 0;
        while (A[35] < 4) {
            A[20 + A[35]] = A[16 + A[35]];
            A[35] = A[35] + 1;
        }
        A[39] = 0;
        A[35] = 0;
        while (A[35] < 4) {
            if (A[16 + A[35]] != 0) {
                A[16 + A[39]] = A[16 + A[35]];
                A[39] = A[39] + 1;
            }
            A[35] = A[35] + 1;
        }
        A[35] = A[39];
        while (A[35] < 4) {
            A[16 + A[35]] = 0;
            A[35] = A[35] + 1;
        }
        A[40] = 0;
        A[35] = 0;
        while (A[35] < A[39]) {
            if (A[35] + 1 < A[39] && A[16 + A[35]] == A[16 + A[35] + 1]) {
                A[16 + A[40]] = A[16 + A[35]] * 2;
                A[24] = A[24] + A[16 + A[35]] * 2;
                if (A[16 + A[35]] * 2 >= 2048) { A[25] = 1; }
                A[35] = A[35] + 2;
            } else {
                A[16 + A[40]] = A[16 + A[35]];
                A[35] = A[35] + 1;
            }
            A[40] = A[40] + 1;
        }
        A[35] = A[40];
        while (A[35] < 4) {
            A[16 + A[35]] = 0;
            A[35] = A[35] + 1;
        }
        A[35] = 0;
        while (A[35] < 4) {
            if (A[16 + A[35]] != A[20 + A[35]]) { A[42] = 1; }
            A[35] = A[35] + 1;
        }
        writeLine();
        A[36] = A[36] + 1;
    }
    return A[42];
}

int canMove() {
    A[35] = 0;
    while (A[35] < 16) {
        if (A[A[35]] == 0) { return 1; }
        A[35] = A[35] + 1;
    }
    A[44] = 0;
    while (A[44] < 4) {
        A[45] = 0;
        while (A[45] < 4) {
            if (A[44] + 1 < 4 && A[A[44] * 4 + A[45]] == A[(A[44] + 1) * 4 + A[45]]) { return 1; }
            if (A[45] + 1 < 4 && A[A[44] * 4 + A[45]] == A[A[44] * 4 + A[45] + 1]) { return 1; }
            A[45] = A[45] + 1;
        }
        A[44] = A[44] + 1;
    }
    return 0;
}

void draw() {
    ui_2d_clear(C_BG);
    A[35] = 0;
    while (A[35] < 16) {
        if (A[A[35]] == 0) {
            ui_2d_rect(A[29] + (A[35] % 4) * A[28] + 2, A[30] + (A[35] / 4) * A[28] + 2,
                       A[28] - 4, A[28] - 4, -15066588, 1, 0, 6);
        } else {
            if (A[A[35]] == 2) { ui_2d_rect(A[29] + (A[35] % 4) * A[28] + 2, A[30] + (A[35] / 4) * A[28] + 2, A[28] - 4, A[28] - 4, -14013898, 1, 0, 6); }
            if (A[A[35]] == 4) { ui_2d_rect(A[29] + (A[35] % 4) * A[28] + 2, A[30] + (A[35] / 4) * A[28] + 2, A[28] - 4, A[28] - 4, -12960184, 1, 0, 6); }
            if (A[A[35]] == 8) { ui_2d_rect(A[29] + (A[35] % 4) * A[28] + 2, A[30] + (A[35] / 4) * A[28] + 2, A[28] - 4, A[28] - 4, -11890471, 1, 0, 6); }
            if (A[A[35]] == 16) { ui_2d_rect(A[29] + (A[35] % 4) * A[28] + 2, A[30] + (A[35] / 4) * A[28] + 2, A[28] - 4, A[28] - 4, -11409298, 1, 0, 6); }
            if (A[A[35]] == 32) { ui_2d_rect(A[29] + (A[35] % 4) * A[28] + 2, A[30] + (A[35] / 4) * A[28] + 2, A[28] - 4, A[28] - 4, -2509750, 1, 0, 6); }
            if (A[A[35]] == 64) { ui_2d_rect(A[29] + (A[35] % 4) * A[28] + 2, A[30] + (A[35] / 4) * A[28] + 2, A[28] - 4, A[28] - 4, -2069424, 1, 0, 6); }
            if (A[A[35]] == 128) { ui_2d_rect(A[29] + (A[35] % 4) * A[28] + 2, A[30] + (A[35] / 4) * A[28] + 2, A[28] - 4, A[28] - 4, -2069336, 1, 0, 6); }
            if (A[A[35]] == 256) { ui_2d_rect(A[29] + (A[35] % 4) * A[28] + 2, A[30] + (A[35] / 4) * A[28] + 2, A[28] - 4, A[28] - 4, -6591248, 1, 0, 6); }
            if (A[A[35]] == 512) { ui_2d_rect(A[29] + (A[35] % 4) * A[28] + 2, A[30] + (A[35] / 4) * A[28] + 2, A[28] - 4, A[28] - 4, -11871802, 1, 0, 6); }
            if (A[A[35]] >= 1024) { ui_2d_rect(A[29] + (A[35] % 4) * A[28] + 2, A[30] + (A[35] / 4) * A[28] + 2, A[28] - 4, A[28] - 4, -4145088, 1, 0, 6); }
            ui_2d_text(A[29] + (A[35] % 4) * A[28] + A[28] / 2, A[30] + (A[35] / 4) * A[28] + A[28] / 2 + A[28] / 6,
                       numstr(A[A[35]]), C_TEXT, A[28] / 3, VML_ANCHOR_CENTER);
        }
        A[35] = A[35] + 1;
    }

    ui_2d_text(10, 24, numstr(A[24]), C_TEXT, 18, VML_ANCHOR_LEFT);
    if (A[33] == 0) { ui_2d_text(10, 48, "得分", C_DIM, 10, VML_ANCHOR_LEFT); }
    else { ui_2d_text(10, 48, "score", C_DIM, 10, VML_ANCHOR_LEFT); }

    if (A[26] != 0) {
        if (A[33] == 0) { ui_2d_text(A[31] / 2, A[51], "没路可走了,ESC / R 重开", C_TEXT, 14, VML_ANCHOR_CENTER); }
        else { ui_2d_text(A[31] / 2, A[51], "No moves left - ESC / R to restart", C_TEXT, 14, VML_ANCHOR_CENTER); }
    } else {
        if (A[33] == 0) { ui_2d_text(A[31] / 2, A[51], "方向键 / 点屏幕四边滑动", C_DIM, 11, VML_ANCHOR_CENTER); }
        else { ui_2d_text(A[31] / 2, A[51], "Arrows / tap a screen edge to slide", C_DIM, 11, VML_ANCHOR_CENTER); }
    }
    ui_2d_present();
}

void move() {
    if (A[26] != 0) { return; }
    if (slide() != 0) {
        spawn();
        if (canMove() == 0) { A[26] = 1; }
    }
}

int main() {
    A[33] = ui_scr_get_language();
    ui_win_open("2048", 0, 0);
    ui_scr_set_keep_on(1);

    relayout();
    newGame();
    draw();

    A[46] = ui_timer_set(50, 0);
    while (ui_win_is_closed() == 0) {
        A[43] = ui_msg_fetch_wait(0);
        if (A[43] == 10) { break; }

        A[37] = -1;
        if (A[43] == 1) {
            A[36] = ui_msg_get_a();
            if (A[36] == 37) { A[37] = 0; }
            if (A[36] == 39) { A[37] = 1; }
            if (A[36] == 38) { A[37] = 2; }
            if (A[36] == 40) { A[37] = 3; }
            if (A[36] == 27 || A[36] == 82) {
                A[35] = 0;
                while (A[35] < 16) { A[A[35]] = 0; A[35] = A[35] + 1; }
                A[24] = 0;
                A[25] = 0;
                A[26] = 0;
                A[27] = 20261;
                A[0] = 2;
                A[5] = 2;
            }
        }

        if (A[43] == 6 || A[43] == 4) {
            A[44] = ui_msg_get_a();
            A[45] = ui_msg_get_b();
            A[47] = A[44];
            A[48] = A[31] - A[44];
            A[49] = A[45];
            A[50] = A[32] - A[45];
            if (A[47] <= A[48] && A[47] <= A[49] && A[47] <= A[50]) { A[37] = 0; }
            else if (A[48] <= A[49] && A[48] <= A[50]) { A[37] = 1; }
            else if (A[49] <= A[50]) { A[37] = 2; }
            else { A[37] = 3; }
        }

        if (A[37] >= 0) { move(); }

        if (A[43] == 11) { relayout(); }

        A[34] = A[34] + 1;
        if (A[34] >= MAX_FRAMES) { break; }
        draw();
    }

    ui_timer_kill(A[46]);
    ui_scr_set_keep_on(0);
    ui_win_close();
    return 0;
}