DIV CSS 佈局教程網

使用純 JavaScript 實作經典掃雷遊戲
編輯:關於JavaScript     

很久以前寫的,當時都沒寫註解,這幾天補上了(結果很多自己都要想一下才看懂)。

不足之處有兩點:原本想加一個遊戲排名的統計,等有空的時候再補(好像每次都這麼說,然後就等很久);另外尚未實作「點擊第一格不會是雷」這個常見的貼心設計。

<style>
ul{padding:0;list-style:none;}
#mine{overflow:hidden;border:1px solid #966;}
#mine li{float:left;width:30px;height:30px;line-height:30px;text-align:center;
         font-size:14px;color:#222;}
#mine .mine_01{background:url(mine.gif) no-repeat;}
#mine .mine_02{background:url(mine.gif) -30px 0 no-repeat;}
#mine .mine_03{background:url(mine.gif) -60px 0 no-repeat;}
#mine .mine_04{background:url(mine.gif) -90px 0 no-repeat;}
#mine .mine_05{background:url(mine.gif) -120px 0 no-repeat;}
#mine .mine_06{background:url(mine.gif) -150px 0 no-repeat;}
#mine .mine_07{background:url(mine.gif) -180px 0 no-repeat;}
#count{font-size:12px;}
#time{color:#900;font-weight:bold;}
</style>>

<select id="wh">
  <option value="8*10">8*10</option>
  <option value="10*10">10*10</option>
  <option value="12*12">12*12</option>
</select>
<button id="ready">重新開始</button>
<div id="count">計時:<span id="time">0</span></div>
<ul id="mine"></ul>

<script>
var $ = function (id) { return document.getElementById(id); };

window.onload = function ready() {
    var V = $('wh').value.split('*');
    setMineField(Number(V[0]), Number(V[1]));
    $('wh').onchange = $('ready').onclick = function () {
        V = $('wh').value.split('*');
        setMineField(Number(V[0]), Number(V[1]));
    };
};

// --------------------------------------------------- 雷區狀態
var mineField = {
    _mineW: 30,             // 每一格的寬度,必須與樣式同步
    _mineH: 30,
    _mineFieldBlock: $('mine'),
    _mineFieldEle: $('mine').getElementsByTagName('li'),
    _time: $('time'),
    status: 0,              // 0 尚未開始、1 進行中、2 結束
    mineNum: 0,             // 雷數
    clearPlace: 0,          // 已掃開的格子數
    x: 0,                   // 列
    y: 0,                   // 行
    density: 0.2,           // 雷的密度,不宜超過 0.5
    mineMap: [],            // 雷區二維(一維)圖:-1 為雷,0 以上為周圍雷數
    time: -1,
    debug: false            // 除錯模式,直接顯示地圖
};

function timedCount() {
    if (mineField.status != 1) { return false; }
    mineField.time++;
    mineField._time.innerHTML = mineField.time;
    setTimeout(timedCount, 1000);
}

// -------------------------------------- 設定單一格的狀態
function setThisMine(str, index) {
    var allMine = mineField._mineFieldEle;

    // 插旗/取消插旗
    if (str == 'setOn') {
        var thisMine = allMine[index];
        thisMine.on = thisMine.on < 2 ? thisMine.on + 1 : 0;
        if (thisMine.on == 1)      { thisMine.className = 'mine_03'; } // 插旗
        else if (thisMine.on == 2) { thisMine.className = 'mine_04'; } // 問號
        else if (thisMine.on == 0) { thisMine.className = 'mine_01'; } // 復原
        return false;
    }

    // 顯示格子
    if (str == 'show') {
        if (Object.prototype.toString.call(index) === '[object Array]') {
            // 一次顯示一大片
            mineField.clearPlace = mineField.clearPlace + index.length;
            for (var i = 0; i < index.length; i++) {
                var thisMine = allMine[index[i]];
                thisMine.innerHTML = mineField.mineMap[thisMine.index];
                thisMine.className = 'mine_02';
                thisMine.on = 3;
            }
        } else {
            // 顯示單格(非雷)
            mineField.clearPlace++;
            allMine[index].on = 3;
            allMine[index].innerHTML = mineField.mineMap[index];
            allMine[index].className = 'mine_02';
        }
        // 全部掃完,獲勝
        if (mineField.clearPlace == mineField.x * mineField.y - mineField.mineNum) {
            alert('恭喜你過關了!');
            for (var i = 0; i < allMine.length; i++) {
                if (mineField.mineMap[allMine[i].index] == -1) {
                    allMine[i].className = 'mine_07';
                }
            }
            mineField.status = 2;
            return false;
        }
    }

    // 踩雷,顯示所有雷
    if (str == 'peng') {
        for (var i = 0; i < allMine.length; i++) {
            if (mineField.mineMap[allMine[i].index] == -1) {
                allMine[i].className = (i == index) ? 'mine_06' : 'mine_05';
            }
        }
        mineField.status = 2;
    }
}

