俄罗斯方块

玩法

上下左右 操作，按住 下 加速，速度会随着分数的提高慢慢边快，后面会快到 ⚡ 闪电侠 都反应不过来的哦；

TIP

无穷无尽

算法

没有太多的算法难点；

使用矩阵方式实现任意形状的方块, 理论上可以任意根据自己的想象力来构建各式各样的方块。

const BLOCKS = [
  [[1, 1, 0], [0, 1, 1]],
  [[1, 1, 1, 1]],
  [[1, 1, 1], [0, 0, 1]],
  [[1, 1, 1], [1, 0, 0]],
  [[1]],
  [[1, 1], [0, 1]],
  [[1, 1], [1, 0]],
  [[1, 1], [1, 1]],
  [[1, 1, 1], [0, 1, 0]]
]

方块消除使用双指针方法：

const clearLines = () => {
  let target = ROW, source = target, cl = 0;
  while (--target >= 0) {
    const line = grids.value[target];
    const needClear = line.every(g => g.status === 2);
    if (needClear) cl++;
    if (!needClear && source > target) continue;
    source = source > target ? target : source;
    while (--source >= 0) {
      const sLine = grids.value[source];
      if (sLine.every(g => g.status === 2)) continue;
      line.forEach((g, i) => g.status = sLine[i].status);
      break;
    }
    if (source < 0) line.forEach(g => g.status = 0);
  }
  score.value += cl * cl * 100;
  clearLineCount.value += cl;
}

源码

vue

<template>
  <div class="tetris flex-horiz flex-center-all">
    <div class="flex-horiz container pos-r">
      <start-over-mask :status="gameStatus" @on-click-start="startGame">
        <span class="font-bold" style="font-size: 20px"> {{ score }} 分</span>
      </start-over-mask>
      <div class="game-container pos-r">
        <div class="grid-row flex-horiz" v-for="row in grids">
          <div
            class="grid border-box"
            v-for="grid in row"
            :class="grid.status !== 0 ? 'active' : ''"
          ></div>
        </div>
      </div>
      <div class="candidate-container ml-sm" style="width: 100px">
        <div class="mb-xs">
          <a-tag>SCORE</a-tag>
        </div>
        <div style="font-size: 26px">{{ score }}</div>
        <div class="mb-xs mt-md">
          <a-tag>NEXT</a-tag>
        </div>
        <div class="game-container disp-ib" v-if="nextBlock">
          <div class="grid-row flex-horiz" v-for="row in nextBlock">
            <div class="grid border-box" v-for="v in row" :class="v ? 'active' : ''"></div>
          </div>
        </div>
      </div>
    </div>
  </div>
</template>

<script lang="ts">
import { computed, defineComponent, ref, onMounted, onBeforeUnmount } from "vue";
import _ from "lodash";
import { getRandomInArray } from "../../utils/array.util";
import { getRandomInteger } from "../../utils/number.util";
import StartOverMask from "../common/start-over-mask.vue";

const ROW = 20,
  COL = 10;

class Grid {
  constructor(row, col) {
    this.row = row;
    this.col = col;
  }

  row: number;
  col: number;
  // 0 没有， 1 占用, 2 已安置
  status: number = 0;
}

const BLOCKS = [
  [
    [1, 1, 0],
    [0, 1, 1],
  ],
  [[1, 1, 1, 1]],
  [
    [1, 1, 1],
    [0, 0, 1],
  ],
  [
    [1, 1, 1],
    [1, 0, 0],
  ],
  [[1]],
  [
    [1, 1],
    [0, 1],
  ],
  [
    [1, 1],
    [1, 0],
  ],
  [
    [1, 1],
    [1, 1],
  ],
  [
    [1, 1, 1],
    [0, 1, 0],
  ],
];

