diff --git a/calc.js b/calc.js
index dee668f..b4dc1e0 100644
--- a/calc.js
+++ b/calc.js
@@ -1,233 +1,218 @@
-const blocks = [
-  [
-    [
-      [1, 1],
-      [1, 1]
-    ]
-  ],
-  [
-    [
-      [2, 2, 2, 2]
-    ],
-    [
-      [2],
-      [2],
-      [2],
-      [2]
-    ]
-  ],
-  [
-    [
-      [3, 3, 0],
-      [0, 3, 3]
-    ],
-    [
-      [0, 3],
-      [3, 3],
-      [3, 0]
-    ]
-  ],
-  [
-    [
-      [0, 4, 4],
-      [4, 4, 0]
-    ],
-    [
-      [4, 0],
-      [4, 4],
-      [0, 4]
-    ]
-  ],
-  [
-    [
-      [5, 0, 0],
-      [5, 5, 5]
-    ],
-    [
-      [5, 5],
-      [5, 0],
-      [5, 0]
-    ],
-    [
-      [5, 5, 5],
-      [0, 0, 5]
-    ],
-    [
-      [0, 5],
-      [0, 5],
-      [5, 5]
-    ]
-  ],
-  [
-    [
-      [0, 0, 6],
-      [6, 6, 6]
-    ],
-    [
-      [6, 6],
-      [0, 6],
-      [0, 6]
-    ],
-    [
-      [6, 6, 6],
-      [6, 0, 0]
-    ],
-    [
-      [6, 0],
-      [6, 0],
-      [6, 6]
-    ]
-  ],
-  [
-    [
-      [0, 7, 0],
-      [7, 7, 7]
-    ],
-    [
-      [7, 7, 7],
-      [0, 7, 0]
-    ],
-    [
-      [7, 0],
-      [7, 7],
-      [7, 0]
-    ],
-    [
-      [0, 7],
-      [7, 7],
-      [0, 7]
-    ]
-  ],
-  [
-    [
-      [0, 8, 0],
-      [8, 8, 8],
-      [0, 8, 0]
-    ]
-  ],
-  [
-    [
-      [9]
-    ]
-  ],
-  [
-    [
-      [10, 10]
-    ],
-    [
-      [10],
-      [10]
-    ]
-  ],
-  [
-    [
-      [11, 11],
-      [11, 0],
-    ],
-    [
-      [11, 11],
-      [0, 11],
-    ],
-    [
-      [0, 11],
-      [11, 11],
-    ],
-    [
-      [11, 0],
-      [11, 11],
-    ],
-  ]
-];
-
-let m, n, a, l, res;
-
-function Solve(arr, num) {
-  res = [];
-  m = arr.length;
-  n = arr[0].length;
-
-  a = new Array(m);
-  for (let i = 0; i < m; ++i) {
-    a[i] = arr[i].map(x => x);
-  }
-
-  l = num.map(x => x);
-
-  dfs(0);
-
-  // Sort res by the number of distinct elements in each matrix, in descending order
-  // If the number of distinct elements is the same, sort by the highest number in l for each element used in A and B
-  res.sort((A, B) => {
-    let distinctA = new Set(A.flat()).size;
-    let distinctB = new Set(B.flat()).size;
-
-    if (distinctA !== distinctB) {
-      return distinctB - distinctA;
-    } else {
-      let maxA = Math.max(...A.flat().map(x => l[x-1]));
-      let maxB = Math.max(...B.flat().map(x => l[x-1]));
-      return maxB - maxA;
-    }
-  });
-
-  return res;
-}
-
-function canPlaceBlock(x, y, b, d) {
-  const pat = blocks[b][d];
-  let offset = 0;
-  while (!pat[0][offset]) ++offset;
-  y -= offset;
-  if (y < 0) return false;
-  for (let i = 0; i < pat.length; ++i) {
-    for (let j = 0; j < pat[0].length; ++j) {
-      if (pat[i][j] && (x + i >= m || y + j >= n || a[x + i][y + j] !== -1)) return false;
-    }
-  }
-  return true;
-}
-
-function placeBlock(x, y, b, d, v) {
-  const pat = blocks[b][d];
-  let offset = 0;
-  while (!pat[0][offset]) ++offset;
-  y -= offset;
-  for (let i = 0; i < pat.length; ++i) {
-    for (let j = 0; j < pat[0].length; ++j) {
-      if (pat[i][j]) a[x + i][y + j] = v;
-    }
-  }
-}
-
-function dfs(p) {
-  if (p === m * n) {
-    const x = new Array(m);
-    for (let i = 0; i < m; ++i) {
-      x[i] = a[i].map(x => x);
-    }
-    res.push(x);
-    if (res.length >= 10000) {
-      alert('方案数太多，仅计算前一万种。减少一些方块吧~');
-      return true;
-    }
-    return false;
-  }
-  const x = Math.floor(p / n), y = p % n;
-  if (a[x][y] !== -1) {
-    if (dfs(p + 1)) return true;
-    return false;
-  }
-  for (let b = 0; b < blocks.length; ++b) {
-    if (!l[b]) continue;
-    for (let d = 0; d < blocks[b].length; ++d) {
-      if (!canPlaceBlock(x, y, b, d)) continue;
-      placeBlock(x, y, b, d, b + 1);
-      --l[b];
-      if (dfs(p + 1)) return true;
-      ++l[b];
-      placeBlock(x, y, b, d, -1);
-    }
-  }
-  return false;
-}
-
+const blocks = [
+  [
+    [
+      [1, 1],
+      [1, 1]
+    ]
+  ],
+  [
+    [
+      [2, 2, 2, 2]
+    ],
+    [
+      [2],
+      [2],
+      [2],
+      [2]
+    ]
+  ],
+  [
+    [
+      [3, 3, 0],
+      [0, 3, 3]
+    ],
+    [
+      [0, 3],
+      [3, 3],
+      [3, 0]
+    ]
+  ],
+  [
+    [
+      [0, 4, 4],
+      [4, 4, 0]
+    ],
+    [
+      [4, 0],
+      [4, 4],
+      [0, 4]
+    ]
+  ],
+  [
+    [
+      [5, 0, 0],
+      [5, 5, 5]
+    ],
+    [
+      [5, 5],
+      [5, 0],
+      [5, 0]
+    ],
+    [
+      [5, 5, 5],
+      [0, 0, 5]
+    ],
+    [
+      [0, 5],
+      [0, 5],
+      [5, 5]
+    ]
+  ],
+  [
+    [
+      [0, 0, 6],
+      [6, 6, 6]
+    ],
+    [
+      [6, 6],
+      [0, 6],
+      [0, 6]
+    ],
+    [
+      [6, 6, 6],
+      [6, 0, 0]
+    ],
+    [
+      [6, 0],
+      [6, 0],
+      [6, 6]
+    ]
+  ],
+  [
+    [
+      [0, 7, 0],
+      [7, 7, 7]
+    ],
+    [
+      [7, 7, 7],
+      [0, 7, 0]
+    ],
+    [
+      [7, 0],
+      [7, 7],
+      [7, 0]
+    ],
+    [
+      [0, 7],
+      [7, 7],
+      [0, 7]
+    ]
+  ],
+  [
+    [
+      [0, 8, 0],
+      [8, 8, 8],
+      [0, 8, 0]
+    ]
+  ],
+  [
+    [
+      [9]
+    ]
+  ],
+  [
+    [
+      [10, 10]
+    ],
+    [
+      [10],
+      [10]
+    ]
+  ],
+  [
+    [
+      [11, 11],
+      [11, 0],
+    ],
+    [
+      [11, 11],
+      [0, 11],
+    ],
+    [
+      [0, 11],
+      [11, 11],
+    ],
+    [
+      [11, 0],
+      [11, 11],
+    ],
+  ]
+];
+
+let m, n, a, l, res;
+
+function Solve(arr, num) {
+  res = [];
+  m = arr.length;
+  n = arr[0].length;
+
+  a = new Array(m);
+  for (let i = 0; i < m; ++i) {
+    a[i] = arr[i].map(x => x);
+  }
+
+  l = num.map(x => x);
+
+  dfs(0);
+
+  return res;
+}
+
+function canPlaceBlock(x, y, b, d) {
+  const pat = blocks[b][d];
+  let offset = 0;
+  while (!pat[0][offset]) ++offset;
+  y -= offset;
+  if (y < 0) return false;
+  for (let i = 0; i < pat.length; ++i) {
+    for (let j = 0; j < pat[0].length; ++j) {
+      if (pat[i][j] && (x + i >= m || y + j >= n || a[x + i][y + j] !== -1)) return false;
+    }
+  }
+  return true;
+}
+
+function placeBlock(x, y, b, d, v) {
+  const pat = blocks[b][d];
+  let offset = 0;
+  while (!pat[0][offset]) ++offset;
+  y -= offset;
+  for (let i = 0; i < pat.length; ++i) {
+    for (let j = 0; j < pat[0].length; ++j) {
+      if (pat[i][j]) a[x + i][y + j] = v;
+    }
+  }
+}
+
+function dfs(p) {
+  if (p === m * n) {
+    const x = new Array(m);
+    for (let i = 0; i < m; ++i) {
+      x[i] = a[i].map(x => x);
+    }
+    res.push(x);
+    if (res.length >= 10000) {
+      alert('方案数太多，仅计算前一万种。减少一些方块吧~');
+      return true;
+    }
+    return false;
+  }
+  const x = Math.floor(p / n), y = p % n;
+  if (a[x][y] !== -1) {
+    if (dfs(p + 1)) return true;
+    return false;
+  }
+  for (let b = 0; b < blocks.length; ++b) {
+    if (!l[b]) continue;
+    for (let d = 0; d < blocks[b].length; ++d) {
+      if (!canPlaceBlock(x, y, b, d)) continue;
+      placeBlock(x, y, b, d, b + 1);
+      --l[b];
+      if (dfs(p + 1)) return true;
+      ++l[b];
+      placeBlock(x, y, b, d, -1);
+    }
+  }
+  return false;
+}
+
diff --git a/calc.min.js b/calc.min.js
index 5b02045..85b853f 100644
--- a/calc.min.js
+++ b/calc.min.js
@@ -1 +1 @@
-const blocks=[[[[1,1],[1,1]]],[[[2,2,2,2]],[[2],[2],[2],[2]]],[[[3,3,0],[0,3,3]],[[0,3],[3,3],[3,0]]],[[[0,4,4],[4,4,0]],[[4,0],[4,4],[0,4]]],[[[5,0,0],[5,5,5]],[[5,5],[5,0],[5,0]],[[5,5,5],[0,0,5]],[[0,5],[0,5],[5,5]]],[[[0,0,6],[6,6,6]],[[6,6],[0,6],[0,6]],[[6,6,6],[6,0,0]],[[6,0],[6,0],[6,6]]],[[[0,7,0],[7,7,7]],[[7,7,7],[0,7,0]],[[7,0],[7,7],[7,0]],[[0,7],[7,7],[0,7]]],[[[0,8,0],[8,8,8],[0,8,0]]],[[[9]]],[[[10,10]],[[10],[10]]],[[[11,11],[11,0]],[[11,11],[0,11]],[[0,11],[11,11]],[[11,0],[11,11]]]];let m,n,a,l,res;function Solve(e,t){res=[],m=e.length,n=e[0].length,a=new Array(m);for(let t=0;t<m;++t)a[t]=e[t].map((e=>e));return l=t.map((e=>e)),dfs(0),res.sort(((e,t)=>{let n=new Set(e.flat()).size,r=new Set(t.flat()).size;if(n!==r)return r-n;{let n=Math.max(...e.flat().map((e=>l[e-1])));return Math.max(...t.flat().map((e=>l[e-1])))-n}})),res}function canPlaceBlock(e,t,l,r){const o=blocks[l][r];let f=0;for(;!o[0][f];)++f;if((t-=f)<0)return!1;for(let l=0;l<o.length;++l)for(let r=0;r<o[0].length;++r)if(o[l][r]&&(e+l>=m||t+r>=n||-1!==a[e+l][t+r]))return!1;return!0}function placeBlock(e,t,l,n,r){const o=blocks[l][n];let f=0;for(;!o[0][f];)++f;t-=f;for(let l=0;l<o.length;++l)for(let n=0;n<o[0].length;++n)o[l][n]&&(a[e+l][t+n]=r)}function dfs(e){if(e===m*n){const e=new Array(m);for(let t=0;t<m;++t)e[t]=a[t].map((e=>e));return res.push(e),res.length>=1e4&&(alert("方案数太多，仅计算前一万种。减少一些方块吧~"),!0)}const t=Math.floor(e/n),r=e%n;if(-1!==a[t][r])return!!dfs(e+1);for(let n=0;n<blocks.length;++n)if(l[n])for(let o=0;o<blocks[n].length;++o)if(canPlaceBlock(t,r,n,o)){if(placeBlock(t,r,n,o,n+1),--l[n],dfs(e+1))return!0;++l[n],placeBlock(t,r,n,o,-1)}return!1}
\ No newline at end of file
+const blocks=[[[[1,1],[1,1]]],[[[2,2,2,2]],[[2],[2],[2],[2]]],[[[3,3,0],[0,3,3]],[[0,3],[3,3],[3,0]]],[[[0,4,4],[4,4,0]],[[4,0],[4,4],[0,4]]],[[[5,0,0],[5,5,5]],[[5,5],[5,0],[5,0]],[[5,5,5],[0,0,5]],[[0,5],[0,5],[5,5]]],[[[0,0,6],[6,6,6]],[[6,6],[0,6],[0,6]],[[6,6,6],[6,0,0]],[[6,0],[6,0],[6,6]]],[[[0,7,0],[7,7,7]],[[7,7,7],[0,7,0]],[[7,0],[7,7],[7,0]],[[0,7],[7,7],[0,7]]],[[[0,8,0],[8,8,8],[0,8,0]]],[[[9]]],[[[10,10]],[[10],[10]]],[[[11,11],[11,0]],[[11,11],[0,11]],[[0,11],[11,11]],[[11,0],[11,11]]]];let m,n,a,l,res;function Solve(e,d){res=[];m=e.length;n=e[0].length;a=Array(m);for(let c=0;c<m;++c)a[c]=e[c].map(b=>b);l=d.map(c=>c);dfs(0);return res}function canPlaceBlock(e,d,c,b){c=blocks[c][b];for(b=0;!c[0][b];)++b;d-=b;if(0>d)return!1;for(b=0;b<c.length;++b)for(let f=0;f<c[0].length;++f)if(c[b][f]&&(e+b>=m||d+f>=n||-1!==a[e+b][d+f]))return!1;return!0}function placeBlock(e,d,c,b,f){c=blocks[c][b];for(b=0;!c[0][b];)++b;d-=b;for(b=0;b<c.length;++b)for(let g=0;g<c[0].length;++g)c[b][g]&&(a[e+b][d+g]=f)}function dfs(e){if(e===m*n){e=Array(m);for(var d=0;d<m;++d)e[d]=a[d].map(b=>b);res.push(e);return 1E4<=res.length?(alert("\u65b9\u6848\u6570\u592a\u591a\uff0c\u4ec5\u8ba1\u7b97\u524d\u4e00\u4e07\u79cd\u3002\u51cf\u5c11\u4e00\u4e9b\u65b9\u5757\u5427~"),!0):!1}d=Math.floor(e/n);const c=e%n;if(-1!==a[d][c])return dfs(e+1)?!0:!1;for(let b=0;b<blocks.length;++b)if(l[b])for(let f=0;f<blocks[b].length;++f)if(canPlaceBlock(d,c,b,f)){placeBlock(d,c,b,f,b+1);--l[b];if(dfs(e+1))return!0;++l[b];placeBlock(d,c,b,f,-1)}return!1}
diff --git a/index.html b/index.html
index 293ec8d..f92c368 100644
--- a/index.html
+++ b/index.html
@@ -1,105 +1,173 @@
-<!DOCTYPE html>
-<html lang="zh-CN">
-
-<head>
-  <meta charset="UTF-8">
-  <meta name="viewport" content="width=device-width, initial-scale=1.0">
-  <title>尘白禁区信源研析</title>
-  <script src="https://cdn.bootcdn.net/ajax/libs/vue/3.2.47/vue.global.prod.min.js"></script>
-  <script src="./calc.min.js"></script>
-</head>
-
-<body>
-  <a href="https://space.bilibili.com/277401945" target="_blank">Bilibili 方形的块状代码</a>
-  <div id="app">
-    <p>行数：<input type="text" v-model="row" /></p>
-    <p>列数：<input type="text" v-model="col" /></p>
-    <input type="button" value="确定" @click="confirmBoard">
-    <p>红色表示需要摆放的格子，白色表示这里没有格子，点击切换</p>
-    <div v-for="(r, i) in board" style="height: 32px;">
-      <div
-        class="box"
-        v-for="(c, j) in r"
-        @click="tuneBox(i, j)"
-        :style="{ 'background-color': c === 0 ? 'white' : 'red' }"
-      ></div>
-    </div>
-    <div v-if="board.length" style="margin-top: 8px;">
-      <p v-for="(b, i) in num">方块{{ i + 1 }}个数：<input type="text" v-model.number="num[i]" /></p>
-      <input type="button" value="计算完美方案" @click="calc">
-    </div>
-    <div v-if="res !== false">
-      <p>方案数：{{ res.length }}</p>
-    </div>
-    <div v-if="res.length">
-      <p>当前展示方案：{{ now + 1 }} / {{ res.length }}</p>
-      <input type="button" value="<-" @click="now -= (now > 0)">
-      <input type="button" value="->" @click="now += (now + 1 < res.length)">
-      <div v-for="(r, i) in sol" style="height: 32px;">
-        <div
-          class="box"
-          v-for="(c, j) in r"
-          :style="{ 'background-color': color[c] }"
-        >{{ c }}</div>
-      </div>
-    </div>
-  </div>
-  <script>
-    const { createApp } = Vue
-    createApp({
-      data() {
-        return {
-          row: 5,
-          col: 6,
-          board: [],
-          num: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
-          res: false,
-          now: 0,
-          color: ['white', '#75C0FF', '#3B66CF', '#78ACC5', '#C8FAFD', '#FDFF00', '#4BFF00', '#FF9800', '#B9B24B', '#FF00AE', '#8A2BE2', '#FF00FF']
-        }
-      },
-      methods: {
-        confirmBoard() {
-          const row = Number(this.row)
-          const col = Number(this.col)
-          this.board = new Array(row)
-          for (let i = 0; i < row; ++i) {
-            const r = new Array(col).fill(-1)
-            this.board[i] = r
-          }
-        },
-        tuneBox(x, y) {
-          if (this.board[x][y] === -1) {
-            this.board[x][y] = 0
-          } else {
-            this.board[x][y] = -1
-          }
-        },
-        calc() {
-          this.res = Solve(this.board, this.num)
-          this.now = 0
-        }
-      },
-      computed: {
-        sol() {
-          return this.res[this.now]
-        }
-      }
-    }).mount('#app')
-  </script>
-  <style>
-    p {
-      margin: 4px 0;
-    }
-    .box {
-      display: inline-block;
-      box-sizing: border-box;
-      width: 32px;
-      height: 32px;
-      border: 1px black solid;
-      cursor: pointer;
-    }
-  </style>
-</body>
-
-</html>
\ No newline at end of file
+<!DOCTYPE html>
+<html lang="zh-CN">
+
+<head>
+  <meta charset="UTF-8">
+  <meta name="viewport" content="width=device-width, initial-scale=1.0">
+  <title>尘白禁区信源研析</title>
+  <script src="https://cdn.jsdelivr.net/npm/vue/dist/vue.global.prod.min.js"></script>
+  <script src="./calc.min.js"></script>
+</head>
+
+<body>
+  <a href="https://space.bilibili.com/277401945" target="_blank">Bilibili 方形的块状代码</a>
+  <div id="app">
+    <p>行数：<input type="text" v-model="row" /></p>
+    <p>列数：<input type="text" v-model="col" /></p>
+    <input type="button" value="确定" @click="confirmBoard">
+    <p>红色表示需要摆放的格子，白色表示这里没有格子，点击切换</p>
+    <div v-for="(r, i) in board" style="height: 32px;">
+      <div
+        class="box"
+        v-for="(c, j) in r"
+        @click="tuneBox(i, j)"
+        :style="{ 'background-color': c === 0 ? 'white' : 'red' }"
+      ></div>
+    </div>
+    <div v-if="board.length" style="margin-top: 8px;">
+      <p v-for="(b, i) in num">方块{{ i + 1 }}个数：<input type="text" v-model.number="num[i]" /></p>
+      <input type="button" value="计算完美方案" @click="calc">
+    </div>
+    <div v-if="res !== false">
+      <p>方案数：{{ res.length }}</p>
+    </div>
+    <div v-if="res.length">
+      <p>当前展示方案：{{ now + 1 }} / {{ res.length }}</p>
+      <input type="button" value="<-" @click="now -= (now > 0)">
+      <input type="button" value="->" @click="now += (now + 1 < res.length)">
+      <div v-for="(r, i) in sol" style="height: 32px;">
+        <div
+          class="box"
+          v-for="(c, j) in r"
+          :style="{ 'background-color': color[c] }"
+        >{{ c }}</div>
+      </div>
+    </div>
+  </div>
+  <script>
+    const { createApp } = Vue
+    createApp({
+      data() {
+        return {
+          row: 5,
+          col: 6,
+          board: [],
+          num: new Array(11).fill(0),
+          res: false,
+          now: 0,
+          color: ['white', '#75C0FF', '#3B66CF', '#78ACC5', '#C8FAFD', '#FDFF00', '#4BFF00', '#FF9800', '#B9B24B', '#FF00AE', '#8A2BE2', '#FF00FF']
+        }
+      },
+      methods: {
+        confirmBoard() {
+          const row = Number(this.row)
+          const col = Number(this.col)
+          this.board = new Array(row)
+          for (let i = 0; i < row; ++i) {
+            const r = new Array(col).fill(-1)
+            this.board[i] = r
+          }
+        },
+        tuneBox(x, y) {
+          if (this.board[x][y] === -1) {
+            this.board[x][y] = 0
+          } else {
+            this.board[x][y] = -1
+          }
+        },
+        calc() {
+          const num_8 = new Array(11).fill(0)
+          num_8[7] = Number(this.num[7])
+          num_8[8] = Number(this.row) * Number(this.col)
+          const num_n8 = this.num.map(el => el)
+          num_n8[7] = 0
+
+          const board_8 = Solve(this.board, num_8)
+          let mapped = board_8.map((el, i) => {
+            return { index: i, value: (el.flat().filter(el => el === 8).length / 5) }
+          })
+          mapped.sort((a, b) => b.value - a.value)
+
+          let sorted = []
+          let s_max8 = []
+          let c_8 = mapped[0].value
+          while (c_8 >= 0) {
+            sorted = mapped.filter(el => el.value === c_8).map(el => board_8[el.index])
+            for (let s = 0; s < sorted.length ; ++s) {
+              for (let r = 0; r < Number(this.row); ++r) {
+                sorted[s][r].forEach((el, i, arr) => {
+                  if (arr[i] === 9) arr[i] = -1
+                })
+              }
+              let s_min9 = []
+              for (let c_9 = 0; c_9 <= Number(this.num[8]); ++c_9) {
+                num_n8[8] = c_9
+                let rf_base = Math.max(...num_n8.slice(0,-4))
+                let s_rf = []
+                for (let rf = 0; rf <= rf_base; ++rf) {
+                  let num_rf = num_n8.map(el => el)
+                  for (let i = 0; i < num_rf.length - 4; ++i) {
+                    num_rf[i] -= (rf_base - rf)
+                    if (num_rf[i] < 0) num_rf[i] = 0
+                  }
+                  //console.log(num_rf)
+                  s_rf = s_rf.concat(Solve(sorted[s], num_rf))
+                  if (s_rf.length > 0) break
+                }
+                s_min9 = s_min9.concat(s_rf)
+                if (s_min9.length > 0) break
+              }
+              s_max8 = s_max8.concat(s_min9)
+            }
+            if (s_max8.length > 0) break
+            --c_8
+          }
+
+  // Sort res by the number of distinct elements in each matrix, in descending order
+  // If the number of distinct elements is the same,
+  // sort by the highest number in l for each element used in A and B
+          s_max8.sort((A, B) => {
+            let distinctA = new Set(A.flat()).size
+            let distinctB = new Set(B.flat()).size
+
+            if (distinctA !== distinctB) {
+              return distinctB - distinctA
+            } else {
+              let maxA = Math.max(...A.flat().map(x => this.num[x-1]))
+              let maxB = Math.max(...B.flat().map(x => this.num[x-1]))
+              return maxB - maxA
+            }
+          })
+
+          s_max8.sort((a, b) => {
+            return (b.flat().filter(el => el === 10).length / 2 + b.flat().filter(el => el === 11).length / 3) - (a.flat().filter(el => el === 10).length / 2 + a.flat().filter(el => el === 11).length / 3)
+          })
+          s_max8.sort((a, b) => a.flat().filter(el => el === 9).length - b.flat().filter(el => el === 9).length)
+
+          this.res = s_max8
+          this.now = 0
+        }
+      },
+      computed: {
+        sol() {
+          return this.res[this.now]
+        }
+      }
+    }).mount('#app')
+  </script>
+  <style>
+    p {
+      margin: 4px 0;
+    }
+    .box {
+      display: inline-block;
+      box-sizing: border-box;
+      width: 32px;
+      height: 32px;
+      border: 1px black solid;
+      cursor: pointer;
+    }
+  </style>
+</body>
+
+</html>