四川省二角ルートでつながるペアの牌を消していくゲーム


  view source
  JavaScript
  ?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190 //https://codepen.io/nagtkk/pen/RwwpKmj
//https://qiita.com/nagtkk/items/ba720840328185e2cb91
 
//アルゴリズムと記法の勉強
 
document.title = '四川省 二角ルートでつながるペアの牌を消していくゲーム';
 
$(function(){
  $('#demo').after($('#rule'));
});
 
const seOK = new Audio('/mp3/ok.mp3');
const seMiss = new Audio('/mp3/miss.mp3');
const seLose = new Audio('/mp3/lose.mp3');
const seClear = new Audio('/mp3/clear.mp3');
 
const { min, max, floor, ceil, random } = Math;
const pick = a => a.splice(a.length * random(), 1)[0];
const range = (start, stop, step) => {
    if (stop === undefined) {
        stop = start;
        start = 0;
    }
    step = step || (stop < start ? -1 : 1);
    const length = max(0, ceil((stop - start) / step));
    return Array.from({ length }, (_, i) => start + step * i);
};
 
const N = 17 * 8;
const W = 17 + 4;
const H = 8 + 4;
 
const X = p => p % W;
const Y = p => floor(p / W);
const fromXY = (x, y) => x + y * W;
const fromYX = (y, x) => fromXY(x, y);
 
const create = () => {
    const tiles = range(N).map(i => 1 + floor(i / 4));
    const board = range(W * H).map(p => {
        const d = min(X(p), Y(p), W - 1 - X(p), H - 1 - Y(p));
        return d === 0 ? -1 : d === 1 ? 0 : pick(tiles);
    });
    return { board, target: -1, rest: N };
};
const update = (state, p) => {
    const { board, target, rest } = state;
    if (board[p] <= 0) {return state;}
    if (target < 0) return { ...state, target: p };
    if (!test(board, target, p)) {seMiss.play();return { ...state, target: -1 };}
    seOK.currentTime = 0;
    seOK.play();
    return {
        board: board.map((v, i) => i === p || i === target ? 0 : v),
        target: -1,
        rest: rest - 2
    };
};
 
const move = (board, p, d) => board[p + d] ? p : move(board, p + d, d);
const pass = (board, p, q, U, V, C) => {
    const e = C(1, 0);
    const u0 = max(U(move(board, p, -e)), U(move(board, q, -e)));
    const u1 = min(U(move(board, p, +e)), U(move(board, q, +e)));
    const v0 = min(V(p), V(q)) + 1;
    const v1 = max(V(p), V(q)) - 1;
    const us = range(u0, u1 + 1, 1);
    const vs = range(v0, v1 + 1, 1);
    return us.some(u => vs.every(v => board[C(u, v)] === 0));
};
const test = (board, p, q) =>
    p !== q && board[p] === board[q] && (
        pass(board, p, q, X, Y, fromXY) ||
        pass(board, p, q, Y, X, fromYX)
    );
 
const solve = state => {
    while (state.rest) {
        const pair = findPair(state.board);
        if (!pair) return false;
        state = update(state, pair[0]);
        state = update(state, pair[1]);
    }
    return true;
};
const findPair = board => {
    const pairs = {};
    for (const [p, v] of board.entries()) {
        if (v <= 0) {
            continue;
        }
        if (!pairs[v]) {
            pairs[v] = [p];
            continue;
        }
        for (const q of pairs[v]) {
            if (test(board, p, q)) {
                return [p, q];
            }
        }
        pairs[v].push(p);
    }
};
 
/*
const tileChar = v =>
    v < 1 ? '' :
    v < 8 ? '東南西北中發　'[v - 1] :
    v < 17 ? '一二三四五六七八九'[v - 8] :
    //v < 26 ? String.fromCharCode(0x2160 + v - 17) :
    v < 26 ? '123456789'[v  - 17] :
    'ABCDEFGHI'[v - 26];
    //String.fromCharCode(0x2460 + v - 26);
*/
const tileChar = v =>
    v < 1 ? '' :
    v < 8 ? '●○★◆◇■□'[v - 1] :
    v < 17 ? 'abcdefxyz'[v - 8] :
    v < 26 ? '123456789'[v  - 17] :
    'ABCDEFXYZ'[v - 26];
 