// ------------------------------------------ 建立雷區
function setMineField(a, b) {
    var thisMineFielde = mineField._mineFieldBlock;
    var DivBox = document.createElement("div"), num = a * b, k = 0;
    thisMineFielde.innerHTML = '';

    mineField.x = a;
    mineField.y = b;
    mineField.mineNum = Math.floor(a * b * mineField.density);
    mineField.status = 0;
    mineField.time = -1;
    mineField.clearPlace = 0;
    mineField.mineMap.length = 0;
    mineField._time.innerHTML = 0;

    setMineMap();   // 先生成地圖

    while (k < num) {
        var newLi = document.createElement("li");
        if (mineField.debug) newLi.innerHTML = mineField.mineMap[k]; // 作弊用
        newLi.className = 'mine_01';
        DivBox.appendChild(newLi);
        k++;
    }
    thisMineFielde.style.height = mineField._mineW * b + 'px';
    thisMineFielde.style.width = mineField._mineH * a + 'px';
    thisMineFielde.innerHTML = DivBox.innerHTML;
    DivBox = null;
    setEvent();
}

// -------------------------------------- 生成雷區地圖
function setMineMap() {
    var num = mineField.x * mineField.y,
        mineNum = mineField.mineNum,
        Interval = Math.floor(num / mineNum);

    // 先等距布雷,再打亂
    for (var i = 0; i < num; i++) {
        mineField.mineMap[i] = (i % Interval == 0 && i < mineNum * Interval) ? -1 : 0;
    }
    mineField.mineMap.sort(function () { return 0.5 - Math.random(); });

    // 檢查是否出現「整格都是雷」的區塊,若是則重新生成
    var br = 0, x = mineField.x, L_T, T, R_T, L, R, L_B, B, R_B;
    for (var i = 0; i < num; i++) {
        br = Math.ceil((i + 1) / x);
        L_T = i - x - 1; T = i - x; R_T = i - x + 1;
        L = i - 1; R = i + 1;
        L_B = i + x - 1; B = i + x; R_B = i + x + 1;

        if (L_T >= 0 && Math.ceil((L_T+1)/x) == br-1 && mineField.mineMap[L_T] == 0) continue;
        if (T   >= 0 && Math.ceil((T+1)/x)   == br-1 && mineField.mineMap[T]   == 0) continue;
        if (R_T >= 0 && Math.ceil((R_T+1)/x) == br-1 && mineField.mineMap[R_T] == 0) continue;
        if (L >= 0 && Math.ceil((L+1)/x) == br && mineField.mineMap[L] == 0) continue;
        if (R < num && Math.ceil((R+1)/x) == br && mineField.mineMap[R] == 0) continue;
        if (L_B < num && Math.ceil((L_B+1)/x) == br+1 && mineField.mineMap[L_B] == 0) continue;
        if (B < num && Math.ceil((B+1)/x) == br+1 && mineField.mineMap[B] == 0) continue;
        if (R_B < num && Math.ceil((R_B+1)/x) == br+1 && mineField.mineMap[R_B] == 0) continue;

        setMineMap();   // 全部不行,重來
        return false;
    }

    // 統計非雷格周圍的雷數
    for (i = 0; i < num; i++) {
        if (mineField.mineMap[i] == -1) continue;
        var thisMineNum = 0;
        br = Math.ceil((i + 1) / x);
        L_T = i - x - 1; T = i - x; R_T = i - x + 1;
        L = i - 1; R = i + 1;
        L_B = i + x - 1; B = i + x; R_B = i + x + 1;

        if (L_T >= 0 && Math.ceil((L_T+1)/x) == br-1 && mineField.mineMap[L_T] == -1) thisMineNum++;
        if (T   >= 0 && Math.ceil((T+1)/x)   == br-1 && mineField.mineMap[T]   == -1) thisMineNum++;
        if (R_T >= 0 && Math.ceil((R_T+1)/x) == br-1 && mineField.mineMap[R_T] == -1) thisMineNum++;
        if (L >= 0 && Math.ceil((L+1)/x) == br && mineField.mineMap[L] == -1) thisMineNum++;
        if (R < num && Math.ceil((R+1)/x) == br && mineField.mineMap[R] == -1) thisMineNum++;
        if (L_B < num && Math.ceil((L_B+1)/x) == br+1 && mineField.mineMap[L_B] == -1) thisMineNum++;
        if (B < num && Math.ceil((B+1)/x) == br+1 && mineField.mineMap[B] == -1) thisMineNum++;
        if (R_B < num && Math.ceil((R_B+1)/x) == br+1 && mineField.mineMap[R_B] == -1) thisMineNum++;

        mineField.mineMap[i] = thisMineNum;
    }
}

