@fgv/ts-sudoku-lib 5.1.0-3 → 5.1.0-30

package/lib/packlets/puzzles/killerSudokuPuzzle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"killerSudokuPuzzle.js","sourceRoot":"","sources":["../../../src/packlets/puzzles/killerSudokuPuzzle.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAEH,4CAAqE;AACrE,sCAAqG;AAErG,MAAM,aAAa,GAAW,sBAAsB,CAAC;AAErD;;GAEG;AACH,MAAa,kBAAmB,SAAQ,eAAM;IAC5C,YAAoB,MAAyB,EAAE,KAAuB;QACpE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACvB,CAAC;IAEM,MAAM,CAAC,MAAM,CAAC,IAAuB;QAC1C,sBAAsB;QACtB,IAAI,IAAI,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;YAClC,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,CAAC,WAAW,sBAAsB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC5E,CAAC;QAED,OAAO,IAAA,wBAAa,EAAC,GAAG,EAAE;YACxB,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,kBAAkB,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YACnE,MAAM,KAAK,GAAG,kBAAkB,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAC/D,OAAO,IAAI,kBAAkB,iCAAM,IAAI,KAAE,KAAK,KAAI,KAAK,CAAC,CAAC;QAC3D,CAAC,CAAC;aACC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE;YACpB,OAAO,IAAA,kBAAO,EAAC,MAAM,CAAC,CAAC;QACzB,CAAC,CAAC;aACD,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE;YACrB,OAAO,IAAA,eAAI,EAAC,iCAAiC,IAAI,CAAC,WAAW,OAAO,OAAO,EAAE,CAAC,CAAC;QACjF,CAAC,CAAC,CAAC;IACP,CAAC;IAEO,MAAM,CAAC,eAAe,CAAC,MAAyB;QACtD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACrC,oEAAoE;QACpE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,0BAA0B,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;QAC7D,CAAC;QAED,MAAM,SAAS,GAAG,kBAAkB,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,QAAQ,GAAG,kBAAkB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACnE,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QAClG,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAC3B,CAAC;IAEO,MAAM,CAAC,aAAa,CAAC,MAAyB,EAAE,WAAmB;;QACzE,MAAM,KAAK,GAA0B,IAAI,GAAG,EAAE,CAAC;QAC/C,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAE5C,0FAA0F;QAC1F,IAAI,WAAW,CAAC,MAAM,KAAK,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;YAClE,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,YAAY,CAAC;YACxD,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,YAAY,QAAQ,yBAAyB,GAAG,EAAE,CAAC,CAAC;QACtE,CAAC;QAED,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC;YAChD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,YAAY,EAAE,GAAG,EAAE,EAAE,CAAC;gBACnD,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,EAAG,CAAC;gBAClC,MAAM,IAAI,GAAG,YAAG,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;gBAChD,MAAM,KAAK,GAAG,MAAA,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,mCAAI,EAAE,CAAC;gBACpC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,MAAM,CAAC,SAAS,CACtB,MAAyB,EACzB,SAAgC,EAChC,QAAgB;QAEhB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;QAEtC,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,CAAC,IAAI,EAAE,CAAC;YACvC,MAAM,IAAI,KAAK,CAAC,YAAY,SAAS,CAAC,IAAI,sBAAsB,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QACrF,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,EAAE,CAAC,CAAC;YAChD,CAAC;YACD,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7B,MAAM,MAAM,GAAG,YAAG,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YAEhD,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,4CAA4C;YAC5C,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,eAAe,CAAC,CAAC;YACjD,CAAC;YACD,mDAAmD;YACnD,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;YACjC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;gBAChD,MAAM,IAAI,KAAK,CAAC,sBAAsB,KAAK,CAAC,MAAM,aAAa,MAAM,SAAS,QAAQ,GAAG,CAAC,CAAC;YAC7F,CAAC;YACD,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAA,2BAAkB,EAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YAChE,IAAI,KAAK,GAAG,GAAG,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;gBAC/B,MAAM,IAAI,KAAK,CAAC,iBAAiB,KAAK,aAAa,MAAM,cAAc,GAAG,KAAK,GAAG,GAAG,CAAC,CAAC;YACzF,CAAC;YAED,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,aAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;QAC3E,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;IACrC,CAAC;IAEO,MAAM,CAAC,eAAe,CAAC,MAAyB,EAAE,MAAc;QACtE,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC;YAChD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,YAAY,EAAE,GAAG,EAAE,EAAE,CAAC;gBACnD,MAAM,MAAM,GAAG,YAAG,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;gBAClD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC;gBACzD,IAAI,IAAI,EAAE,CAAC;oBACT,6DAA6D;oBAC7D,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;wBACnD,MAAM,IAAI,KAAK,CAAC,iBAAiB,IAAI,CAAC,KAAK,aAAa,MAAM,EAAE,CAAC,CAAC;oBACpE,CAAC;oBACD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBACjC,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;CACF;AA1HD,gDA0HC","sourcesContent":["/*\n * MIT License\n *\n * Copyright (c) 2023 Erik Fortune\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport { Result, captureResult, fail, succeed } from '@fgv/ts-utils';\nimport { Cage, CageId, CellId, IPuzzleDefinition, Ids, Puzzle, getCageTotalBounds } from '../common';\n\nconst cageDefFormat: RegExp = /^[A-Za-z][0-9][0-9]$/;\n\n/**\n * @public\n */\nexport class KillerSudokuPuzzle extends Puzzle {\n  private constructor(puzzle: IPuzzleDefinition, cages: [CageId, Cage][]) {\n    super(puzzle, cages);\n  }\n\n  public static create(desc: IPuzzleDefinition): Result<Puzzle> {\n    /* c8 ignore next 3 */\n    if (desc.type !== 'killer-sudoku') {\n      return fail(`Puzzle '${desc.description}' unsupported type ${desc.type}`);\n    }\n\n    return captureResult(() => {\n      const { cages, givens } = KillerSudokuPuzzle._getKillerCages(desc);\n      const cells = KillerSudokuPuzzle._getKillerCells(desc, givens);\n      return new KillerSudokuPuzzle({ ...desc, cells }, cages);\n    })\n      .onSuccess((puzzle) => {\n        return succeed(puzzle);\n      })\n      .onFailure((message) => {\n        return fail(`Failed to load killer puzzle \"${desc.description}\" - ${message}`);\n      });\n  }\n\n  private static _getKillerCages(puzzle: IPuzzleDefinition): { cages: [CageId, Cage][]; givens: Cage[] } {\n    const decl = puzzle.cells.split('|');\n    /* c8 ignore next 3 - tested but coverage has intermittent issues */\n    if (decl.length !== 2) {\n      throw new Error(`malformed cells|cages \"${puzzle.cells}\"`);\n    }\n\n    const cageCells = KillerSudokuPuzzle._getCageCells(puzzle, decl[0]);\n    const allCages = KillerSudokuPuzzle._getCages(puzzle, cageCells, decl[1]);\n    const cages = allCages.filter(([__id, cage]) => cage.numCells > 1);\n    const givens = allCages.filter(([__id, cage]) => cage.numCells === 1).map(([__id, cage]) => cage);\n    return { cages, givens };\n  }\n\n  private static _getCageCells(puzzle: IPuzzleDefinition, mappingDecl: string): Map<string, CellId[]> {\n    const cages: Map<string, CellId[]> = new Map();\n    const cageMapping = Array.from(mappingDecl);\n\n    /* c8 ignore next 5 - defensive coding: protected by validation in puzzleDefinitions.ts */\n    if (cageMapping.length !== puzzle.totalRows * puzzle.totalColumns) {\n      const expected = puzzle.totalRows * puzzle.totalColumns;\n      const got = cageMapping.length;\n      throw new Error(`expected ${expected} cell mappings, found ${got}`);\n    }\n\n    for (let row = 0; row < puzzle.totalRows; row++) {\n      for (let col = 0; col < puzzle.totalColumns; col++) {\n        const cage = cageMapping.shift()!;\n        const cell = Ids.cellId({ row, col }).orThrow();\n        const cells = cages.get(cage) ?? [];\n        cells.push(cell);\n        cages.set(cage, cells);\n      }\n    }\n\n    return cages;\n  }\n\n  private static _getCages(\n    puzzle: IPuzzleDefinition,\n    cageCells: Map<string, CellId[]>,\n    cagePart: string\n  ): [CageId, Cage][] {\n    const cages = new Map<CageId, Cage>();\n\n    const cageDefs = cagePart.split(',');\n    if (cageDefs.length !== cageCells.size) {\n      throw new Error(`expected ${cageCells.size} cage sizes, found ${cageDefs.length}`);\n    }\n\n    for (const def of cageDefs) {\n      if (!cageDefFormat.test(def)) {\n        throw new Error(`malformed cage spec ${def}`);\n      }\n      const cage = def.slice(0, 1);\n      const cageId = Ids.cageId(`K${cage}`).orThrow();\n\n      const total = Number.parseInt(def.slice(1));\n      const cells = cageCells.get(cage);\n      /* c8 ignore next 3 - should never happen */\n      if (!cells) {\n        throw new Error(`cage ${cageId} has no cells`);\n      }\n      // Use the puzzle's maxValue for dynamic validation\n      const maxValue = puzzle.maxValue;\n      if (cells.length < 1 || cells.length > maxValue) {\n        throw new Error(`invalid cell count ${cells.length} for cage ${cageId} (max ${maxValue})`);\n      }\n      const { min, max } = getCageTotalBounds(cells.length, maxValue);\n      if (total < min || total > max) {\n        throw new Error(`invalid total ${total} for cage ${cageId} (expected ${min}..${max})`);\n      }\n\n      cages.set(cageId, Cage.create(cageId, 'killer', total, cells).orThrow());\n    }\n\n    return Array.from(cages.entries());\n  }\n\n  private static _getKillerCells(puzzle: IPuzzleDefinition, givens: Cage[]): string {\n    const cells: string[] = [];\n    for (let row = 0; row < puzzle.totalRows; row++) {\n      for (let col = 0; col < puzzle.totalColumns; col++) {\n        const cellId = Ids.cellId({ row, col }).orThrow();\n        const cage = givens.find((g) => g.cellIds[0] === cellId);\n        if (cage) {\n          /* c8 ignore next 3 - defense in depth should never happen */\n          if (cage.total < 1 || cage.total > puzzle.maxValue) {\n            throw new Error(`invalid total ${cage.total} for cell ${cellId}`);\n          }\n          cells.push(String(cage.total));\n        } else {\n          cells.push('.');\n        }\n      }\n    }\n    return cells.join('');\n  }\n}\n"]}

