2d:null 2e:["$","title",null,{"children":"Mahjong Math - Evaluating Readiness | randName() | Observable"}] 33:T5e2,baseShanten = { // actions as Graph Edges const deltas = [ [0, 0, 0, 1], [0, 1, 0, -1], [0, 0, 1, -1], [1, -1, 0, 0], [1, 0, -1, 0], ] const actions = [-1, 1].map((d) => deltas.map((dt, i) => [i, (vals) => { const r = dt.map((a, j) => a * d + vals[j]) return r.some((n) => n < 0) ? null : r.map((n) => n.toString(16)).join('').toUpperCase() }])) // Create graph const nodes = new Map(compositions.map(([draw, ...composition]) => { const id = composition.map((c) => c.toString(16)).join('').toUpperCase() return [id, { id, st: 14, draw, edges: [], composition }] })) // Initialize win condition nodes.get('4100').st = -1 // Dijkstra const unvisited = new Set(nodes.keys()) for (let i = 0; i < 200; ++i) { // in case of bugs const cand = [...unvisited].map((id) => nodes.get(id)) const cur = Math.min(...cand.map((c) => c.st)) const info = cand.find((c) => c.st === cur) const shanten = info.st + 1 - info.draw for (const [action, change] of actions[info.draw]) { const node = nodes.get(change(info.composition)) if (!node) continue; if (shanten < node.st) { node.st = shanten } info.edges.push({ id: node.id, action }) } unvisited.delete(info.id) if (!unvisited.size) break; } for (const { st, edges } of nodes.values()) { for (const ed of edges) { ed.cost = nodes.get(ed.id).st - st } edges.sort((a, b) => a.cost - b.cost) } return nodes }34:T55c,pairsShanten = { // actions as Graph Edges const deltas = [ [0, 0, 0, 1], [0, 1, 0, -1], [0, 0, 1, -1], [1, -1, 0, 0], [1, 0, -1, 0], ] const actions = [-1, 1].map((d) => deltas.map((dt, i) => [i, (vals) => { const r = dt.map((a, j) => a * d + vals[j]) return r.some((n) => n < 0) ? null : r.map((n) => n.toString(16)).join('').toUpperCase() }])) // Create graph const nodes = new Map(compositions.map(([draw, ...composition]) => { const id = composition.map((c) => c.toString(16)).join('').toUpperCase() return [id, { id, st: 14, draw, composition }] })) // Initialize win condition nodes.get('0700').st = -1 // Dijkstra const unvisited = new Set(nodes.keys()) for (let i = 0; i < 200; ++i) { // in case of bugs const cand = [...unvisited].map((id) => nodes.get(id)) const cur = Math.min(...cand.map((c) => c.st)) const info = cand.find((c) => c.st === cur) const shanten = info.st + 1 - info.draw for (const [action, change] of actions[info.draw]) { const node = nodes.get(change(info.composition)) if (!node) continue; if (shanten < node.st) { node.st = shanten } } unvisited.delete(info.id) if (!unvisited.size) break; } return new Map([...nodes.values()].filter(({ id, st }) => st < baseShanten.get(id).st).map((n) => [n.id, n])) }35:T9a5,1 /* graphic = { const grouped = [] for (const c of compositions) { const cur = 2 + c.st * 2 - c.draw if (!grouped[cur]) grouped.push([]) grouped[cur].push({...c}) } grouped[0][0].pos = 5 grouped[0][1].pos = 13 grouped[1][0].pos = 4 grouped[1][1].pos = 5 grouped[1][2].pos = 6 grouped[1][3].pos = 13 grouped[2][4].pos = 12 grouped[2][5].pos = 13 grouped[2][6].pos = 14 const href = ['group', 'pair', 'proto', 'tile'] const offs = [36, 24, 24, 12] const create = (comp) => { const off = [5] comp.forEach((n, i) => off.push(off[i] + n * offs[i])) return href.map((h, i) => Array.from({ length: comp[i] }, (_, j) => svg`\ `)).flat().concat(svg``) } const el = svg`` const main = el.querySelector('#main') d3.zoom().on("zoom", ({transform}) => main.setAttribute('transform', transform))(d3.select(el)) return el } */36:Td0f,parse = { // const sum = (...a) => a.flat().reduce((s, n) => s + n) function * combine (all) { all.sort((a, b) => b.length - a.length) const indices = all.map(() => 0) while (true) { yield indices.flatMap((i, j) => all[j][i]) for (let pl = (all.length - 1); pl >= 0; --pl) { if (++indices[pl] < all[pl].length) break; indices[pl] = 0 } if (indices.every((i) => !i)) break; } } const getSides = (grouping) => { let pair = false return grouping.map((g) => { if (g.length > 2) return 0 if (g.proto) return g.proto === 1 ? 2 : 1 if (g.length === 2) { pair = true return 1 } return 0 }).reduce((t, n) => t + n) + (pair ? 0 : 1) } const getWait = (grouping) => { const composition = [0, 0, 0, 0] let protorun = null grouping.forEach((g) => { if (g.proto) { protorun = g.proto } ++composition[g.length > 2 ? 0 : (4 - g.length - (g.proto ? 1 : 0))] }) const [comp, prot, pair, lone] = composition if (!prot) { if (!lone) { if (pair === 1) return { shanten: -1, type: '聴牌' } if (pair === 2) return { shanten: 0, type: '双ポ', side: 2 } } if (!pair && lone === 1) return { shanten: 0, type: '単騎', side: 1 } } else if (prot === 1 && !lone && pair === 1) { return { shanten: 0, type: [null, '両面', '嵌張', '辺張'][protorun], side: protorun === 1 ? 2 : 1, } } return { composition } } return (hand, calls = []) => { const len = hand.length if (len > 14 || !(len % 3)) return [] if (len === 1) return [{ type: '単騎', waits: new Set(hand) }] const closed = len > 12 const ownTurn = len % 3 === 2 const tileset = new Uint8Array(34) hand.forEach((t) => ++tileset[T.index(t)]) const suits = [0, 7, 16, 25].map((o) => tileset.subarray(o, o + (o ? 9 : 7))) let worst = 6 const results = [] if (closed) { const ct = [...suits[0], ...suits.slice(1).flatMap((n) => [n[0], n[8]])] const missing = ct.filter((i) => !i).length const shanten = missing - (ct.includes(2) ? 1 : 0) if (!shanten) { const side = ct.indexOf(0) > -1 ? 1 : 13 return [{ shanten, side, type: '国士無双' }] } else if (shanten < worst) { worst = shanten results.push({ shanten, side: -1 }) } } const all = suits.map(parseSuit).filter((i) => i.length) const numCalls = calls.length || ((ownTurn ? 14 : 13) - len) / 3 for (const grouping of ((all.length > 1) ? combine(all) : all[0])) { const wait = getWait(grouping) if (wait.type) { worst = 0 results.push(Object.assign(wait, { grouping })) continue; } const [c, t, p, lone] = wait.composition const g = c + numCalls const basic = 8 - g * 2 - (p + t - ((!p && ((g + t) > 4)) ? 1 : 0)) + (ownTurn ? 1 : 0) const shanten = closed ? Math.min(6 - p, basic) : basic if (shanten < worst) { worst = shanten } else if (shanten > (worst + 2)) { continue; } results.push({ shanten, grouping }) } worst += 2 return results.filter((i) => i.shanten < worst).sort((a, b) => a.shanten - b.shanten || b.side - a.side) } }37:Te1e,parseSuit = { const P = [35n, 19n, 23n, 37n, 13n, 33n, 29n, 17n, 31n] const mod = (p, i) => { try { return p % P[i] ? (p % P[i - 1] ? 1n : P[i - 1]) : P[i] } catch { return 1n } } const ar = (length, i) => Array.from({ length }, () => i + 1) const se = (p, i, k) => [ p * (k ? 1n : P[i]), k ? Object.assign([i, i + k], { proto: k === 2 ? 2 : ((i === 1 || i === 8) ? 3 : 1), }) : [i, i + 1, i + 2] ] const [quads, trips, pairs] = [4, 3, 2].map((n) => P.map((x, i) => [x ** BigInt(n), ar(n, i)])) const sequences = P.slice(2).map((m, i) => se(m * P[i], i + 1)) const protoruns = [1, 2].flatMap((n) => P.slice(n).map((m, i) => se(m * P[i], i + 1, n))) const ALL = [ ...P.map((s, i) => [s, [i + 1]]), ...trips, ...pairs, ...sequences, ...protoruns, ] const groups = new Map(ALL) const PAIRS = pairs.map((p) => p[0]) const TRIPS = trips.map((p) => p[0]) const QUADS = quads.map((p) => p[0]) const SEQNS = sequences.map((p) => p[0]) const floating = new Set(P) const getFactors = (prod) => { const quads = [] const sequences = [] // sequences for (const s of SEQNS) { if (!(prod % s)) sequences.push(s) } for (const [i, n] of PAIRS.entries()) { if (prod % n) continue; if (!(prod % TRIPS[i])) { //yield TRIPS[i] if (!(prod % QUADS[i])) quads.push(i) } //yield n } } // new Set(getFactors(n)) const cache = new Map(ALL.map((p) => [p[0], [[p[0]]]])) function parse (prod, top = false) { if (cache.has(prod)) return cache.get(prod) const seen = new Set() const result = [] function * gen (prod, n) { if (!n) return; const cur = floating.has(n) ? 1 : 0 const maxFloating = 3 - cur for (const rs of parse(prod / n)) { const flo = rs.filter((i) => floating.has(i)).length if (flo > maxFloating) continue; const grp = [n, ...rs].sort((a, b) => Number(b - a)) const key = grp.join('|') if (seen.has(key)) continue; seen.add(key) if (top) { grp.floating = flo + cur } yield grp } } for (const s of SEQNS) { if (prod % s) continue; result.push(...gen(prod, s)) } for (const [i, n] of PAIRS.entries()) { if (prod % n) continue; if (!(prod % TRIPS[i])) { result.push(...gen(prod, TRIPS[i])) if (!(prod % QUADS[i])) break; //result.push(...gen(prod, QUADS[i])) } result.push(...gen(prod, n)) break; } if (result.length < 2) { for (const [i, n] of P.entries()) { if (prod % n) continue; result.push(...gen(prod, n * mod(prod, i + 2))) } } cache.set(prod, result) return result } const hon = (c, i) => c ? Array.from({ length: c }, () => `${i + 1}z`) : null return (counts, s) => { if (!s) return [[...counts].map(hon).filter((i) => i)] let size = 0 const product = counts.reduce((p, n, i) => (size += n, p * (P[i] ** BigInt(n))), 1n) if (product === 1n) return [] const suit = 'zmsp'[s] const mapGroups = (n) => { const grp = groups.get(n) const tiles = grp.map((t) => `${t}${suit}`) if (grp.proto) { tiles.proto = grp.proto } return tiles } const parsed = parse(product, 1) const best = Math.min(...parsed.map((r) => r.floating)) + 1 const results = [] for (const grouping of parsed) { if (grouping.floating > best) continue; results.push(grouping.map(mapGroups)) } return results } }38:T495,T = { const W = '🀀🀁🀂🀃' const D = '🀄🀅🀆' const M = '🀇🀈🀉🀊🀋🀌🀍🀎🀏' const S = '🀐🀑🀒🀓🀔🀕🀖🀗🀘' const P = '🀙🀚🀛🀜🀝🀞🀟🀠🀡' const terminal = '🀇🀏🀐🀘🀙🀡' const idx = (c) => (c = c.charCodeAt(1) - 0xDC00, (c > -1 && c < 34) ? c : NaN) const num = (t) => (t = (idx(t) - 7) % 9, t > -1 ? (t + 1) : NaN) const suit = (t) => Math.floor((idx(t) - 7) / 9) + 1 const main = [...'zmsp'].flatMap((s, i) => Array.from({ length: i ? 9 : 7 }, (_, j) => `${1 + j}${s}`)) const indexMap = new Map(main.map((s, i) => [s, i])) const nameIndex = (t) => indexMap.get(t) ?? -1 return Object.defineProperties(main, { A: { value: [...(W + D + M + S + P)] }, W: { value: [...W] }, D: { value: [...D] }, M: { value: [undefined, ...M] }, S: { value: [undefined, ...S] }, P: { value: [undefined, ...P] }, back: { value: '🀫' }, suit: { value: suit }, index: { value: nameIndex }, number: { value: num }, joker: { value: '🀪' }, terminal: { value: [...terminal] }, orphans: { value: [...W, ...D, ...terminal] }, }) }39:[] 31:{"id":"5bcb6eb6364136d2","slug":"grouping-and-shanten-calculation","title":"Mahjong Math - Evaluating Readiness","thumbnail":"ea1d60ca0921ed38aa6c3f7e7189dcbab697a33e9c2149d28f566e64d86f31fd","access_level":"public","create_time":"$D2020-12-23T09:05:57.558Z","update_time":"$D2021-11-02T16:30:10.015Z","view_time":null,"first_public_time":"$D2021-02-03T15:40:36.791Z","has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"af680361d1ea8ba5","login":"randname","name":"randName()","avatar_url":"https://avatars-next.observableusercontent.com/f16c819c73deae04aebd89cd214320d2b848d288cea0ed4487f835cc1b3e9c04","tier":"starter_2024"},"version":2686,"publish_version":2686,"role":null,"authored":false,"authors":[{"type":"individual","id":"6af62fd51a9b60df","login":"randname","name":"randName()","avatar_url":"https://avatars-next.observableusercontent.com/f16c819c73deae04aebd89cd214320d2b848d288cea0ed4487f835cc1b3e9c04","tier":null}],"members":[{"type":"individual","id":"6af62fd51a9b60df","login":"randname","name":"randName()","avatar_url":"https://avatars-next.observableusercontent.com/f16c819c73deae04aebd89cd214320d2b848d288cea0ed4487f835cc1b3e9c04","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":{"id":"4fdfecbc27fc15ca","slug":"math-of-mahjong","title":"The Math of Mahjong","owner":{"id":"af680361d1ea8ba5","login":"randname","name":"randName()"}},"type":"notebook","body":{"title":"Mahjong Math - Evaluating Readiness","cells":[{"id":0,"value":"md`# Mahjong Math - Evaluating Readiness\n\n[Shanten](https://riichi.wiki/Shanten) is the number of tiles needed for reaching a ready hand (tenpai).\n\nThere are a few methods for quickly estimating the shanten based on the composition of groupings in the hand. However, there is some confusion as you can calculate shanten during or outside your turn. The potential composition of groups differ and thus some adjustments need to be made.\n\nThis notebook aims to rigourously compute shanten and then see how the heuristics actually perform.\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1495,"value":"md`## Base computation\n\nAll possible hand compositions are enumerated by starting with either 13 or 14 tiles, then taking out increasing number of groups, pairs, and protoruns.\n\nHere we treat triplets and sequences as equivalent, but evaluating them seperately is also possible. The shanten count should not be affected.\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2439,"value":"compositions = {\n // convenience function for generating a range\n const gen = (n, f) => Array.from({ length: Math.floor(n / 2) + 1 }, (_, i) => f(i))\n\n return gen(8, (groups) => [14, 13].map((n, draw) => {\n\n // remove groups of 3\n const total = n - groups * 3\n\n return gen(total, (pairs) => {\n\n // remove pairs\n const r = total - pairs * 2\n\n // handle protoruns and floating tiles\n return gen(r, (t) => [draw, groups, pairs, t, r - t * 2])\n })\n\n })).flat(3) // flatten array\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2449,"value":"md`\nThese are initialized as nodes in a graph.\n\nEdges are changes to the composition that happen when drawing & discarding (e.g. a pair becomes a group when drawing). Actions that lead to invalid nodes (e.g. discarding a floating tile when there are none) are skipped.\n\nThe Dijkstra algorithm is run with the win condition (\\`3 groups + 1 pair\\`) set at distance \\`-1\\`. The distance only increases on draw actions, and that gives the shanten value directly.\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1778,"value":"$33","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2518,"value":"$34","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2557,"value":"shantenList = [...baseShanten.values()].filter((n) => !pairsShanten.has(n.id)).sort(compSort).slice(8)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2262,"value":"viewof height = html``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2051,"value":"$35","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1891,"value":"dot`digraph {rankdir=RL;ranksep=0.5;concentrate=true;\n${''\n/* \ngrouped.slice(0, 4).flat().flatMap((c) => c.edges.filter((i) => {\n return i.cost <= 0 || (c.draw && i.action)\n}).map((z) => `${c.id}->${z.id} [color=\"${colors[z.action]}\"];`)).join('')\ncompositions.flatMap((g) => g.edges.filter((i) => {\n return i.cost <= 0 || (g.draw && i.action)\n}).map((i) => `\"${g.id}\"->\"${i.id}\" [color=\"${colors[i.action]}\"];`)).join('')\n*/\n}}`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2526,"value":"compSort = (a, b) => a.st - b.st || b.draw - a.draw || b.id.localeCompare(a.id)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1754,"value":"colors = [\n '#919191',\n '#0000FF',\n '#FF0000',\n '#00FF00',\n '#009900',\n]","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1396,"value":"//computed = compositions.map(good)\n// ([c, p, t, _]) => 8 - c * 2 - Math.max(4 - c, p + t) - Math.max(Math.min(p + t + c - 4, 1), 0))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1425,"value":"good = ([c, p, t, loose]) => 8 - c * 2 - (p + t - ((!p && ((c + t) > 4)) ? 1 : 0))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2565,"value":"runk = ([c, p, t, loose]) => 8 - c * 2 - (p+t+c)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2588,"value":"shantenList.filter((n) => n.st !== runk(n.composition)).map((n) => [runk(n.composition), n.st, ' ', ...n.composition])","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1088,"value":"// use the mj template string for convenience\nmj`1234m`","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1090,"value":"// haha\nmj`19m19s19p1234567z`","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":623,"value":"// nine gates\nparse(mj`1112345678999m`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":538,"value":"parse(mj`1111234m233p`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":696,"value":"parse(mj`2345m2339p145s33z`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1104,"value":"parse(mj`5m8p55s`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1113,"value":"parse(mj`1299p378s2z`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1115,"value":"parse(mj`1247m789p0s35z8m`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1117,"value":"//parse(mj`44m2389p23477s246z`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1122,"value":"//parse(mj`147m266p15s24567z7s`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":546,"value":"//parse(mj`4445556661m`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2412,"value":"md`## Special cases\n\nBefore handling the standard computation, let's get the weird ones out of the way.\n\nUsually you would know if you are aiming for one of these hands, so involving all of them in the computation of \"accurate shanten\" is rarely done. However, it works well as a way to decide if pursuing them is worth it (especially at the start of the game).\n\n### Seven Pairs (七対子・chiitoi)\n\nSince you need 7 pairs, the shanten is \\`6 - pairs\\` (including triplets)\n\n**Except** 5 pairs and 1 triplet. In that case, the extra tile from the triplet cannot contribute the hand and thus still 1-shanten\n\n### Thirteen Orphans (国士無双・kokushi musou)\n\nYou need one of each orphan tile, and one of them needs to be paired up.\n\n\\`13 - orphans - max(orphanPairs, 1)\\`\n`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1124,"value":"parse(mj`34440666789998s`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1126,"value":"//parse(mj`78m24588p478s255z3p`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":739,"value":"//parse(mj`233m44p13z`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":940,"value":"//parse(mj`33m3487p1236s`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":953,"value":"//parse(mj`12346m6799p1268s`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":960,"value":" // 3shanten\nparse(mj`345s44m122689p13z`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1285,"value":"// 2shanten\nparse(mj`345s44m122689p33z`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":981,"value":"// 1shanten\nparse(mj`1222m1245789p11s`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1301,"value":"// 3shanten\nparse(mj`2359p12267m5552z`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":998,"value":"// 2shanten\nparse(mj`7799m578p6s11336z`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1001,"value":"// 2shanten\nparse(mj`2368m13567p68s11z`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":771,"value":"//parse(mj`19m19p19s1234567z`)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1073,"value":"md`## Appendix`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":755,"value":"$36","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":5,"value":"$37","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":732,"value":"mj = {\n const suits = new Set('mspzMSPZ')\n return (strs) => {\n const final = []\n const stack = []\n for (const s of strs[0]) {\n const v = parseInt(s)\n if (v === 0) {\n stack.push(5)\n continue;\n } else if (v) {\n stack.push(v)\n continue;\n }\n if (!suits.has(s)) continue;\n final.push(...stack.splice(0).map((n) => `${n}${s.toLowerCase()}`))\n }\n final.push(...stack.map((n) => `${n}z`))\n return final.filter((i) => i)\n }\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1038,"value":"$38","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1500,"value":"d3 = require(\"d3@6\")","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1919,"value":"dot = require(\"@observablehq/graphviz@0.2\")","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W39","stdlib":"1","titling":"auto"}} 32:"$31:body"