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

d/app/g2048.d · 12426 字节 · 下载原文

▶ 在浏览器里试玩

// 2048 —— 用 **D** 写的手机小游戏(数字合并)
// 2048 -- a small phone game written in **D** (merge tiles)
//
// 玩法:方向键或底部四个按钮滑动,数字相同的两块合成一块;每次滑动在
// 空位补一个 2;合出 2048 就赢,格子满且不能动就结束。ESC 重开。
//
// 跑法 —— 手机:vml run examples/d/g2048.d
// 跑法 —— 桌面:vmlcli Examples/d/g2048.d --screen 480x640 --frames /tmp/fr

#include <vml_ui.d>

char[] digit(int d) {
    if (d == 0) { return "0"; }
    if (d == 1) { return "1"; }
    if (d == 2) { return "2"; }
    if (d == 3) { return "3"; }
    if (d == 4) { return "4"; }
    if (d == 5) { return "5"; }
    if (d == 6) { return "6"; }
    if (d == 7) { return "7"; }
    if (d == 8) { return "8"; }
    return "9";
}

void drawNum(int x, int y, int v, int col, int sz) {
    int p1000 = v / 1000;
    int p100 = (v / 100) % 10;
    int p10 = (v / 10) % 10;
    int p1 = v % 10;
    int cx = x;
    if (p1000 > 0) {
        ui_2d_text(cx, y, digit(p1000), col, sz, 0);
        cx = cx + sz / 2;
        ui_2d_text(cx, y, digit(p100), col, sz, 0);
        cx = cx + sz / 2;
    } else if (p100 > 0) {
        ui_2d_text(cx, y, digit(p100), col, sz, 0);
        cx = cx + sz / 2;
    }
    if (p1000 > 0 || p100 > 0 || p10 > 0) {
        ui_2d_text(cx, y, digit(p10), col, sz, 0);
        cx = cx + sz / 2;
    }
    ui_2d_text(cx, y, digit(p1), col, sz, 0);
}

int numDigits(int v) {
    int d = 1;
    while (v >= 10) { v = v / 10; d = d + 1; }
    return d;
}