const tileColor = v =>
    v < 1 ? 'c-x' :
    v < 8 ? 'c-r' :
    v < 17 ?  'c-b' :
    v < 26 ? 'c-g' :
    'c-y';
 
const main = async () => {
 
    const demo = document.getElementById('demo');
    const message = document.createElement('p');
    demo.appendChild(message);
    message.innerHTML = 'generate...';
   
    let state = create();
    while (!solve(state)) {
        await new Promise(f => requestAnimationFrame(f));
        state = create();
    }
   
    const view = document.createElement('div');
    view.classList.add('board');
    demo.appendChild(view);
    const cells = range(H).flatMap(y => {
        const row = document.createElement('div');
        view.appendChild(row);
        return range(W).map(x => {
            const cell = document.createElement('a');
            row.appendChild(cell);
            cell.onclick = _ => render(state = update(state, fromXY(x, y)));
            return cell;
        });
    });
   
    let prevRest = 0;
    const render = ({ board, target, rest }) => {
        range(W * H).forEach(p => {
            const value = board[p];
            const cell = cells[p];
            const list = cell.classList;
            cell.innerHTML = tileChar(value);
            list.add(tileColor(value));
 
            list.remove('none', 'wall', 'selected');
            if (value === 0) {
                list.add('none');
            } else if (value < 0) {
                list.add('wall');
            } else if(target === p) {
                list.add('selected');
            }
        });
        if (prevRest !== rest) {
            prevRest = rest;
            if (!rest) {
                message.innerHTML = 'clear!';
                seClear.play();
            } else if (!findPair(board)) {
                message.innerHTML = 'game over';
                seLose.play();
            } else {
                message.innerHTML = rest;
            }
        }
    };
    render(state);
};
 
main();
  CSS
  ?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69 @font-face {
    font-family: 'Anton';
    src: url(Anton-Regular.ttf);
}
 
#demo{
    font-family:Anton;
}
#demo *{
  box-sizing:border-box;
}
#demo p {
    text-align: center;
    font-size:24px;
    margin: 0;
}
.board {
    display: table;
    margin: 0 auto;
    border-spacing: 2px;
    width: fit-content;
    font-weight: bold;
    font-family: 'メイリオ',Meiryo,'ＭＳ Ｐゴシック',sans-serif;
}
.board > div {
    display: table-row;
}
.board > div:nth-child(1),
.board > div:nth-child(12) {
    display: none;
}
.board > div > a {
    display: table-cell;
    vertical-align: middle;
    border-radius: 4px;
    height: 4.0em;
    width: 3em;
    border: 2px solid black;
    font-weight: bold;
    text-align: center;
    cursor: default;
    user-select: none;
}
.board > div > a.wall {
    background: black;
    visibility: hidden;
}
.board > div > a.none {
    visibility: hidden;
}
.board > div > a:hover {
    border: 2px solid #999;
}
.board > div > a.selected {
    border: 2px solid #f00;
}
 
.c-r{
  background:hsl(0deg 0% 100%);
}
.c-b{
  background:hsl(90deg 0% 85%);
}
.c-g{
  background:hsl(180deg 0% 70%);
}
.c-y{
  background:hsl(270deg 0% 55%);
}
  HTML
  
    ページのソースを表示 : Ctrl+U , DevTools : F12
    view-source:https://hi0a.com/demo/-js/js-game-mahjong-shisensho/
  
  ABOUT
  
    hi0a.com 「ひまアプリ」は無料で遊べるミニゲームや便利ツールを公開しています。
    プログラミング言語の動作デモやWEBデザイン、ソースコード、フロントエンド等の開発者のための技術を公開しています。
    必要な機能の関数をコピペ利用したり勉強に活用できます。
    プログラムの動作サンプル結果は画面上部に出力表示されています。
    環境:最新のブラウザ GoogleChrome / Windows / Android / iPhone 等の端末で動作確認しています。
    画像素材や音素材は半分自作でフリー素材配布サイトも利用しています。LINK参照。
    動く便利なものが好きなだけで技術自体に興味はないのでコードは汚いです。
    途中放置や実験状態、仕様変更、API廃止等で動かないページもあります。