@fgv/ts-sudoku-lib 2.0.2-alpha.0

package/lib/packlets/puzzles/killerSudokuPuzzle.js

@@ -0,0 +1,136 @@
+"use strict";
+/*
+ * 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.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.KillerSudokuPuzzle = void 0;
+const ts_utils_1 = require("@fgv/ts-utils");
+const common_1 = require("../common");
+const cageDefFormat = /^[A-Za-z][0-9][0-9]$/;
+/**
+ * @public
+ */
+class KillerSudokuPuzzle extends common_1.Puzzle {
+    constructor(puzzle, cages) {
+        super(puzzle, cages);
+    }
+    static create(desc) {
+        /* c8 ignore next 3 */
+        if (desc.type !== 'killer-sudoku') {
+            return (0, ts_utils_1.fail)(`Puzzle '${desc.description}' unsupported type ${desc.type}`);
+        }
+        return (0, ts_utils_1.captureResult)(() => {
+            const { cages, givens } = KillerSudokuPuzzle._getKillerCages(desc);
+            const cells = KillerSudokuPuzzle._getKillerCells(desc, givens);
+            return new KillerSudokuPuzzle(Object.assign(Object.assign({}, desc), { cells }), cages);
+        })
+            .onSuccess((puzzle) => {
+            return (0, ts_utils_1.succeed)(puzzle);
+        })
+            .onFailure((message) => {
+            return (0, ts_utils_1.fail)(`Failed to load killer puzzle "${desc.description}" - ${message}`);
+        });
+    }
+    static _getKillerCages(puzzle) {
+        const decl = puzzle.cells.split('|');
+        if (decl.length !== 2) {
+            throw new Error(`malformed cells|cages "${puzzle.cells}"`);
+        }
+        const cageCells = KillerSudokuPuzzle._getCageCells(puzzle, decl[0]);
+        const allCages = KillerSudokuPuzzle._getCages(puzzle, cageCells, decl[1]);
+        const cages = allCages.filter(([__id, cage]) => cage.numCells > 1);
+        const givens = allCages.filter(([__id, cage]) => cage.numCells === 1).map(([__id, cage]) => cage);
+        return { cages, givens };
+    }
+    static _getCageCells(puzzle, mappingDecl) {
+        var _a;
+        const cages = new Map();
+        const cageMapping = Array.from(mappingDecl);
+        if (cageMapping.length !== puzzle.rows * puzzle.cols) {
+            const expected = puzzle.rows * puzzle.cols;
+            const got = cageMapping.length;
+            throw new Error(`expected ${expected} cell mappings, found ${got}`);
+        }
+        for (let row = 0; row < puzzle.rows; row++) {
+            for (let col = 0; col < puzzle.cols; col++) {
+                const cage = cageMapping.shift();
+                const cell = common_1.Ids.cellId({ row, col }).orThrow();
+                const cells = (_a = cages.get(cage)) !== null && _a !== void 0 ? _a : [];
+                cells.push(cell);
+                cages.set(cage, cells);
+            }
+        }
+        return cages;
+    }
+    static _getCages(__puzzle, cageCells, cagePart) {
+        const cages = new Map();
+        const cageDefs = cagePart.split(',');
+        if (cageDefs.length !== cageCells.size) {
+            throw new Error(`expected ${cageCells.size} cage sizes, found ${cageDefs.length}`);
+        }
+        for (const def of cageDefs) {
+            if (!cageDefFormat.test(def)) {
+                throw new Error(`malformed cage spec ${def}`);
+            }
+            const cage = def.slice(0, 1);
+            const cageId = common_1.Ids.cageId(`K${cage}`).orThrow();
+            const total = Number.parseInt(def.slice(1));
+            const cells = cageCells.get(cage);
+            /* c8 ignore next 3 - should never happen */
+            if (!cells) {
+                throw new Error(`cage ${cageId} has no cells`);
+            }
+            if (cells.length < 1 || cells.length > 9) {
+                throw new Error(`invalid cell count ${cells.length} for cage ${cageId}`);
+            }
+            const { min, max } = common_1.totalsByCageSize[cells.length];
+            if (total < min || total > max) {
+                throw new Error(`invalid total ${total} for cage ${cageId} (expected ${min}..${max})`);
+            }
+            cages.set(cageId, common_1.Cage.create(cageId, 'killer', total, cells).orThrow());
+        }
+        return Array.from(cages.entries());
+    }
+    static _getKillerCells(puzzle, givens) {
+        const cells = [];
+        for (let row = 0; row < puzzle.rows; row++) {
+            for (let col = 0; col < puzzle.cols; col++) {
+                const cellId = common_1.Ids.cellId({ row, col }).orThrow();
+                const cage = givens.find((g) => g.cellIds[0] === cellId);
+                if (cage) {
+                    /* c8 ignore next 3 - defense in depth should never happen */
+                    if (cage.total < 1 || cage.total > 9) {
+                        throw new Error(`invalid total ${cage.total} for cell ${cellId}`);
+                    }
+                    cells.push(String(cage.total));
+                }
+                else {
+                    cells.push('.');
+                }
+            }
+        }
+        return cells.join('');
+    }
+}
+exports.KillerSudokuPuzzle = KillerSudokuPuzzle;
+//# sourceMappingURL=killerSudokuPuzzle.js.map

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,sCAAoG;AAEpG,MAAM,aAAa,GAAW,sBAAsB,CAAC;AAErD;;GAEG;AACH,MAAa,kBAAmB,SAAQ,eAAM;IAC5C,YAAoB,MAA0B,EAAE,KAAuB;QACrE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACvB,CAAC;IAEM,MAAM,CAAC,MAAM,CAAC,IAAwB;QAC3C,sBAAsB;QACtB,IAAI,IAAI,CAAC,IAAI,KAAK,eAAe,EAAE;YACjC,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,CAAC,WAAW,sBAAsB,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;SAC3E;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,MAA0B;QACvD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;YACrB,MAAM,IAAI,KAAK,CAAC,0BAA0B,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;SAC5D;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,MAA0B,EAAE,WAAmB;;QAC1E,MAAM,KAAK,GAA0B,IAAI,GAAG,EAAE,CAAC;QAC/C,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAE5C,IAAI,WAAW,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE;YACpD,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YAC3C,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,YAAY,QAAQ,yBAAyB,GAAG,EAAE,CAAC,CAAC;SACrE;QAED,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;YAC1C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;gBAC1C,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;aACxB;SACF;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,MAAM,CAAC,SAAS,CACtB,QAA4B,EAC5B,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;YACtC,MAAM,IAAI,KAAK,CAAC,YAAY,SAAS,CAAC,IAAI,sBAAsB,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;SACpF;QAED,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE;YAC1B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE;gBAC5B,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,EAAE,CAAC,CAAC;aAC/C;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;gBACV,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,eAAe,CAAC,CAAC;aAChD;YACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;gBACxC,MAAM,IAAI,KAAK,CAAC,sBAAsB,KAAK,CAAC,MAAM,aAAa,MAAM,EAAE,CAAC,CAAC;aAC1E;YACD,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,yBAAgB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACpD,IAAI,KAAK,GAAG,GAAG,IAAI,KAAK,GAAG,GAAG,EAAE;gBAC9B,MAAM,IAAI,KAAK,CAAC,iBAAiB,KAAK,aAAa,MAAM,cAAc,GAAG,KAAK,GAAG,GAAG,CAAC,CAAC;aACxF;YAED,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,aAAI,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;SAC1E;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;IACrC,CAAC;IAEO,MAAM,CAAC,eAAe,CAAC,MAA0B,EAAE,MAAc;QACvE,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;YAC1C,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE;gBAC1C,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;oBACR,6DAA6D;oBAC7D,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE;wBACpC,MAAM,IAAI,KAAK,CAAC,iBAAiB,IAAI,CAAC,KAAK,aAAa,MAAM,EAAE,CAAC,CAAC;qBACnE;oBACD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;iBAChC;qBAAM;oBACL,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;iBACjB;aACF;SACF;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;CACF;AAtHD,gDAsHC","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, IPuzzleDescription, Ids, Puzzle, totalsByCageSize } 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: IPuzzleDescription, cages: [CageId, Cage][]) {\n    super(puzzle, cages);\n  }\n\n  public static create(desc: IPuzzleDescription): 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: IPuzzleDescription): { cages: [CageId, Cage][]; givens: Cage[] } {\n    const decl = puzzle.cells.split('|');\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: IPuzzleDescription, mappingDecl: string): Map<string, CellId[]> {\n    const cages: Map<string, CellId[]> = new Map();\n    const cageMapping = Array.from(mappingDecl);\n\n    if (cageMapping.length !== puzzle.rows * puzzle.cols) {\n      const expected = puzzle.rows * puzzle.cols;\n      const got = cageMapping.length;\n      throw new Error(`expected ${expected} cell mappings, found ${got}`);\n    }\n\n    for (let row = 0; row < puzzle.rows; row++) {\n      for (let col = 0; col < puzzle.cols; 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: IPuzzleDescription,\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      if (cells.length < 1 || cells.length > 9) {\n        throw new Error(`invalid cell count ${cells.length} for cage ${cageId}`);\n      }\n      const { min, max } = totalsByCageSize[cells.length];\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: IPuzzleDescription, givens: Cage[]): string {\n    const cells: string[] = [];\n    for (let row = 0; row < puzzle.rows; row++) {\n      for (let col = 0; col < puzzle.cols; 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 > 9) {\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

@@ -0,0 +1,10 @@
+import { Result } from '@fgv/ts-utils';
+import { IPuzzleDescription, Puzzle } from '../common';
+/**
+ * @public
+ */
+export declare class SudokuPuzzle extends Puzzle {
+    private constructor();
+    static create(puzzle: IPuzzleDescription): Result<Puzzle>;
+}
+//# sourceMappingURL=sudokuPuzzle.d.ts.map

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,kBAAkB,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAEvD;;GAEG;AACH,qBAAa,YAAa,SAAQ,MAAM;IACtC,OAAO;WAIO,MAAM,CAAC,MAAM,EAAE,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC;CAUjE"}

package/lib/packlets/puzzles/sudokuPuzzle.js

@@ -0,0 +1,47 @@
+"use strict";
+/*
+ * 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.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SudokuPuzzle = void 0;
+const ts_utils_1 = require("@fgv/ts-utils");
+const common_1 = require("../common");
+/**
+ * @public
+ */
+class SudokuPuzzle extends common_1.Puzzle {
+    constructor(puzzle) {
+        super(puzzle);
+    }
+    static create(puzzle) {
+        /* c8 ignore next 3 */
+        if (puzzle.type !== 'sudoku') {
+            return (0, ts_utils_1.fail)(`Puzzle '${puzzle.description}' unsupported type ${puzzle.type}`);
+        }
+        return (0, ts_utils_1.captureResult)(() => new SudokuPuzzle(puzzle)).onSuccess((puzzle) => {
+            return (0, ts_utils_1.succeed)(puzzle);
+        });
+    }
+}
+exports.SudokuPuzzle = SudokuPuzzle;
+//# sourceMappingURL=sudokuPuzzle.js.map

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,sCAAuD;AAEvD;;GAEG;AACH,MAAa,YAAa,SAAQ,eAAM;IACtC,YAAoB,MAA0B;QAC5C,KAAK,CAAC,MAAM,CAAC,CAAC;IAChB,CAAC;IAEM,MAAM,CAAC,MAAM,CAAC,MAA0B;QAC7C,sBAAsB;QACtB,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE;YAC5B,OAAO,IAAA,eAAI,EAAC,WAAW,MAAM,CAAC,WAAW,sBAAsB,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;SAC/E;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 { IPuzzleDescription, Puzzle } from '../common';\n\n/**\n * @public\n */\nexport class SudokuPuzzle extends Puzzle {\n  private constructor(puzzle: IPuzzleDescription) {\n    super(puzzle);\n  }\n\n  public static create(puzzle: IPuzzleDescription): 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

@@ -0,0 +1,11 @@
+import { Result } from '@fgv/ts-utils';
+import { IPuzzleDescription, Puzzle } from '../common';
+/**
+ * @public
+ */
+export declare class SudokuXPuzzle extends Puzzle {
+    private constructor();
+    static create(puzzle: IPuzzleDescription): Result<Puzzle>;
+    private static _getXCages;
+}
+//# sourceMappingURL=sudokuXPuzzle.d.ts.map

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,EAA0B,MAAM,eAAe,CAAC;AAC/D,OAAO,EAAwB,kBAAkB,EAAO,MAAM,EAAE,MAAM,WAAW,CAAC;AAElF;;GAEG;AACH,qBAAa,aAAc,SAAQ,MAAM;IACvC,OAAO;WAIO,MAAM,CAAC,MAAM,EAAE,kBAAkB,GAAG,MAAM,CAAC,MAAM,CAAC;IAYhE,OAAO,CAAC,MAAM,CAAC,UAAU;CAmB1B"}

package/lib/packlets/puzzles/sudokuXPuzzle.js

@@ -0,0 +1,65 @@
+"use strict";
+/*
+ * 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.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SudokuXPuzzle = void 0;
+const ts_utils_1 = require("@fgv/ts-utils");
+const common_1 = require("../common");
+/**
+ * @public
+ */
+class SudokuXPuzzle extends common_1.Puzzle {
+    constructor(puzzle, extraCages) {
+        super(puzzle, extraCages);
+    }
+    static create(puzzle) {
+        /* c8 ignore next 3 */
+        if (puzzle.type !== 'sudoku-x') {
+            return fail(`Puzzle '${puzzle.description}' unsupported type ${puzzle.type}`);
+        }
+        return (0, ts_utils_1.captureResult)(() => {
+            return new SudokuXPuzzle(puzzle, SudokuXPuzzle._getXCages(puzzle));
+        }).onSuccess((puzzle) => {
+            return (0, ts_utils_1.succeed)(puzzle);
+        });
+    }
+    static _getXCages(puzzle) {
+        const x1Cells = [];
+        const x2Cells = [];
+        for (let row = 0, col1 = 0, col2 = puzzle.cols - 1; row < puzzle.rows; row++, col1++, col2--) {
+            x1Cells.push(common_1.Ids.cellId({ row, col: col1 }).orThrow());
+            x2Cells.push(common_1.Ids.cellId({ row, col: col2 }).orThrow());
+        }
+        const x1Id = common_1.Ids.cageId('X1').orThrow();
+        const x2Id = common_1.Ids.cageId('X2').orThrow();
+        const x1 = common_1.Cage.create(x1Id, 'x', 45, x1Cells).orThrow();
+        const x2 = common_1.Cage.create(x2Id, 'x', 45, x2Cells).orThrow();
+        return [
+            [x1Id, x1],
+            [x2Id, x2]
+        ];
+    }
+}
+exports.SudokuXPuzzle = SudokuXPuzzle;
+//# sourceMappingURL=sudokuXPuzzle.js.map

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,4CAA+D;AAC/D,sCAAkF;AAElF;;GAEG;AACH,MAAa,aAAc,SAAQ,eAAM;IACvC,YAAoB,MAA0B,EAAE,UAA4B;QAC1E,KAAK,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAC5B,CAAC;IAEM,MAAM,CAAC,MAAM,CAAC,MAA0B;QAC7C,sBAAsB;QACtB,IAAI,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE;YAC9B,OAAO,IAAI,CAAC,WAAW,MAAM,CAAC,WAAW,sBAAsB,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;SAC/E;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,MAA0B;QAClD,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,IAAI,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE;YAC5F,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;SACxD;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,EAAE,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;QACzD,MAAM,EAAE,GAAG,aAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;QACzD,OAAO;YACL,CAAC,IAAI,EAAE,EAAE,CAAC;YACV,CAAC,IAAI,EAAE,EAAE,CAAC;SACX,CAAC;IACJ,CAAC;CACF;AApCD,sCAoCC","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 } from '@fgv/ts-utils';\nimport { Cage, CageId, CellId, IPuzzleDescription, Ids, Puzzle } from '../common';\n\n/**\n * @public\n */\nexport class SudokuXPuzzle extends Puzzle {\n  private constructor(puzzle: IPuzzleDescription, extraCages: [CageId, Cage][]) {\n    super(puzzle, extraCages);\n  }\n\n  public static create(puzzle: IPuzzleDescription): 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    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: IPuzzleDescription): [CageId, Cage][] {\n    const x1Cells: CellId[] = [];\n    const x2Cells: CellId[] = [];\n\n    for (let row = 0, col1 = 0, col2 = puzzle.cols - 1; row < puzzle.rows; row++, col1++, col2--) {\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', 45, x1Cells).orThrow();\n    const x2 = Cage.create(x2Id, 'x', 45, x2Cells).orThrow();\n    return [\n      [x1Id, x1],\n      [x2Id, x2]\n    ];\n  }\n}\n"]}

package/package.json

@@ -0,0 +1,70 @@
+{
+	"name": "@fgv/ts-sudoku-lib",
+	"version": "2.0.2-alpha.0",
+	"description": "Sudoku rules library",
+	"main": "lib/index.js",
+	"types": "dist/ts-json.d.ts",
+	"repository": {
+		"type": "git",
+		"url": "git+https://github.com/ErikFortune/fgv.git"
+	},
+	"keywords": [
+		"typescript",
+		"node"
+	],
+	"author": "Erik Fortune",
+	"license": "MIT",
+	"bugs": {
+		"url": "https://github.com/ErikFortune/fgv/issues"
+	},
+	"homepage": "https://github.com/ErikFortune/fgv/libraries/ts-sudoku-lib#readme",
+	"devDependencies": {
+		"@fgv/ts-json": "2.0.2-alpha.0",
+		"@fgv/ts-utils": "2.0.2-alpha.0",
+		"@fgv/ts-utils-jest": "2.0.2-alpha.0",
+		"@microsoft/api-documenter": "^7.22.14",
+		"@microsoft/api-extractor": "^7.35.2",
+		"@types/jest": "^29.5.2",
+		"@types/node": "^20.2.5",
+		"@typescript-eslint/eslint-plugin": "^5.59.9",
+		"@typescript-eslint/parser": "^5.59.9",
+		"cspell": "^6.31.1",
+		"eslint": "^8.42.0",
+		"eslint-config-prettier": "^8.8.0",
+		"eslint-config-standard": "^17.1.0",
+		"eslint-plugin-header": "^3.1.1",
+		"eslint-plugin-import": "^2.27.5",
+		"eslint-plugin-node": "^11.1.0",
+		"eslint-plugin-prettier": "^4.2.1",
+		"eslint-plugin-promise": "^6.1.1",
+		"jest": "^29.5.0",
+		"prettier": "^2.8.8",
+		"rimraf": "^5.0.1",
+		"ts-jest": "^29.1.0",
+		"ts-node": "^10.9.1",
+		"typescript": "^5.1.3",
+		"eslint-plugin-n": "^16.0.0",
+		"@rushstack/heft": "~0.53.0",
+		"@rushstack/heft-node-rig": "~2.2.3",
+		"@types/heft-jest": "1.0.3",
+		"@rushstack/eslint-config": "~3.3.1",
+		"@rushstack/heft-jest-plugin": "~0.7.4",
+		"eslint-plugin-tsdoc": "~0.2.17"
+	},
+	"peerDependencies": {
+		"@fgv/ts-utils": "^2.0.2-alpha.0",
+		"@fgv/ts-json": "^2.0.2-alpha.0"
+	},
+	"scripts": {
+		"build": "heft test --clean",
+		"clean": "heft clean",
+		"test": "heft test",
+		"build-docs": "api-documenter markdown --input-folder ./temp --output-folder docs",
+		"build-all": "rushx build; rushx build-docs",
+		"test-handles": "jest --runInBand --detectOpenHandles",
+		"clean-jest": "jest --clear-cache",
+		"coverage": "jest --coverage --no-cache",
+		"lint": "eslint src --ext .ts",
+		"fixlint": "eslint src --ext .ts --fix"
+	}
+}