package/lib/packlets/puzzles/sudokuPuzzle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sudokuPuzzle.d.ts","sourceRoot":"","sources":["../../../src/packlets/puzzles/sudokuPuzzle.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,MAAM,EAAgC,MAAM,eAAe,CAAC;AACrE,OAAO,EAAE,iBAAiB,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAEtD;;GAEG;AACH,qBAAa,YAAa,SAAQ,MAAM;IACtC,OAAO;WAIO,MAAM,CAAC,MAAM,EAAE,iBAAiB,GAAG,MAAM,CAAC,MAAM,CAAC;CAUhE"}

package/lib/packlets/puzzles/sudokuPuzzle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sudokuPuzzle.js","sourceRoot":"","sources":["../../../src/packlets/puzzles/sudokuPuzzle.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAEH,4CAAqE;AACrE,sCAAsD;AAEtD;;GAEG;AACH,MAAa,YAAa,SAAQ,eAAM;IACtC,YAAoB,MAAyB;QAC3C,KAAK,CAAC,MAAM,CAAC,CAAC;IAChB,CAAC;IAEM,MAAM,CAAC,MAAM,CAAC,MAAyB;QAC5C,sBAAsB;QACtB,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC7B,OAAO,IAAA,eAAI,EAAC,WAAW,MAAM,CAAC,WAAW,sBAAsB,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QAChF,CAAC;QAED,OAAO,IAAA,wBAAa,EAAC,GAAG,EAAE,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE;YACxE,OAAO,IAAA,kBAAO,EAAC,MAAM,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAfD,oCAeC","sourcesContent":["/*\n * MIT License\n *\n * Copyright (c) 2023 Erik Fortune\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport { Result, captureResult, fail, succeed } from '@fgv/ts-utils';\nimport { IPuzzleDefinition, Puzzle } from '../common';\n\n/**\n * @public\n */\nexport class SudokuPuzzle extends Puzzle {\n  private constructor(puzzle: IPuzzleDefinition) {\n    super(puzzle);\n  }\n\n  public static create(puzzle: IPuzzleDefinition): Result<Puzzle> {\n    /* c8 ignore next 3 */\n    if (puzzle.type !== 'sudoku') {\n      return fail(`Puzzle '${puzzle.description}' unsupported type ${puzzle.type}`);\n    }\n\n    return captureResult(() => new SudokuPuzzle(puzzle)).onSuccess((puzzle) => {\n      return succeed(puzzle);\n    });\n  }\n}\n"]}