export default defineComponent({
  name: "tetris",
  components: { StartOverMask },
  props: {},
  setup(props: any, ctx: any) {
    const createMap = (): Grid[][] =>
      new Array(ROW)
        .fill(null)
        .map((row, r) => new Array(COL).fill(null).map((_, c) => new Grid(r, c)));
    const grids = ref(createMap());
    // 1 准备开始， 2 游戏中， 3 赢了  4 输了
    const gameStatus = ref(0);
    const rotateBlock = (block, count = 1) => {
      let blk = _.cloneDeep(block),
        res = undefined;
      while (count-- > 0) {
        const r = blk.length,
          c = blk[0].length;
        res = [];
        for (let i = 0; i < c; i++) {
          res[i] = [];
          for (let j = 0; j < r; j++) {
            res[i][j] = blk[r - j - 1][i];
          }
        }
        blk = _.cloneDeep(res);
      }
      return res || blk;
    };

    const refreshBlockPosition = (block, offsetR, offsetC, status = 1) => {
      for (let i = 0; i < block.length; i++) {
        for (let j = 0; j < block[0].length; j++) {
          const [r, w] = [i + offsetR, j + offsetC],
            g = grids.value[r][w];
          if (g.status === 2) continue;
          g.status = block[i][j] ? status : g.status;
        }
      }
    };

    const getCenterOffsetC = block => Math.floor((COL - block[0].length) / 2);

    const getRandomBlock = () =>
      rotateBlock(getRandomInArray(BLOCKS, 1)[0], getRandomInteger(0, 3));

    const blockPosR = ref(0),
      blockPosC = ref(0),
      block = ref(null),
      nextBlock = ref(null),
      score = ref(0),
      clearLineCount = ref(0),
      interval = computed(() => {
        const k = clearLineCount.value / 20;
        return Math.floor(1500 / (k < 1 ? 1 : k));
      });

    let runtimeTimeout = null,
      accON = true;

    const checkCrash = (block, offsetR, offsetC) => {
      for (let i = 0; i < block.length; i++) {
        for (let j = 0; j < block[0].length; j++) {
          const [r, c] = [i + offsetR, j + offsetC];
          if (r < 0 || r >= ROW || c < 0 || c >= COL) return true;
          if (block[i][j] && grids.value[r][c].status === 2) return true;
        }
      }
      return false;
    };

    const startGame = () => {
      score.value = 0;
      clearLineCount.value = 0;
      grids.value = createMap();
      block.value = getRandomBlock();
      nextBlock.value = getRandomBlock();
      gameStatus.value = 2;
      blockPosR.value = -1;
      blockPosC.value = getCenterOffsetC(block.value);
      runtimeMain();
    };

    const runtimeMain = () => {
      clearTimeout(runtimeTimeout);
      if (gameStatus.value !== 2) return;
      if (blockPosR.value >= 0)
        refreshBlockPosition(block.value, blockPosR.value, blockPosC.value, 0);
      blockPosR.value++;
      if (checkCrash(block.value, blockPosR.value, blockPosC.value)) {
        refreshBlockPosition(block.value, blockPosR.value - 1, blockPosC.value, 2);
        if (blockPosR.value <= 1) {
          return (gameStatus.value = 3);
        }
        block.value = nextBlock.value;
        nextBlock.value = getRandomBlock();
        blockPosR.value = 0;
        blockPosC.value = getCenterOffsetC(block.value);
        clearLines();
        accON = false;
      }
      refreshBlockPosition(block.value, blockPosR.value, blockPosC.value, 1);
      runtimeTimeout = setTimeout(runtimeMain, interval.value);
    };

    const clearLines = () => {
      let target = ROW,
        source = target,
        cl = 0;
      while (--target >= 0) {
        const line = grids.value[target];
        const needClear = line.every(g => g.status === 2);
        if (needClear) cl++;
        if (!needClear && source > target) continue;
        source = source > target ? target : source;
        while (--source >= 0) {
          const sLine = grids.value[source];
          if (sLine.every(g => g.status === 2)) continue;
          line.forEach((g, i) => (g.status = sLine[i].status));
          break;
        }
        if (source < 0) line.forEach(g => (g.status = 0));
      }
      score.value += cl * cl * 100;
      clearLineCount.value += cl;
    };

    onMounted(() => {
      window.addEventListener("keydown", onKeyDown);
      window.addEventListener("keyup", onKeyUp);
    });

    onBeforeUnmount(() => {
      window.removeEventListener("keydown", onKeyDown);
      window.removeEventListener("keyup", onKeyUp);
      clearTimeout(runtimeTimeout);
    });

    const onKeyDown = e => {
      e.preventDefault();
      const kc = e.keyCode;
      if (gameStatus.value !== 2) return;
      if (kc < 37 || kc > 40) return;
      [() => onMoveBlock(-1), onRotateBlock, () => onMoveBlock(1), () => accON && runtimeMain()][
        kc - 37
      ]();
    };

    const onKeyUp = e => (accON = true);

    const onMoveBlock = move => {
      const newPos = blockPosC.value + move;
      if (checkCrash(block.value, blockPosR.value, newPos)) return;
      refreshBlockPosition(block.value, blockPosR.value, blockPosC.value, 0);
      blockPosC.value += move;
      refreshBlockPosition(block.value, blockPosR.value, blockPosC.value, 1);
    };

    const onRotateBlock = () => {
      const nb = rotateBlock(block.value);
      let npc = blockPosC.value + nb[0].length - 1;
      npc = npc >= COL ? COL - nb[0].length : blockPosC.value;
      if (checkCrash(nb, blockPosR.value, npc)) return;
      refreshBlockPosition(block.value, blockPosR.value, blockPosC.value, 0);
      block.value = nb;
      blockPosC.value = npc;
      refreshBlockPosition(block.value, blockPosR.value, blockPosC.value, 1);
    };

    return {
      ROW,
      COL,
      grids,
      nextBlock,
      gameStatus,
      score,

      startGame,
    };
  },
});
</script>

<style lang="less" scoped>
.tetris {
}

.game-container {
  border: 4px solid #b4b4b4;
  padding: 1.5px;
}

.grid {
  @size: 20px;
  height: @size;
  width: @size;
  background-color: #f5f5f5;
  margin: 0.5px;

  &.active {
    background-color: #575757;
  }
}
</style>

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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292

俄罗斯方块 ​

玩法 ​

算法 ​

源码 ​

俄罗斯方块

玩法

算法

源码