// -------------------------------------- 雷區事件
function setEvent() {
    var thisMineFielde = mineField._mineFieldBlock,
        allMine = mineField._mineFieldEle,
        iMax = mineField.x * mineField.y;

    for (var i = 0; i < iMax; i++) {
        allMine[i].index = i;
        allMine[i].on = 0;   // 0 預設、1 插旗、2 問號、3 已顯示
    }

    thisMineFielde.onmouseup = function (e) {
        if (mineField.status == 2) { return false; }
        if (mineField.status == 0) { mineField.status = 1; timedCount(); }

        var e = e || window.event, thisObj = e.target || e.srcElement;
        if (thisObj.nodeName == 'UL' || thisObj.on == 3) { return false; }

        var Btn = getButton(e);
        if (Btn == 0) {           // 左鍵
            if (thisObj.on == 1) { return false; }   // 插旗了不能點
            if (mineField.mineMap[thisObj.index] == -1) {
                setThisMine('peng', thisObj.index);          // 踩雷
            } else if (mineField.mineMap[thisObj.index] == 0) {
                setThisMine('show', minesShow(thisObj.index)); // 空地,展開一大片
            } else {
                setThisMine('show', thisObj.index);           // 顯示單格
            }
        }
        if (Btn == 2) { setThisMine('setOn', thisObj.index); } // 右鍵插旗
    };
}