package/lib/packlets/puzzles/sudokuXPuzzle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sudokuXPuzzle.d.ts","sourceRoot":"","sources":["../../../src/packlets/puzzles/sudokuXPuzzle.ts"],"names":[],"mappings":"AAwBA,OAAO,EAAE,MAAM,EAAgC,MAAM,eAAe,CAAC;AACrE,OAAO,EAAwB,iBAAiB,EAAO,MAAM,EAAE,MAAM,WAAW,CAAC;AAEjF;;GAEG;AACH,qBAAa,aAAc,SAAQ,MAAM;IACvC,OAAO;WAIO,MAAM,CAAC,MAAM,EAAE,iBAAiB,GAAG,MAAM,CAAC,MAAM,CAAC;IAgB/D,OAAO,CAAC,MAAM,CAAC,UAAU;CAuB1B"}

package/lib/packlets/puzzles/sudokuXPuzzle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sudokuXPuzzle.js","sourceRoot":"","sources":["../../../src/packlets/puzzles/sudokuXPuzzle.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAEH,4CAAqE;AACrE,sCAAiF;AAEjF;;GAEG;AACH,MAAa,aAAc,SAAQ,eAAM;IACvC,YAAoB,MAAyB,EAAE,UAA4B;QACzE,KAAK,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAC5B,CAAC;IAEM,MAAM,CAAC,MAAM,CAAC,MAAyB;QAC5C,sBAAsB;QACtB,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YAC/B,OAAO,IAAA,eAAI,EAAC,WAAW,MAAM,CAAC,WAAW,sBAAsB,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;QAChF,CAAC;QACD,6EAA6E;QAC7E,IAAI,MAAM,CAAC,SAAS,KAAK,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,OAAO,IAAA,eAAI,EAAC,uCAAuC,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC;QAChG,CAAC;QACD,OAAO,IAAA,wBAAa,EAAC,GAAG,EAAE;YACxB,OAAO,IAAI,aAAa,CAAC,MAAM,EAAE,aAAa,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;QACrE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE;YACtB,OAAO,IAAA,kBAAO,EAAC,MAAM,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,MAAM,CAAC,UAAU,CAAC,MAAyB;QACjD,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KACE,IAAI,GAAG,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,YAAY,GAAG,CAAC,EACrD,GAAG,GAAG,MAAM,CAAC,SAAS,EACtB,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EACrB,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,YAAG,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;YACvD,OAAO,CAAC,IAAI,CAAC,YAAG,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;QACzD,CAAC;QAED,MAAM,IAAI,GAAG,YAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QACxC,MAAM,IAAI,GAAG,YAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QAExC,MAAM,EAAE,GAAG,aAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;QAC5E,MAAM,EAAE,GAAG,aAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;QAC5E,OAAO;YACL,CAAC,IAAI,EAAE,EAAE,CAAC;YACV,CAAC,IAAI,EAAE,EAAE,CAAC;SACX,CAAC;IACJ,CAAC;CACF;AA5CD,sCA4CC","sourcesContent":["/*\n * MIT License\n *\n * Copyright (c) 2023 Erik Fortune\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\nimport { Result, captureResult, succeed, fail } from '@fgv/ts-utils';\nimport { Cage, CageId, CellId, IPuzzleDefinition, Ids, Puzzle } from '../common';\n\n/**\n * @public\n */\nexport class SudokuXPuzzle extends Puzzle {\n  private constructor(puzzle: IPuzzleDefinition, extraCages: [CageId, Cage][]) {\n    super(puzzle, extraCages);\n  }\n\n  public static create(puzzle: IPuzzleDefinition): Result<Puzzle> {\n    /* c8 ignore next 3 */\n    if (puzzle.type !== 'sudoku-x') {\n      return fail(`Puzzle '${puzzle.description}' unsupported type ${puzzle.type}`);\n    }\n    // Sudoku X diagonals work for any square puzzle (totalRows === totalColumns)\n    if (puzzle.totalRows !== puzzle.totalColumns) {\n      return fail(`Sudoku X puzzle must be square, got ${puzzle.totalRows}x${puzzle.totalColumns}`);\n    }\n    return captureResult(() => {\n      return new SudokuXPuzzle(puzzle, SudokuXPuzzle._getXCages(puzzle));\n    }).onSuccess((puzzle) => {\n      return succeed(puzzle);\n    });\n  }\n\n  private static _getXCages(puzzle: IPuzzleDefinition): [CageId, Cage][] {\n    const x1Cells: CellId[] = [];\n    const x2Cells: CellId[] = [];\n\n    for (\n      let row = 0, col1 = 0, col2 = puzzle.totalColumns - 1;\n      row < puzzle.totalRows;\n      row++, col1++, col2--\n    ) {\n      x1Cells.push(Ids.cellId({ row, col: col1 }).orThrow());\n      x2Cells.push(Ids.cellId({ row, col: col2 }).orThrow());\n    }\n\n    const x1Id = Ids.cageId('X1').orThrow();\n    const x2Id = Ids.cageId('X2').orThrow();\n\n    const x1 = Cage.create(x1Id, 'x', puzzle.basicCageTotal, x1Cells).orThrow();\n    const x2 = Cage.create(x2Id, 'x', puzzle.basicCageTotal, x2Cells).orThrow();\n    return [\n      [x1Id, x1],\n      [x2Id, x2]\n    ];\n  }\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@fgv/ts-sudoku-lib",
-  "version": "5.1.0-3",
+  "version": "5.1.0-30",
   "description": "Sudoku rules library",
   "main": "lib/index.js",
   "types": "dist/ts-sudoku-lib.d.ts",
@@ -37,19 +37,21 @@
     "ts-node": "^10.9.2",
     "typescript": "5.9.3",
     "eslint-plugin-n": "^17.23.1",
-    "@rushstack/heft": "1.2.6",
-    "@rushstack/heft-node-rig": "2.11.26",
+    "@rushstack/heft": "1.2.7",
+    "@rushstack/heft-node-rig": "2.11.27",
     "@types/heft-jest": "1.0.6",
     "@rushstack/eslint-config": "4.6.4",
     "@rushstack/heft-jest-plugin": "1.2.6",
     "eslint-plugin-tsdoc": "~0.5.2",
-    "@fgv/heft-dual-rig": "5.1.0-3",
-    "@fgv/ts-utils": "5.1.0-3",
-    "@fgv/ts-json-base": "5.1.0-3",
-    "@fgv/ts-utils-jest": "5.1.0-3"
+    "typedoc": "~0.28.16",
+    "@fgv/heft-dual-rig": "5.1.0-30",
+    "@fgv/typedoc-compact-theme": "5.1.0-30",
+    "@fgv/ts-utils": "5.1.0-30",
+    "@fgv/ts-utils-jest": "5.1.0-30",
+    "@fgv/ts-json-base": "5.1.0-30"
   },
   "peerDependencies": {
-    "@fgv/ts-utils": "5.1.0-3"
+    "@fgv/ts-utils": "5.1.0-30"
   },
   "exports": {
     ".": {

package/debug_test.js

@@ -1,88 +0,0 @@
-const path = require('path');
-const libPath = path.join(__dirname, 'lib');
-require.main.paths.unshift(libPath);
-
-try {
-  const Puzzles = require('./lib/packlets/puzzles');
-  const { PuzzleSession } = require('./lib/packlets/common');
-  const { KillerCombinations } = require('./lib/packlets/puzzles');
-
-  function createSimpleKillerCage(cageSize, total, containedValues = []) {
-    const existingPuzzleDesc = {
-      id: 'test-killer',
-      description: 'Test killer sudoku puzzle',
-      type: 'killer-sudoku',
-      level: 1,
-      rows: 9,
-      cols: 9,
-      cells: [
-        'ABCCCDDDE',
-        'ABFFGGGDE',
-        'HIJKGGLLL',
-        'HIJKMGLNN',
-        'HOPPMQQNR',
-        'OOSTMUVWR',
-        'SSSTTUVWR',
-        'XYTTTZZab',
-        'XYYYcccab',
-        '|A11,B09,C09,D20,E16,F17,G30,H17,I13,J09,K11,L16,M16,N11,O16,P07,Q11,R10,S14,T39,U08,V17,W16,X06,Y26,Z06,a09,b09,c11'
-      ].join('')
-    };
-
-    const puzzle = Puzzles.Killer.create(existingPuzzleDesc);
-    if (puzzle.isFailure()) throw new Error(puzzle.message);
-
-    const session = PuzzleSession.create(puzzle.value);
-    if (session.isFailure()) throw new Error(session.message);
-
-    // Apply contained values if provided
-    if (containedValues.length > 0) {
-      const cageA = puzzle.value.getCage('KA');
-      if (cageA.isFailure()) throw new Error(cageA.message);
-      const cellIds = Array.from(cageA.value.cellIds);
-      containedValues.forEach((value, index) => {
-        if (index < cellIds.length) {
-          const result = session.value.updateCellValue(cellIds[index], value);
-          if (result.isFailure()) throw new Error(result.message);
-        }
-      });
-    }
-
-    // For this simple test, we'll use cage KA
-    const cage = puzzle.value.getCage('KA');
-    if (cage.isFailure()) throw new Error(cage.message);
-
-    return { puzzle: puzzle.value, state: session.value.state, cage: cage.value };
-  }
-
-  console.log('Testing cage KA with one cell filled with 5...');
-  const { puzzle, state, cage } = createSimpleKillerCage(2, 11, [5]);
-
-  console.log('Cage info:', {
-    id: cage.id,
-    total: cage.total,
-    numCells: cage.numCells,
-    cellIds: Array.from(cage.cellIds)
-  });
-
-  console.log('Cell states:');
-  Array.from(cage.cellIds).forEach((cellId) => {
-    const contents = state.getCellContents(cellId);
-    if (contents.isSuccess()) {
-      console.log(`  ${cellId}:`, contents.value);
-    }
-  });
-
-  const result = KillerCombinations.getCellPossibilities(puzzle, state, cage);
-  if (result.isSuccess()) {
-    console.log('Possibilities:');
-    result.value.forEach((values, cellId) => {
-      console.log(`  ${cellId}: [${values.join(',')}]`);
-    });
-  } else {
-    console.error('Failed to get possibilities:', result.message);
-  }
-} catch (error) {
-  console.error('Error:', error.message);
-  console.error('Stack:', error.stack);
-}

package/dist/test/unit/helpers/puzzleBuilders.js

@@ -1,149 +0,0 @@
-/*
- * MIT License
- *
- * Copyright (c) 2023 Erik Fortune
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be included in all
- * copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-import '@fgv/ts-utils-jest';
-import { PuzzleSession, PuzzleDefinitionFactory, STANDARD_CONFIGS } from '../../../index';
-import { Puzzles } from '../../../index';
-/**
- * Creates a standard test puzzle and state from row strings
- * @param rows - 9 strings representing puzzle rows (use '.' for empty cells)
- * @param puzzleId - Optional puzzle ID (defaults to 'test-puzzle')
- * @returns Puzzle instance and initial state
- */
-export function createPuzzleAndState(rows, puzzleId = 'test-puzzle') {
-    const puzzleDefinition = PuzzleDefinitionFactory.create(STANDARD_CONFIGS.puzzle9x9, {
-        id: puzzleId,
-        description: 'Test puzzle',
-        type: 'sudoku',
-        level: 1,
-        cells: rows.join('')
-    }).orThrow();
-    const puzzle = Puzzles.Any.create(puzzleDefinition).orThrow();
-    const session = PuzzleSession.create(puzzle).orThrow();
-    return { puzzle, state: session.state };
-}
-/**
- * Creates a test puzzle with specific dimensions
- * @param dimensions - Puzzle dimensions configuration
- * @param cells - Cell values string
- * @param type - Puzzle type (defaults to 'sudoku')
- * @returns Puzzle instance and initial state
- */
-export function createPuzzleWithDimensions(dimensions, cells, type = 'sudoku') {
-    const puzzleDefinition = PuzzleDefinitionFactory.create(dimensions, {
-        id: 'test-puzzle',
-        description: 'Test puzzle',
-        type,
-        level: 1,
-        cells
-    }).orThrow();
-    const puzzle = Puzzles.Any.create(puzzleDefinition).orThrow();
-    const session = PuzzleSession.create(puzzle).orThrow();
-    return { puzzle, state: session.state };
-}
-/**
- * Creates a killer sudoku puzzle for testing cage-based logic
- * @param config - Configuration for the killer puzzle
- * @returns Puzzle instance, session, and first cage
- */
-export function createTestKillerPuzzle(config) {
-    var _a;
-    const cells = (_a = config.cells) !== null && _a !== void 0 ? _a : '.'.repeat(81);
-    // Build cage specifications
-    let cageSpecs = '';
-    if (config.cages) {
-        cageSpecs = config.cages
-            .map((cage) => {
-            var _a;
-            const id = (_a = cage.id) !== null && _a !== void 0 ? _a : `cage${cage.sum}`;
-            const cellList = cage.cells.join(',');
-            return `${id}:${cellList}:${cage.sum}`;
-        })
-            .join('|');
-    }
-    const puzzleDefinition = PuzzleDefinitionFactory.create(STANDARD_CONFIGS.puzzle9x9, {
-        id: 'test-killer',
-        description: 'Test Killer Sudoku',
-        type: 'killer',
-        level: 1,
-        cells: cells + (cageSpecs ? `:${cageSpecs}` : '')
-    }).orThrow();
-    const puzzle = Puzzles.Killer.create(puzzleDefinition).orThrow();
-    const session = PuzzleSession.create(puzzle).orThrow();
-    // Return first cage if any were defined
-    const cage = config.cages && config.cages.length > 0
-        ? puzzle.cages.find((c) => { var _a; return c.id === ((_a = config.cages[0].id) !== null && _a !== void 0 ? _a : `cage${config.cages[0].sum}`); })
-        : undefined;
-    return { puzzle, session, cage };
-}
-/**
- * Creates a simple killer sudoku cage for testing
- * @param cageSize - Number of cells in the cage
- * @param total - Sum total for the cage
- * @param startCell - Starting cell ID (defaults to 'A1')
- * @returns Cage specification object
- */
-export function createSimpleKillerCage(cageSize, total, startCell = 'A1') {
-    const cells = [startCell];
-    // Add adjacent cells horizontally
-    const startRow = startCell.charCodeAt(0);
-    const startCol = parseInt(startCell.substring(1), 10);
-    for (let i = 1; i < cageSize && cells.length < cageSize; i++) {
-        const row = String.fromCharCode(startRow);
-        const col = startCol + i;
-        if (col <= 9) {
-            cells.push(`${row}${col}`);
-        }
-    }
-    // If we need more cells, add them vertically
-    for (let i = 1; cells.length < cageSize && i < 9; i++) {
-        const row = String.fromCharCode(startRow + i);
-        const col = startCol;
-        if (row <= 'I') {
-            cells.push(`${row}${col}`);
-        }
-    }
-    return {
-        id: `cage${total}`,
-        cells,
-        sum: total
-    };
-}
-/**
- * Creates a sudoku X puzzle for testing diagonal constraints
- * @param rows - 9 strings representing puzzle rows
- * @returns Puzzle instance and initial state
- */
-export function createSudokuXPuzzle(rows) {
-    const puzzleDefinition = PuzzleDefinitionFactory.create(STANDARD_CONFIGS.puzzle9x9, {
-        id: 'test-sudoku-x',
-        description: 'Test Sudoku X',
-        type: 'sudoku-x',
-        level: 1,
-        cells: rows.join('')
-    }).orThrow();
-    const puzzle = Puzzles.SudokuX.create(puzzleDefinition).orThrow();
-    const session = PuzzleSession.create(puzzle).orThrow();
-    return { puzzle, state: session.state };
-}
-//# sourceMappingURL=puzzleBuilders.js.map