2d:null 2e:["$","title",null,{"children":"(Library) Old Mahjong Hand Checker | maddie lim ✨ | Observable"}] 33:T4e4,function checkHandValid(vec, actions, headActions, appliedActions = []) { /** No more tiles to process. We‘ve got a valid hand! **/ if (isVecEmpty(vec)) { return [true, appliedActions]; } const availActions = possibleActions(vec, actions); const availHeadActions = headActions != null ? possibleActions(vec, headActions) : []; for (let i = 0; i < availActions.length; i++) { const action = availActions[i]; const aplVec = applyAction(vec, action); const [res, resAppliedActions] = checkHandValid( aplVec, actions, headActions, [...appliedActions, action] ); if (res) { return [res, resAppliedActions]; } } // TODO: we could probably reduce the code repetition. for (let i = 0; i < availHeadActions.length; i++) { const action = availHeadActions[i]; const aplVec = applyAction(vec, action); /** * When we check the next level, we no longer pass `headActions` * since once it is applied, we can no longer check it. */ const [res, resAppliedActions] = checkHandValid(aplVec, actions, null, [ ...appliedActions, action ]); if (res) { return [res, resAppliedActions]; } } return [false, appliedActions]; }34:[] 31:{"id":"7e255c422bdd2f47","slug":"mahjong-algorithms-2","title":"(Library) Old Mahjong Hand Checker","thumbnail":"08e23af7acc6bac783c4e986153f6be607c1b219a51f2fff7a7c3751de9040ff","access_level":"public","create_time":"$D2022-07-18T03:09:35.067Z","update_time":"$D2022-07-23T19:17:15.115Z","view_time":null,"first_public_time":"$D2022-07-18T03:21:23.362Z","has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"408ee840d040526a","login":"maddievision","name":"maddie lim ✨","avatar_url":"https://avatars-next.observableusercontent.com/44fc4f0f8be73321b571127eefd9853a031c5c33e9985648c91e6aa827258ce0","tier":"starter_2024"},"version":868,"publish_version":868,"role":null,"authored":false,"authors":[{"type":"individual","id":"578d96c86967f83d","login":"maddievision","name":"maddie lim ✨","avatar_url":"https://avatars-next.observableusercontent.com/44fc4f0f8be73321b571127eefd9853a031c5c33e9985648c91e6aa827258ce0","tier":null}],"members":[{"type":"individual","id":"578d96c86967f83d","login":"maddievision","name":"maddie lim ✨","avatar_url":"https://avatars-next.observableusercontent.com/44fc4f0f8be73321b571127eefd9853a031c5c33e9985648c91e6aa827258ce0","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":{"id":"a8b2fa90e38b672d","slug":"mahjong","title":"Riichi Mahjong","owner":{"id":"408ee840d040526a","login":"maddievision","name":"maddie lim ✨"}},"type":"notebook","body":{"title":"(Library) Old Mahjong Hand Checker","cells":[{"id":0,"value":"# (Library) Old Mahjong Hand Checker","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":860,"value":"***See [@maddievision/tenpai](https://observablehq.com/@maddievision/tenpai?collection=@maddievision/mahjong) for an updated hand checker that supports Tenpai***","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":403,"value":"In Mahjong, a winning hand consists of four groups of three, and one pair. A group can either be a triad, or a sequence.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":176,"value":"Hands are entered using the notation below to specify tiles. For example, `4m` is 4 of characters, and `6z` is the green dragon.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":575,"value":"allTiles","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":754,"value":"----","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":408,"value":"**Using `handChecker(\"1m-2m-3m…\")` you can see whether it is a winning hand or not.**","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":500,"value":"handChecker(\"5m-5m-5m-6p-6p-4s-5s-6s-7s-8s-9s-6z-6z-6z\")","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":516,"value":"handChecker(\"1m-1m-3m-4m-5m-1p-1p-1p-5s-7s-8s-9s-1z-2z\")","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":721,"value":"handChecker(\"3m-3m-4m-4m-5m-5m-6m-6m-3p-5p-9s-9s-9s-4p\")","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":757,"value":"handChecker(\"7m-7m-1p-2s-3s-6s-7s-8s-5z-6z-6z-7z-7z-4s\")","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":747,"value":"----","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":549,"value":"## Seven Pairs and Thirteen Orphans","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":551,"value":"In addition to the standard 4 groups of 3, and 1 pair, there are also some exceptional hands that we can check for.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":553,"value":"**Seven pairs is just as it sounds.**","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":527,"value":"handChecker(\"1m-1m-2m-2m-2p-2p-7p-7p-1z-1z-5z-5z-7z-7z\")","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":556,"value":"**Thirteen orphans needs 1 of each terminal, and 1 of each honor tile, and a pair of any of those tiles.**","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":529,"value":"handChecker(\"1m-9m-1p-9p-1s-9s-1z-2z-3z-4z-5z-6z-7z-9p\")","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":259,"value":"----\n\n----\n\n----\n\n----\n\n----\n\n----\n\n----\n\n----\n\n----\n\n\n\n","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":261,"value":"# How it works","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":5,"value":"This detects a winning hand, using tree traversal and a vector data structure.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":271,"value":"We’ll go through an example hand here.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":273,"value":"exHand = \"1m-1m-2m-2m-3m-3m-2p-2p-1s-2s-3s-6z-6z-6z\"","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":276,"value":"mh(exHand)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":181,"value":"While our input is in a notation that describes literally what tiles are in our hand, we actually want to have a data structure that can represent how many of each tile are in our hand. This will be easier to operate on. A vector/array will serve this purpose, where each element is associated with a particular tile ID. ","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":619,"value":"This is what our hand looks like, converted to a vector.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":26,"value":"vec = handStrToVec(exHand)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":32,"value":"printVec(vec)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":267,"value":"A winning hand consists of four groups of three, and one pair. A group can either be a triad, or a sequence.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":377,"value":"We can detect whether a hand is a winning hand by breaking up the tiles into groups. One way of doing this is considering that each possible group can be thought of as an \"action\". See [Actions](https://observablehq.com/@maddievision/mahjong-algorithms-2#cell-52) below for a table of actions. ","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":382,"value":"The actions themselves can also be encoded as vectors. Here's the 123 number sequence of characters as a vector:","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":628,"value":"printVec(allActions[48].vec)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":649,"value":"And the green dragon triad.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":647,"value":"printVec(allActions[32].vec)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":626,"value":"To then apply the action (i.e., remove it from the hand), we can simply subtract the action vector from the hand vector.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":80,"value":"applyAction = (vec, action) => {\n return vec.map((m, i) => m - action.vec[i]);\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":653,"value":"Now, if we apply the 123 characters vector to our hand, the tile count of 1m, 2m, and 3m go down to 1 each.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":655,"value":"printVec(applyAction(vec, allActions[48]))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":661,"value":"And we could turn this resulting vector back into a hand string.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":664,"value":"mh(vecToHandStr(applyAction(vec, allActions[48])))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":387,"value":"Now that we have actions, and a way to apply them, we can now go through all of the actions to see what can apply to our current hand. We can tell if an action is applicable by seeing if any of the tile values go into the negative. That means there are not enough tiles that the action needs, to be successfully applied.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":72,"value":"possibleActions = (vec, actions) => {\n return actions.filter((action) => {\n const s = applyAction(vec, action);\n const x = s.filter((m) => m < 0).length;\n return x === 0;\n });\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":390,"value":"Now using this, let’s see what the available actions are on our example hand.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":75,"value":"availableActions = possibleActions(vec, allActions)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":98,"value":"printActions(availableActions)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":285,"value":"There are three possible actions we can take here. We can now apply these to the hand ourselves, and see what remaining tiles will be left.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":109,"value":"mh(vecToHandStr(applyAction(vec,availableActions[0])))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":112,"value":"mh(vecToHandStr(applyAction(vec,availableActions[1])))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":123,"value":"mh(vecToHandStr(applyAction(vec,availableActions[2])))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":291,"value":"For each of these possible applications, we can then find the next set of possible actions. If we continue doing this recursively we'll either reach a point where there are no actions that are valid, or we reach an empty hand.\n\nWhen there are no more valid actions (and the hand isn't empty) then we know it is not a successful hand.\n\nAnd an empty hand means we were able to account for all tiles in the hand belonging to groups, and therefore, it is valid!\n\nHowever, at this point, we're always going to end up with an invalid hand because we haven't yet considered the pair needed in addition to the 4 groups. Let’s call this, the \"head\".","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":293,"value":"So we can make a set of actions that are just pairs, and we can apply them in the same way. See the table of [pair actions](https://observablehq.com/@maddievision/mahjong-algorithms-2#cell-134).","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":144,"value":"availableHeadActions = possibleActions(vec, headActions)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":147,"value":"printActions(availableHeadActions, 8)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":299,"value":"And now we can see the current possible heads at the first level of the hand. This is what applying them looks like.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":154,"value":"mh(vecToHandStr(applyAction(vec,availableHeadActions[0])))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":156,"value":"mh(vecToHandStr(applyAction(vec,availableHeadActions[1])))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":158,"value":"mh(vecToHandStr(applyAction(vec,availableHeadActions[2])))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":160,"value":"mh(vecToHandStr(applyAction(vec, availableHeadActions[3])))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":398,"value":"Once a head action is applied, no more head actions can be applied. i.e., these may _only_ be applied ***once***.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":301,"value":"## And here’s the code!\nSo now we're ready to put this together in code. An algorithm that traverses through all the possible actions until it finds a path to a winning hand. If it does find a path, it will return the actions that made up that hand. We could use this to display the groups, or for scoring information.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":228,"value":"$33","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":315,"value":"And here it is in action!","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":313,"value":"exResult = checkHandValid(vec, allActions, headActions)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":318,"value":"exResult[0] ? md`### This is a valid hand!` : md`### This is NOT a valid hand.`","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":325,"value":"And here is what makes up the hand:","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":323,"value":"exResult[0] ? printActions(exResult[1]) : null","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":479,"value":"checkStandard = (vec) => checkHandValid(vec, allActions, headActions);","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":481,"value":"checkThirteenOrphans = (vec) => checkHandValid(vec, thirteenOrphanActions, thirteenOrphanHeadActions);","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":483,"value":"checkSevenPairs = (vec) => checkHandValid(vec, sevenPairsActions)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":485,"value":"checkAll = (vec) => {\n let result;\n\n result = checkThirteenOrphans(vec);\n if (result[0]) {\n return result;\n }\n\n result = checkSevenPairs(vec);\n if (result[0]) {\n return result;\n }\n\n result = checkStandard(vec);\n if (result[0]) {\n return result;\n }\n\n return [false, []];\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":438,"value":"## Other Algorithm Ideas","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":440,"value":"#### Are we in Tenpai?\n~~Extend this to be able to detect if the hand is one move away from winning (i.e., Tenpai, in Riichi Mahjong). [mahjong-lib has a table of \"waits\"](https://observablehq.com/@maddievision/mahjong-library#cell-125) we could use.~~\n\nSee [Tenpai Examples](https://observablehq.com/@maddievision/tenpai-examples?collection=@maddievision/mahjong). Beware, the underlying code is a MESS.\n\n#### How many moves until winning?\nFurther extend it to be able to report _how_ many moves a hand is to winning. In Riichi Mahjong this is known as the Shanten number. (number moves to winning hand)\n\n#### Riichi Mahjong and yaku, scoring\nMake an algorithm to figure out, for Riichi Mahjong, what yaku and score a winning hand is worth.\n\n#### With a drawn or discarded tile— can we call Chii/Pon/Kan? (or Chow/Pung/Kong)\nFigure out what calls/actions we can make with an added tile.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":52,"value":"## Actions","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":58,"value":"Actions can be applied to hands by subtracting it's vector from the hand vector. The action is applicable if the subtraction doesn't result in any negative values in the hand.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":54,"value":"allActions = melds.map(({ type, ids, hon }) => ({\n type,\n hon,\n vec: handStrToVec(ids),\n}))","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":93,"value":"printActions(allActions)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":134,"value":"### Head Actions","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":138,"value":"Head actions are pairs. These can only be applied once.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":127,"value":"headActions = sortOrder.map((tid) => ({\n type: \"pair head\",\n vec: handStrToVec(`${tid}-${tid}`)\n}))","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":132,"value":"printActions(headActions)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":787,"value":"## Thirteen orphans actions","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":837,"value":"The thirteen orphans hand is made up of one of each terminals and honor tiles and one more to pair with. This means there is one action for the orphans, and 13 possible head actions.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":467,"value":"kokushiString = \"1m-9m-1p-9p-1s-9s-1z-2z-3z-4z-5z-6z-7z\"","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":460,"value":"thirteenOrphanActions = [\n {\n type: \"13 orphans\",\n vec: handStrToVec(kokushiString)\n }\n]","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":462,"value":"printActions(thirteenOrphanActions)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":465,"value":"thirteenOrphanHeadActions = kokushiString.split(\"-\").map((tile) => ({\n type: \"13 head\",\n vec: handStrToVec(tile)\n}))","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":472,"value":"printActions(thirteenOrphanHeadActions)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":790,"value":"## Seven pairs actions","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":840,"value":"The seven pairs hand is made up of, as the name suggests, seven pairs. Since the hand is made up entirely of pairs we simply just need pair actions (no head).","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":476,"value":"sevenPairsActions = headActions.map((action) => ({\n ...action,\n type: \"pair\"\n}))","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":798,"value":"printActions(sevenPairsActions)","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":168,"value":"## Data","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":231,"value":"isVecEmpty = (vec) => vec.reduce((s, n) => s + n, 0) === 0","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":12,"value":"handStrToVec = (str) => {\n let vec = Array(vectorSlots.length).fill(0);\n const tiles = tileStringToArr(str);\n tiles.forEach((t) => {\n const idx = vectorSlots.indexOf(t);\n if (idx === -1) {\n throw new Error(`unknown tile id ${t}`);\n }\n vec[idx]++;\n });\n return vec;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":101,"value":"vecToHandStr = (vec) => {\n let tiles = [];\n vec.forEach((m, tid) => {\n for (let i = 0; i < m; i++) {\n tiles.push(vectorSlots[tid]);\n }\n });\n return arrToTileString(tiles);\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":40,"value":"## Display","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":497,"value":"handChecker = async (handStr, disp = mh, checker = checkAll) => {\n const vec = handStrToVec(handStr);\n const [res, actions] = checker(vec);\n const mdiv = html`

`;\n if (res) {\n mdiv.appendChild(html`

This is a winning hand!

`);\n } else {\n mdiv.appendChild(html`

This is not a winning hand :(

`);\n }\n mdiv.appendChild(await disp(handStr));\n if (res) {\n mdiv.appendChild(await printActions(actions));\n }\n return mdiv;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":8,"value":"import { mh, tileImage, sortOrder, tabular, melds, allTiles, tileRun, tileStringToArr, arrToTileString } from \"@maddievision/mahjong-library\"","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":28,"value":"printVec = async (vec) => {\n let arr = [];\n for (let i = 0; i < vec.length; i++) {\n const count = vec[i];\n // if (count === 0) {\n // continue;\n // }\n const tileId = vectorSlots[i];\n let mdiv;\n if (count === 0) {\n mdiv = html`

`;\n } else {\n mdiv = html`

`;\n }\n const mhand = await tileImage(tileId);\n mdiv.appendChild(mhand);\n if (count > 0) {\n const md = html`

x${count}

`;\n mdiv.append(md);\n } else {\n const md = html`

`;\n mdiv.append(md);\n }\n arr.push(mdiv);\n }\n return tabular(arr, 4);\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":61,"value":"printActions = async (actions, cols = 4) => {\n let arr = [];\n for (let i = 0; i < actions.length; i++) {\n const m = html`

`;\n const action = actions[i];\n // const disp = await printVec(action.vec);\n const disp = await tileRun(vecToHandStr(action.vec));\n\n m.appendChild(html`${action.type}`);\n m.appendChild(disp);\n arr.push(m);\n }\n\n return tabular(arr, cols);\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":844,"value":"vectorSlots = [\"0x\", ...sortOrder]","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":842,"value":"Vector slots","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"","database":"$undefined"},{"id":432,"value":"vectorElements = {\n let arr = [];\n for (let i = 0; i < vectorSlots.length; i++) {\n const tid = vectorSlots[i];\n const div = html`

`;\n div.appendChild(\n html`

${i}

`\n );\n div.appendChild(html`

${await tileImage(tid)}`);\n arr.push(div);\n }\n\n return tabular(arr, 4);\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W34","stdlib":"1","titling":"auto"}} 32:"$31:body"