// -------------------------------- 踩到空地時展開一大片
function minesShow(I) {
    var allMine = mineField._mineFieldEle, allShowMine = [I];
    allMine[I].on = 3;

    see(I);

    function see(allI) {
        var _allI = [];
        if (Object.prototype.toString.call(allI) === '[object Array]') {
            for (var i = 0; i < allI.length; i++) { f(allI[i]); }
        } else { f(allI); }

        function f(thisI) {
            var text = '_' + allShowMine.join('_') + '_';  // 用來判斷是否已寫入
            var x = mineField.x, br, num = x * mineField.y,
                L_T, T, R_T, L, R, L_B, B, R_B;
            br = Math.ceil((thisI + 1) / x);
            L_T = thisI - x - 1; T = thisI - x; R_T = thisI - x + 1;
            L = thisI - 1; R = thisI + 1;
            L_B = thisI + x - 1; B = thisI + x; R_B = thisI + x + 1;

            // 第一階段:找出周圍尚未翻開且為空格的格子,排入下一輪搜尋
            if (L_T >= 0 && Math.ceil((L_T+1)/x) == br-1 && allMine[L_T].on == 0 && mineField.mineMap[L_T] == 0) _allI.push(L_T);
            if (T   >= 0 && Math.ceil((T+1)/x)   == br-1 && allMine[T].on   == 0 && mineField.mineMap[T]   == 0) _allI.push(T);
            if (R_T >= 0 && Math.ceil((R_T+1)/x) == br-1 && allMine[R_T].on == 0 && mineField.mineMap[R_T] == 0) _allI.push(R_T);
            if (L >= 0 && Math.ceil((L+1)/x) == br && allMine[L].on == 0 && mineField.mineMap[L] == 0) _allI.push(L);
            if (R < num && Math.ceil((R+1)/x) == br && allMine[R].on == 0 && mineField.mineMap[R] == 0) _allI.push(R);
            if (L_B < num && Math.ceil((L_B+1)/x) == br+1 && allMine[L_B].on == 0 && mineField.mineMap[L_B] == 0) _allI.push(L_B);
            if (B < num && Math.ceil((B+1)/x) == br+1 && allMine[B].on == 0 && mineField.mineMap[B] == 0) _allI.push(B);
            if (R_B < num && Math.ceil((R_B+1)/x) == br+1 && allMine[R_B].on == 0 && mineField.mineMap[R_B] == 0) _allI.push(R_B);

            // 第二階段:把周圍格子標記為已翻開並納入結果
            if (L_T >= 0 && Math.ceil((L_T+1)/x) == br-1 && allMine[L_T].on == 0 && text.indexOf('_'+L_T+'_') == -1) { allShowMine.push(L_T); allMine[L_T].on = 3; }
            if (T   >= 0 && Math.ceil((T+1)/x)   == br-1 && allMine[T].on   == 0 && text.indexOf('_'+T+'_')   == -1) { allShowMine.push(T);   allMine[T].on   = 3; }
            if (R_T >= 0 && Math.ceil((R_T+1)/x) == br-1 && allMine[R_T].on == 0 && text.indexOf('_'+R_T+'_') == -1) { allShowMine.push(R_T); allMine[R_T].on = 3; }
            if (L >= 0 && Math.ceil((L+1)/x) == br && allMine[L].on == 0 && text.indexOf('_'+L+'_') == -1) { allShowMine.push(L); allMine[L].on = 3; }
            if (R < num && Math.ceil((R+1)/x) == br && allMine[R].on == 0 && text.indexOf('_'+R+'_') == -1) { allShowMine.push(R); allMine[R].on = 3; }
            if (L_B < num && Math.ceil((L_B+1)/x) == br+1 && allMine[L_B].on == 0 && text.indexOf('_'+L_B+'_') == -1) { allShowMine.push(L_B); allMine[L_B].on = 3; }
            if (B < num && Math.ceil((B+1)/x) == br+1 && allMine[B].on == 0 && text.indexOf('_'+B+'_') == -1) { allShowMine.push(B); allMine[B].on = 3; }
            if (R_B < num && Math.ceil((R_B+1)/x) == br+1 && allMine[R_B].on == 0 && text.indexOf('_'+R_B+'_') == -1) { allShowMine.push(R_B); allMine[R_B].on = 3; }

            if (_allI.length != 0) { see(_allI); }
        }
    }
    return allShowMine;
}

// --------------------------------------
document.oncontextmenu = function () { return false; };  // 禁用右鍵選單

function getButton(e) {
    var Btn;
    if (document.implementation.hasFeature('MouseEvents', '2.0')) {
        Btn = e.button;
    } else {
        switch (e.button) {
            case 0: case 1: case 3: case 5: case 7: Btn = 0; break;  // 左鍵
            case 2: case 6: Btn = 2; break;                         // 右鍵
            case 4: Btn = 9; break;                                 // 中鍵
        }
    }
    return Btn;
}
</script>

幾個實作上的觀察

整個雷區用一維陣列 mineMap 表示,靠 br = Math.ceil((i + 1) / x) 判斷目前在第幾列,再逐一檢查八個鄰居是否越界(同一列、上一列、下一列)——這是二維棋盤攤平成一維後最直白的處理方式。

布雷採「先等距分配、再用 sort 隨機打亂」的策略,然後檢查是否出現周圍皆為雷的格子,若有就整批重來。這裡有個效能隱憂:sort(function(){ return 0.5 - Math.random(); }) 並不是均勻的洗牌演算法,且遞迴重試在最壞情況下可能堆疊很多層。改用 Fisher-Yates 洗牌會更公平也更快。

另外,minesShow 用「把已處理的索引用底線串成字串再 indexOf」的方式去重,邏輯正確但代價不低;改用 Object.create(null) 或 Set 當雜湊表會直觀得多。而作者自己指出的「第一點不會是雷」,最簡潔的解法是:在第一次點擊之後才布雷,並把該點及其八個鄰居排除在候選之外。

XML學習教程| jQuery入門知識| AJAX入門| Dreamweaver教程| Fireworks入門知識| SEO技巧| SEO優化集錦|
Copyright © DIV+CSS佈局教程網 All Rights Reserved