void main() {
    int k = ui_win_open("2048", 0, 0);
    k = ui_scr_set_keep_on(1);
    int w = ui_scr_get_w();
    int h = ui_scr_get_h();
    if (w <= 0) { w = 360; }
    if (h <= 0) { h = 620; }
    int small = w;
    if (h < small) { small = h; }

    // 版面按画布现算:顶部计分 + 中间 4×4 棋盘 + 底部四个方向按钮。
    int score_fs = small / 16;
    if (score_fs < 16) { score_fs = 16; }
    if (score_fs > 40) { score_fs = 40; }
    int label_fs = small / 30;
    if (label_fs < 9) { label_fs = 9; }
    if (label_fs > 16) { label_fs = 16; }
    int hint_fs = small / 26;
    if (hint_fs < 9) { hint_fs = 9; }
    if (hint_fs > 16) { hint_fs = 16; }
    int btn_fs = small / 18;
    if (btn_fs < 14) { btn_fs = 14; }
    if (btn_fs > 40) { btn_fs = 40; }

    int score_y = score_fs + 4;
    int label_y = score_y + label_fs + 4;
    int hint_y = label_y + hint_fs + 8;
    int top = hint_y + 6;
    int pad = w / 40;
    if (pad < 8) { pad = 8; }

    int btn_h = small / 8;
    if (btn_h < 32) { btn_h = 32; }
    if (btn_h > 80) { btn_h = 80; }
    int margin = h / 40;
    if (margin < 8) { margin = 8; }
    int btn_y = h - btn_h - margin;
    int avail_h = btn_y - top - margin;
    if (avail_h < 24) { avail_h = 24; }
    int cellw = w - 2 * pad;
    if (avail_h < cellw) { cellw = avail_h; }
    cellw = cellw / 4;
    if (cellw < 6) { cellw = 6; }
    int ox = (w - cellw * 4) / 2;
    int oy = top + (avail_h - cellw * 4) / 2;
    if (oy < top) { oy = top; }

    int btn_gap = w / 60;
    if (btn_gap < 6) { btn_gap = 6; }
    if (btn_gap > 20) { btn_gap = 20; }
    int btn_w = (w - 2 * pad - 3 * btn_gap) / 4;
    if (btn_w < 30) { btn_w = 30; }
    if (btn_w > 220) { btn_w = 220; }
    int bx0 = (w - (btn_w * 4 + btn_gap * 3)) / 2;
    int frames = 0;
    int dir = 0;
    int over = 0;
    int won = 0;
    int score = 0;

    int[16] grid;
    int i = 0;
    while (i < 16) { grid[i] = 0; i = i + 1; }

    int free = 16;
    int pick = ui_math_rand(free) + 1;
    int n = 0;
    i = 0;
    while (i < 16) {
        if (grid[i] == 0) {
            n = n + 1;
            if (n == pick) { grid[i] = 2; }
        }
        i = i + 1;
    }
    pick = ui_math_rand(free) + 1;
    n = 0;
    i = 0;
    while (i < 16) {
        if (grid[i] == 0) {
            n = n + 1;
            if (n == pick) { grid[i] = 2; }
        }
        i = i + 1;
    }

    int tid = ui_timer_set(100, 0);

    while (frames < 30000) {
        if (dir > 0) {
            int d = dir;
            dir = 0;
            if (over == 0) {
                int sw = 0;
                int r = 0;
                while (r < 4) {
                    int l0 = 0;
                    int l1 = 0;
                    int l2 = 0;
                    int l3 = 0;
                    if (d == 1 || d == 2) {
                        int j0 = r * 4;
                        if (d == 1) {
                            l0 = grid[j0]; l1 = grid[j0 + 1];
                            l2 = grid[j0 + 2]; l3 = grid[j0 + 3];
                        } else {
                            l0 = grid[j0 + 3]; l1 = grid[j0 + 2];
                            l2 = grid[j0 + 1]; l3 = grid[j0];
                        }
                    } else {
                        int c0 = r;
                        if (d == 4) {
                            l0 = grid[c0]; l1 = grid[c0 + 4];
                            l2 = grid[c0 + 8]; l3 = grid[c0 + 12];
                        } else {
                            l0 = grid[c0 + 12]; l1 = grid[c0 + 8];
                            l2 = grid[c0 + 4]; l3 = grid[c0];
                        }
                    }
                    int b0 = l0; int b1 = l1; int b2 = l2; int b3 = l3;
                    if (l0 == 0) { l0 = l1; l1 = l2; l2 = l3; l3 = 0; }
                    if (l0 == 0) { l0 = l1; l1 = l2; l2 = l3; l3 = 0; }
                    if (l0 == 0) { l0 = l1; l1 = l2; l2 = l3; l3 = 0; }
                    if (l1 == 0) { l1 = l2; l2 = l3; l3 = 0; }
                    if (l1 == 0) { l1 = l2; l2 = l3; l3 = 0; }
                    if (l2 == 0) { l2 = l3; l3 = 0; }
                    if (l0 == l1 && l0 > 0) {
                        l0 = l0 * 2;
                        score = score + l0;
                        l1 = l2; l2 = l3; l3 = 0;
                    }
                    if (l1 == l2 && l1 > 0) {
                        l1 = l1 * 2;
                        score = score + l1;
                        l2 = l3; l3 = 0;
                    }
                    if (l2 == l3 && l2 > 0) {
                        l2 = l2 * 2;
                        score = score + l2;
                        l3 = 0;
                    }
                    if (l0 != b0 || l1 != b1 || l2 != b2 || l3 != b3) { sw = 1; }
                    if (d == 1 || d == 2) {
                        int j1 = r * 4;
                        if (d == 1) {
                            grid[j1] = l0; grid[j1 + 1] = l1;
                            grid[j1 + 2] = l2; grid[j1 + 3] = l3;
                        } else {
                            grid[j1] = l3; grid[j1 + 1] = l2;
                            grid[j1 + 2] = l1; grid[j1 + 3] = l0;
                        }
                    } else {
                        int c1 = r;
                        if (d == 4) {
                            grid[c1] = l0; grid[c1 + 4] = l1;
                            grid[c1 + 8] = l2; grid[c1 + 12] = l3;
                        } else {
                            grid[c1] = l3; grid[c1 + 4] = l2;
                            grid[c1 + 8] = l1; grid[c1 + 12] = l0;
                        }
                    }
                    r = r + 1;
                }
                if (sw == 1) {
                    int free2 = 0;
                    i = 0;
                    while (i < 16) {
                        if (grid[i] == 0) { free2 = free2 + 1; }
                        i = i + 1;
                    }
                    if (free2 > 0) {
                        int pick2 = ui_math_rand(free2) + 1;
                        int n2 = 0;
                        i = 0;
                        while (i < 16) {
                            if (grid[i] == 0) {
                                n2 = n2 + 1;
                                if (n2 == pick2) { grid[i] = 2; }
                            }
                            i = i + 1;
                        }
                    }
                    over = 1;
                    i = 0;
                    while (i < 16) {
                        if (grid[i] == 0) { over = 0; }
                        if (grid[i] >= 2048) { won = 1; }
                        i = i + 1;
                    }
                }
            }
        }

        k = ui_2d_clear(-15724520);
        i = 0;
        while (i < 16) {
            int r2 = i / 4;
            int c2 = i - r2 * 4;
            int ax = ox + c2 * cellw + 2;
            int ay = oy + r2 * cellw + 2;
            int jc = -14408660;
            if (grid[i] == 2) { jc = -14013902; }
            if (grid[i] == 4) { jc = -12961724; }
            if (grid[i] == 8) { jc = -11890471; }
            if (grid[i] == 16) { jc = -12847168; }
            if (grid[i] == 32) { jc = -2073552; }
            if (grid[i] == 64) { jc = -2516442; }
            if (grid[i] == 128) { jc = -10044566; }
            if (grid[i] == 256) { jc = -16728155; }
            if (grid[i] >= 512) { jc = -6587448; }
            k = ui_2d_rect(ax, ay, cellw - 4, cellw - 4, jc, 1, 0, 6);
            if (grid[i] > 0) {
                int nf = cellw / 3;
                if (nf < 9) { nf = 9; }
                int nd = numDigits(grid[i]);
                int nx = ox + c2 * cellw + cellw / 2 - nd * nf / 4;
                int ny = oy + r2 * cellw + cellw / 2 + nf * 35 / 100;
                drawNum(nx, ny, grid[i], -1513232, nf);
            }
            i = i + 1;
        }
        drawNum(pad, score_y, score, -1513232, score_fs);
        k = ui_2d_text(pad, label_y, "得分", -6643536, label_fs, 0);
        if (won == 1) {
            k = ui_2d_text(w / 2, hint_y, "到 2048 了!", -10044566, hint_fs, 1);
        } else if (over == 1) {
            k = ui_2d_text(w / 2, hint_y, "没步了,ESC 重开", -2073552, hint_fs, 1);
        } else {
            k = ui_2d_text(w / 2, hint_y, "方向键或底部按钮滑动", -6643536, hint_fs, 1);
        }
        int btxt_y = btn_y + btn_h / 2 + btn_fs * 35 / 100;
        k = ui_2d_rect(bx0, btn_y, btn_w, btn_h, -14013902, 1, 0, 10);
        k = ui_2d_text(bx0 + btn_w / 2, btxt_y, "左", -1513232, btn_fs, 1);
        k = ui_2d_rect(bx0 + btn_w + btn_gap, btn_y, btn_w, btn_h, -14013902, 1, 0, 10);
        k = ui_2d_text(bx0 + btn_w + btn_gap + btn_w / 2, btxt_y, "上", -1513232, btn_fs, 1);
        k = ui_2d_rect(bx0 + (btn_w + btn_gap) * 2, btn_y, btn_w, btn_h, -14013902, 1, 0, 10);
        k = ui_2d_text(bx0 + (btn_w + btn_gap) * 2 + btn_w / 2, btxt_y, "下", -1513232, btn_fs, 1);
        k = ui_2d_rect(bx0 + (btn_w + btn_gap) * 3, btn_y, btn_w, btn_h, -14013902, 1, 0, 10);
        k = ui_2d_text(bx0 + (btn_w + btn_gap) * 3 + btn_w / 2, btxt_y, "右", -1513232, btn_fs, 1);
        k = ui_2d_present();

        int msg = ui_msg_fetch_wait(0);
        if (msg == 10) { frames = 30000; }
        if (msg == 1) {
            int key = ui_msg_get_a();
            if (key == 27) {
                i = 0;
                while (i < 16) { grid[i] = 0; i = i + 1; }
                score = 0; over = 0; won = 0; frames = 0;
                int p3 = ui_math_rand(16) + 1;
                int n3 = 0;
                i = 0;
                while (i < 16) {
                    if (grid[i] == 0) {
                        n3 = n3 + 1;
                        if (n3 == p3) { grid[i] = 2; }
                    }
                    i = i + 1;
                }
                int p4 = ui_math_rand(16) + 1;
                int n4 = 0;
                i = 0;
                while (i < 16) {
                    if (grid[i] == 0) {
                        n4 = n4 + 1;
                        if (n4 == p4) { grid[i] = 2; }
                    }
                    i = i + 1;
                }
            }
            if (key == 37) { dir = 1; }
            if (key == 39) { dir = 2; }
            if (key == 40) { dir = 3; }
            if (key == 38) { dir = 4; }
        }
        if (msg == 6) {
            int ax2 = ui_msg_get_a();
            int ay2 = ui_msg_get_b();
            if (ay2 >= btn_y) {
                if (ax2 < w / 4) { dir = 1; }
                else if (ax2 < w / 2) { dir = 4; }
                else if (ax2 < w * 3 / 4) { dir = 3; }
                else { dir = 2; }
            }
        }
        if (msg == 9) { frames = frames + 1; }
    }

    k = ui_timer_kill(tid);
    k = ui_scr_set_keep_on(0);
    k = ui_win_close();
}