@cubingcenter/scrambler 0.7.0 → 0.8.0

package/README.md

@@ -16,7 +16,7 @@ The package currently ships random-state scramblers for `222` (2x2x2), `333` (3x
 - 3x3 quality: random-state target + two-phase solver + verified scramble inversion
 - Pyraminx quality: random-state target + optimal policy-table solver (all 933,120 core states verified)
 - Skewb quality: random-state target + optimal policy-table solver (all 3,149,280 states; exact uniform sampling)
-- 4x4 quality: random-state target (uniform sampler) + reduction solver (4 phases) + verified scramble inversion
+- 4x4 quality: random-state target (uniform sampler) + reduction solver (4 phases) + exact target reproduction, validated against the sampled state on every generation
 
 This library is intended for practice, training, and internal CubingCenter use. Do not present it as an official WCA competition scrambler; sanctioned competitions must use the official program required by the delegate/organization.
 
@@ -59,7 +59,7 @@ console.log(batch.map((item) => item.scramble));
 
 `generateScramble("333")` returns a legal random-state 3x3 scramble. Its metadata includes the target cubie state, timer-ready facelets, a 54-character facelet string, and solver diagnostics.
 
-`generateScramble("pymx")` returns a legal random-state Pyraminx scramble. Its metadata includes the target state, facelets, solution moves and depth. Pyraminx/2x2/3x3 accept `{ skipValidation: true }` to skip the per-call verification for maximum throughput (the scramble correctness is covered by exhaustive tests).
+`generateScramble("pymx")` returns a legal random-state Pyraminx scramble. Its metadata includes the target state, facelets, solution moves and depth. Pyraminx/2x2/3x3/444 accept `{ skipValidation: true }` to skip the per-call verification for maximum throughput (correctness is covered by the test suite, and independently by `pnpm verify:scrambles`, which re-samples each target from its seed).
 
 ## Scoped imports (web / smaller bundles)
 
@@ -194,7 +194,15 @@ const paired = cube4.areWingsPaired(state);
 
 Supported moves: `U D R L F B` (outer) and `Uw Dw Rw Lw Fw Bw` (wide), each with `'` and `2` suffixes.
 
-The public `generateScramble("444")` path is: sample a uniform random state (`generateRandomCube4State` — corners `8! × 3^7`, wings `24!`, centers as a color multiset `24!/(4!)^6`), solve it with the reduction solver (phases: axis-color face-pairs → ct/rl phase-2 goal → joint center3+pairing → 3x3 finish), and invert the solution — so the scramble always reproduces the sampled target. The pairing pruning table is generated by a C++ tool (`tools/edge3-gen/`).
+The public `generateScramble("444")` path is: sample a uniform random state (`generateRandomCube4State` — corners `8! × 3^7`, wings `24!`, centers as a color multiset `24!/(4!)^6`), solve it with the reduction solver (phases: axis-color face-pairs → ct/rl phase-2 goal → joint center3+pairing → 3x3 finish), and invert the solution — so the scramble always reproduces the sampled target. The production path enforces this on every generation (`assertCube4ScrambleReproducesTarget` re-applies the emitted moves and compares against the state sampled for the seed; a mismatch retries the SAME target — never re-samples, never falls back to random-move). The pairing pruning table is generated by a C++ tool (`tools/edge3-gen/`).
+
+How to verify 444, from cheap to heavy:
+
+- `pnpm test` — model/round-trip tests, the rotation-sensitive invariant (`test/cube4-solve-invariant.test.ts`), and the uniformity net (`test/cube4-uniformity.test.ts`: χ² over a fixed corpus at two layers — direct sampler N=20,000 and full pipeline N=40 with structural checks on parity quadrants and per-slot diversity).
+- `pnpm verify:scrambles 444` — independent replay: the target is re-sampled from the seed and the solution must genuinely solve it.
+- `node --import tsx scripts/uniformity-444.ts --n=500` — heavy χ² bench over the state **reached** by the pipeline (centers/wings/corners per slot, twist, parity quadrants, joint bins); exits 1 below threshold. The corpora are fixed seeds, so the numbers are deterministic; p-values are reference values, not classical significance.
+
+Measured baseline (i5-13420H, warm): 46–53 moves per scramble (avg ≈ 48), latency p50 ≈ 2–3 s / p95 ≈ 9 s, ~37 MB of reduction tables loaded once. Seeded 444 generation is a pure function of `(seed, options)` — search budgets are node counters, not wall deadlines; the only wall-clock code is a pair of hang guards that never bound an observed solve.
 
 Shorter 444 scrambles, two mechanisms: `bestOf: N` solves N independently sampled states and keeps the shortest (trades CPU time, biases toward short-solution states), while `restarts: R` re-runs the full pipeline R times over the SAME state with a deterministically reshuffled search order and keeps the shortest total (uniformity-preserving; measured ~-0.45 moves at R=3, ~-0.85 at R=6 on a 24-state corpus, single-attempt mean ~46.1).
 
@@ -242,9 +250,12 @@ pnpm package:check
 pnpm verify
 ```
 
-Solver tables are versioned as generated binary assets. If cube coordinates, moves, or pruning logic change, regenerate and check them:
+Solver tables are versioned as generated binary assets. If cube coordinates, moves, or pruning logic change, regenerate and check them (the 4x4 reduction tables follow the same pattern, one script per phase):
 
 ```sh
 pnpm cube3:tables
 pnpm cube3:tables:check
+pnpm cube4:center1:tables:check   # likewise center2, center3, edge3, hc
 ```
+
+`pnpm verify` runs lint, the full test suite, the build, every table checksum check (including all five `cube4:*:tables:check`), and the package checks. `pnpm verify:scrambles [--count N] [events…]` additionally replays generated scrambles against independently re-sampled targets and exits 1 on any mismatch.

package/dist/core/api.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"api.d.ts","sourceRoot":"","sources":["../../src/core/api.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EACV,OAAO,EACP,SAAS,EACT,iBAAiB,EACjB,eAAe,EACf,cAAc,EACd,iBAAiB,EAClB,MAAM,YAAY,CAAC;AAEpB;;;;;;;;;;GAUG;AACH,wBAAsB,mBAAmB,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAoCrG;AAED,wBAAgB,yBAAyB,CACvC,SAAS,EAAE,iBAAiB,EAC5B,QAAQ,GAAE,iBAAmC,GAC5C,IAAI,CAEN;AAED,wBAAgB,kBAAkB,CAAC,QAAQ,GAAE,iBAAmC,GAAG,SAAS,EAAE,CAE7F;AAED,wBAAgB,YAAY,CAC1B,OAAO,EAAE,OAAO,EAChB,QAAQ,GAAE,iBAAmC,GAC5C,SAAS,CAQX;AAED,wBAAsB,gBAAgB,CACpC,OAAO,EAAE,OAAO,EAChB,OAAO,GAAE,eAAoB,EAC7B,QAAQ,GAAE,iBAAmC,GAC5C,OAAO,CAAC,cAAc,CAAC,CAiBzB;AAED,wBAAsB,iBAAiB,CACrC,OAAO,EAAE,OAAO,EAChB,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,eAAoB,EAC7B,QAAQ,GAAE,iBAAmC,GAC5C,OAAO,CAAC,cAAc,EAAE,CAAC,CAU3B"}
+{"version":3,"file":"api.d.ts","sourceRoot":"","sources":["../../src/core/api.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EACV,OAAO,EACP,SAAS,EACT,iBAAiB,EACjB,eAAe,EACf,cAAc,EACd,iBAAiB,EAClB,MAAM,YAAY,CAAC;AAEpB;;;;;;;;;;GAUG;AACH,wBAAsB,mBAAmB,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CA4CrG;AAED,wBAAgB,yBAAyB,CACvC,SAAS,EAAE,iBAAiB,EAC5B,QAAQ,GAAE,iBAAmC,GAC5C,IAAI,CAEN;AAED,wBAAgB,kBAAkB,CAAC,QAAQ,GAAE,iBAAmC,GAAG,SAAS,EAAE,CAE7F;AAED,wBAAgB,YAAY,CAC1B,OAAO,EAAE,OAAO,EAChB,QAAQ,GAAE,iBAAmC,GAC5C,SAAS,CAQX;AAED,wBAAsB,gBAAgB,CACpC,OAAO,EAAE,OAAO,EAChB,OAAO,GAAE,eAAoB,EAC7B,QAAQ,GAAE,iBAAmC,GAC5C,OAAO,CAAC,cAAc,CAAC,CAiBzB;AAED,wBAAsB,iBAAiB,CACrC,OAAO,EAAE,OAAO,EAChB,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,eAAoB,EAC7B,QAAQ,GAAE,iBAAmC,GAC5C,OAAO,CAAC,cAAc,EAAE,CAAC,CAU3B"}

package/dist/core/api.js

@@ -39,8 +39,16 @@ export async function initializeScrambler(baseUrl, eventId) {
         await loadBrowserTables(baseUrl);
     }
     else if (eventId === "444") {
-        const { loadCube4ReductionTablesBrowser } = await import("../puzzles/cube4/reduction/browser-loader.js");
-        await loadCube4ReductionTablesBrowser(baseUrl);
+        // Reduction ends with a 3x3 solve in the same worker. Initializing 444
+        // must also load those required tables, including the caller's base URL.
+        const [cube4, cube3] = await Promise.all([
+            import("../puzzles/cube4/reduction/browser-loader.js"),
+            import("../puzzles/cube3/solver/browser-loader.js")
+        ]);
+        await Promise.all([
+            cube4.loadCube4ReductionTablesBrowser(baseUrl),
+            cube3.loadBrowserTables(baseUrl)
+        ]);
     }
     else if (!eventId) {
         await Promise.all([

package/dist/puzzles/cube2/solver/browser-loader.d.ts

@@ -1,12 +1,9 @@
-export declare function getCachedBrowserTables(): {
+export interface Cube2BrowserTables {
     permutationTable: Uint16Array;
     orientationTable: Uint16Array;
     policyTable: Uint8Array;
-} | undefined;
+}
+export declare function getCachedBrowserTables(): Cube2BrowserTables | undefined;
 export declare function clearCachedBrowserTables(): void;
-export declare function loadBrowserTables(baseUrl?: string): Promise<{
-    permutationTable: Uint16Array;
-    orientationTable: Uint16Array;
-    policyTable: Uint8Array;
-}>;
+export declare function loadBrowserTables(baseUrl?: string): Promise<Cube2BrowserTables>;
 //# sourceMappingURL=browser-loader.d.ts.map

package/dist/puzzles/cube2/solver/browser-loader.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"browser-loader.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube2/solver/browser-loader.ts"],"names":[],"mappings":"AAWA,wBAAgB,sBAAsB;sBALlB,WAAW;sBACX,WAAW;iBAChB,UAAU;cAKxB;AAED,wBAAgB,wBAAwB,IAAI,IAAI,CAE/C;AAED,wBAAsB,iBAAiB,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;IACjE,gBAAgB,EAAE,WAAW,CAAC;IAC9B,gBAAgB,EAAE,WAAW,CAAC;IAC9B,WAAW,EAAE,UAAU,CAAC;CACzB,CAAC,CAqBD"}
+{"version":3,"file":"browser-loader.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube2/solver/browser-loader.ts"],"names":[],"mappings":"AAMA,MAAM,WAAW,kBAAkB;IACjC,gBAAgB,EAAE,WAAW,CAAC;IAC9B,gBAAgB,EAAE,WAAW,CAAC;IAC9B,WAAW,EAAE,UAAU,CAAC;CACzB;AAKD,wBAAgB,sBAAsB,IAAI,kBAAkB,GAAG,SAAS,CAEvE;AAED,wBAAgB,wBAAwB,IAAI,IAAI,CAG/C;AAED,wBAAsB,iBAAiB,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAoBrF"}

package/dist/puzzles/cube2/solver/browser-loader.js

@@ -1,23 +1,42 @@
 import { CUBE2_SOLVER_TABLE_METADATA } from "./table-metadata.js";
 import { fetchTableBuffer } from "../../shared/compressed-fetch.js";
 const TABLES_DIR = "puzzles/cube2/solver/generated";
+const CACHE_NAME = "cubingcenter-scrambler-tables-v1";
 let cachedBrowserTables;
+let cachedBrowserTablesPromise;
 export function getCachedBrowserTables() {
     return cachedBrowserTables;
 }
 export function clearCachedBrowserTables() {
     cachedBrowserTables = undefined;
+    cachedBrowserTablesPromise = undefined;
 }
 export async function loadBrowserTables(baseUrl) {
     if (cachedBrowserTables) {
         return cachedBrowserTables;
     }
+    if (cachedBrowserTablesPromise) {
+        // One shared in-flight promise: concurrent calls trigger exactly one
+        // fetch pass (dedup).
+        return cachedBrowserTablesPromise;
+    }
+    const promise = fetchTables(baseUrl);
+    cachedBrowserTablesPromise = promise;
+    promise.then(() => { }, () => {
+        // A failed load must not poison the dedup slot: purge the rejected
+        // promise so a later call retries from scratch.
+        if (cachedBrowserTablesPromise === promise)
+            cachedBrowserTablesPromise = undefined;
+    });
+    return promise;
+}
+async function fetchTables(baseUrl) {
     const resolved = resolveBaseUrl(baseUrl);
     const manifest = await fetchManifest(resolved);
     const [permTable, orientTable, dist] = await Promise.all([
-        fetchUint16Table(resolved, manifest.files.permutationTable, CUBE2_SOLVER_TABLE_METADATA.permutationTable.entries),
-        fetchUint16Table(resolved, manifest.files.orientationTable, CUBE2_SOLVER_TABLE_METADATA.orientationTable.entries),
-        fetchUint8Table(resolved, manifest.files.policy, CUBE2_SOLVER_TABLE_METADATA.policy.entries)
+        fetchUint16Table(resolved, manifest.files.permutationTable, CUBE2_SOLVER_TABLE_METADATA.permutationTable),
+        fetchUint16Table(resolved, manifest.files.orientationTable, CUBE2_SOLVER_TABLE_METADATA.orientationTable),
+        fetchUint8Table(resolved, manifest.files.policy, CUBE2_SOLVER_TABLE_METADATA.policy)
     ]);
     cachedBrowserTables = {
         permutationTable: permTable,
@@ -51,22 +70,31 @@ async function fetchManifest(baseUrl) {
     }
     return manifest;
 }
-async function fetchUint16Table(baseUrl, entry, expectedEntries) {
-    const buffer = await fetchTableBuffer(baseUrl, TABLES_DIR, entry.file, { compressed: entry.compressed !== false });
-    if (buffer.byteLength !== expectedEntries * 2) {
-        throw new Error(`Invalid byte size for ${entry.file}`);
-    }
-    const values = new Uint16Array(expectedEntries);
+/**
+ * Fetch + verify with the SAME checks as node-loader.ts: byte length from
+ * the manifest entries, FNV-1a checksum against the table-metadata
+ * constants (the values node asserts against).
+ */
+async function fetchUint16Table(baseUrl, entry, meta) {
+    const buffer = await fetchTableBuffer(baseUrl, TABLES_DIR, entry.file, {
+        cacheName: CACHE_NAME,
+        compressed: entry.compressed !== false,
+        expectedBytes: entry.entries * 2,
+        expectedFnv1a: { value: meta.checksum, elementSize: 2 }
+    });
+    const values = new Uint16Array(entry.entries);
     const view = new DataView(buffer);
     for (let i = 0; i < values.length; i++) {
         values[i] = view.getUint16(i * 2, true);
     }
     return values;
 }
-async function fetchUint8Table(baseUrl, entry, expectedEntries) {
-    const buffer = await fetchTableBuffer(baseUrl, TABLES_DIR, entry.file, { compressed: entry.compressed !== false });
-    if (buffer.byteLength !== expectedEntries) {
-        throw new Error(`Invalid byte size for ${entry.file}`);
-    }
+async function fetchUint8Table(baseUrl, entry, meta) {
+    const buffer = await fetchTableBuffer(baseUrl, TABLES_DIR, entry.file, {
+        cacheName: CACHE_NAME,
+        compressed: entry.compressed !== false,
+        expectedBytes: entry.entries,
+        expectedFnv1a: { value: meta.checksum, elementSize: 1 }
+    });
     return new Uint8Array(buffer);
 }

package/dist/puzzles/cube2/solver/generated-assets.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"generated-assets.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube2/solver/generated-assets.ts"],"names":[],"mappings":"AAYA,wBAAsB,8BAA8B,IAAI,OAAO,CAAC;IAC9D,gBAAgB,EAAE,WAAW,CAAC;IAC9B,gBAAgB,EAAE,WAAW,CAAC;IAC9B,WAAW,EAAE,UAAU,CAAC;CACzB,CAAC,CAeD"}
+{"version":3,"file":"generated-assets.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube2/solver/generated-assets.ts"],"names":[],"mappings":"AAkBA,wBAAsB,8BAA8B,IAAI,OAAO,CAAC;IAC9D,gBAAgB,EAAE,WAAW,CAAC;IAC9B,gBAAgB,EAAE,WAAW,CAAC;IAC9B,WAAW,EAAE,UAAU,CAAC;CACzB,CAAC,CAcD"}

package/dist/puzzles/cube2/solver/generated-assets.js

@@ -1,5 +1,11 @@
 import { getCachedBrowserTables } from "./browser-loader.js";
-let cachedTables;
+import { loadOnce } from "../../shared/load-once.js";
+// One shared in-flight promise for the node fs load (same pattern as
+// cube3/solver/generated-assets.ts): the previous `cached ??= await …` raced —
+// concurrent callers interleaving on the await both ran `loadNodeTables()`
+// (two filesystem reads, last assignment wins). On rejection the slot is
+// purged so the next call can retry.
+const nodeTablesSlot = { promise: undefined };
 function isBrowser() {
     return typeof self !== "undefined";
 }
@@ -13,8 +19,7 @@ export async function loadGeneratedCube2SolverTables() {
             "In browser environments, call `initializeScrambler(baseUrl)` " +
             "before generating scrambles.");
     }
-    cachedTables ??= await loadNodeTables();
-    return cachedTables;
+    return loadOnce(nodeTablesSlot, loadNodeTables);
 }
 async function loadNodeTables() {
     const loader = await import(

package/dist/puzzles/cube3/solver/browser-loader.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"browser-loader.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube3/solver/browser-loader.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAMV,iBAAiB,EAClB,MAAM,aAAa,CAAC;AAsDrB,wBAAgB,sBAAsB,IAAI,iBAAiB,GAAG,SAAS,CAEtE;AAED,wBAAgB,wBAAwB,IAAI,IAAI,CAE/C;AAED,wBAAsB,iBAAiB,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,CAAC,CA2CpF"}
+{"version":3,"file":"browser-loader.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube3/solver/browser-loader.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAMV,iBAAiB,EAClB,MAAM,aAAa,CAAC;AAuDrB,wBAAgB,sBAAsB,IAAI,iBAAiB,GAAG,SAAS,CAEtE;AAED,wBAAgB,wBAAwB,IAAI,IAAI,CAG/C;AAED,wBAAsB,iBAAiB,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAoBpF"}

package/dist/puzzles/cube3/solver/browser-loader.js

@@ -2,6 +2,7 @@ import { fetchTableBuffer } from "../../shared/compressed-fetch.js";
 const TABLES_DIR = "puzzles/cube3/solver/generated";
 const CACHE_NAME = "cubingcenter-scrambler-tables-v1";
 let browserTables;
+let browserTablesPromise;
 function resolveBaseUrl(provided) {
     if (provided) {
         return provided.replace(/\/$/, "");
@@ -20,11 +21,28 @@ export function getCachedBrowserTables() {
 }
 export function clearCachedBrowserTables() {
     browserTables = undefined;
+    browserTablesPromise = undefined;
 }
 export async function loadBrowserTables(baseUrl) {
     if (browserTables) {
         return browserTables;
     }
+    if (browserTablesPromise) {
+        // One shared in-flight promise: concurrent calls trigger exactly one
+        // fetch pass (dedup).
+        return browserTablesPromise;
+    }
+    const promise = fetchTables(baseUrl);
+    browserTablesPromise = promise;
+    promise.then(() => { }, () => {
+        // A failed load must not poison the dedup slot: purge the rejected
+        // promise so a later call retries from scratch.
+        if (browserTablesPromise === promise)
+            browserTablesPromise = undefined;
+    });
+    return promise;
+}
+async function fetchTables(baseUrl) {
     const resolvedBase = resolveBaseUrl(baseUrl);
     const manifest = await fetchManifest(resolvedBase);
     browserTables = {
@@ -58,19 +76,15 @@ async function fetchJointTables(baseUrl, entries) {
         return undefined;
     }
     const fetchJoint = async (entry) => {
+        // Verified by fetchTableBuffer with the SAME checks as node-loader.ts:
+        // nibble-packed byte length + FNV-1a over the packed bytes.
         const buffer = await fetchTableBuffer(baseUrl, TABLES_DIR, entry.file, {
             cacheName: CACHE_NAME,
-            compressed: entry.compressed !== false
+            compressed: entry.compressed !== false,
+            expectedBytes: Math.ceil((entry.rangeA * entry.rangeB) / 2),
+            expectedFnv1a: { value: entry.checksum, elementSize: 1 }
         });
-        const expectedBytes = Math.ceil((entry.rangeA * entry.rangeB) / 2);
-        if (buffer.byteLength !== expectedBytes) {
-            throw new Error(`Invalid byte size for ${entry.file}.`);
-        }
-        const values = new Uint8Array(buffer);
-        if (checksum(values) !== entry.checksum) {
-            throw new Error(`Checksum mismatch for ${entry.file}.`);
-        }
-        return values;
+        return new Uint8Array(buffer);
     };
     return {
         jointUdCo: await fetchJoint(entries.udCo),
@@ -90,11 +104,15 @@ async function fetchManifest(baseUrl) {
     return manifest;
 }
 async function fetchMoveTable(baseUrl, entry) {
-    const buffer = await fetchTableBuffer(baseUrl, TABLES_DIR, entry.file, { cacheName: CACHE_NAME, compressed: entry.compressed !== false });
-    const expectedBytes = entry.range * entry.moves.length * 4;
-    if (buffer.byteLength !== expectedBytes) {
-        throw new Error(`Invalid byte size for ${entry.coordinate} move table.`);
-    }
+    // Verified by fetchTableBuffer with the SAME checks as node-loader.ts:
+    // int32 wire length + FNV-1a over the decoded coordinate values (element
+    // size 4 reproduces node's hash over the uint16 values — same numbers).
+    const buffer = await fetchTableBuffer(baseUrl, TABLES_DIR, entry.file, {
+        cacheName: CACHE_NAME,
+        compressed: entry.compressed !== false,
+        expectedBytes: entry.range * entry.moves.length * 4,
+        expectedFnv1a: { value: entry.checksum, elementSize: 4 }
+    });
     const values = new Uint16Array(entry.range * entry.moves.length);
     const view = new DataView(buffer);
     for (let index = 0; index < values.length; index += 1) {
@@ -114,11 +132,15 @@ async function fetchMoveTable(baseUrl, entry) {
     };
 }
 async function fetchPruningTable(baseUrl, entry) {
-    const buffer = await fetchTableBuffer(baseUrl, TABLES_DIR, entry.file, { cacheName: CACHE_NAME, compressed: entry.compressed !== false });
-    const expectedBytes = Math.ceil(entry.range / 2);
-    if (buffer.byteLength !== expectedBytes) {
-        throw new Error(`Invalid byte size for ${entry.coordinate} pruning table.`);
-    }
+    // Verified by fetchTableBuffer with the SAME checks as node-loader.ts:
+    // nibble-packed byte length + FNV-1a over the packed bytes (this browser
+    // path did NOT compare the pruning checksum before — only the length).
+    const buffer = await fetchTableBuffer(baseUrl, TABLES_DIR, entry.file, {
+        cacheName: CACHE_NAME,
+        compressed: entry.compressed !== false,
+        expectedBytes: Math.ceil(entry.range / 2),
+        expectedFnv1a: { value: entry.checksum, elementSize: 1 }
+    });
     const values = new Uint8Array(buffer);
     return {
         coordinate: entry.coordinate,

package/dist/puzzles/cube3/solver/generated-assets.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"generated-assets.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube3/solver/generated-assets.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAEV,iBAAiB,EACjB,iBAAiB,EACjB,iBAAiB,EAClB,MAAM,aAAa,CAAC;AASrB,wBAAsB,8BAA8B,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAejF;AAWD,wBAAsB,8BAA8B,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAkBjF;AAED,wBAAsB,8BAA8B,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAkBjF"}
+{"version":3,"file":"generated-assets.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube3/solver/generated-assets.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAEV,iBAAiB,EACjB,iBAAiB,EACjB,iBAAiB,EAClB,MAAM,aAAa,CAAC;AAgBrB,wBAAsB,8BAA8B,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAcjF;AAWD,wBAAsB,8BAA8B,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAkBjF;AAED,wBAAsB,8BAA8B,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAkBjF"}

package/dist/puzzles/cube3/solver/generated-assets.js

@@ -1,8 +1,15 @@
 import { getCachedBrowserTables } from "./browser-loader.js";
-let cachedGeneratedTables;
+import { loadOnce } from "../../shared/load-once.js";
 function isBrowser() {
     return typeof self !== "undefined";
 }
+// One shared in-flight promise for the node fs load: mixed concurrent
+// phase-1 + phase-2 loads (separate slots in tables.ts) converge on ONE
+// `readGeneratedCube3SolverTables()` call. The previous `cached ??= await …`
+// raced — two callers interleaving on the await both ran `loadNodeTables()`
+// (two filesystem reads, two table sets, last assignment wins). On
+// rejection the slot is purged so the next call can retry.
+const nodeTablesSlot = { promise: undefined };
 export async function loadGeneratedCube3SolverTables() {
     if (isBrowser()) {
         const browserTables = getCachedBrowserTables();
@@ -13,8 +20,7 @@ export async function loadGeneratedCube3SolverTables() {
             "In browser environments, call `initializeScrambler(baseUrl)` " +
             "before generating scrambles.");
     }
-    cachedGeneratedTables ??= await loadNodeTables();
-    return cachedGeneratedTables;
+    return loadOnce(nodeTablesSlot, loadNodeTables);
 }
 async function loadNodeTables() {
     const loader = await import(

package/dist/puzzles/cube3/solver/phase1.d.ts

@@ -7,7 +7,20 @@ export interface Cube3Phase1Coordinates {
 }
 export interface Cube3Phase1Options {
     maxDepth?: number;
+    /**
+     * Legacy wall-clock deadline (checked every 1024 nodes). The stopping
+     * point — and therefore the result — depends on machine speed and CPU
+     * load. Prefer `maxNodes` when the caller needs a reproducible outcome.
+     */
     timeoutMs?: number;
+    /**
+     * Deterministic work cap: stop after visiting this many nodes (checked on
+     * every node; overshoot ≤ 1). The result then depends only on
+     * (state, tables, budgets) — never on the clock — so the same input
+     * yields the same solution under any CPU load. Composes with `timeoutMs`
+     * when both are set (whichever trips first stops the search).
+     */
+    maxNodes?: number;
     tables?: Cube3Phase1Tables;
     /** Phase-1 joint tables (ud x co / ud x eo), experimental. */
     jointTables?: Cube3JointTables | undefined;
@@ -32,6 +45,12 @@ export interface Cube3Phase1CollectOptions {
     /** Phase-1 joint tables (ud x co / ud x eo), experimental. */
     jointTables?: Cube3JointTables | undefined;
     timeoutMs?: number;
+    /**
+     * Deterministic node budget for this enumeration (see
+     * `Cube3Phase1Options.maxNodes`). Preferred over `timeoutMs` when the
+     * collected set must not depend on CPU load.
+     */
+    maxNodes?: number;
     /** Stop after collecting this many solutions. Defaults to 32. */
     limit?: number;
 }

package/dist/puzzles/cube3/solver/phase1.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"phase1.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube3/solver/phase1.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAMzD,OAAO,KAAK,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAOvE,MAAM,WAAW,sBAAsB;IACrC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,MAAM,CAAC;IACxB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,MAAM,CAAC,EAAE,iBAAiB,CAAC;IAC3B,8DAA8D;IAC9D,WAAW,CAAC,EAAE,gBAAgB,GAAG,SAAS,CAAC;CAC5C;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,UAAU,CAAC;IAClB,WAAW,EAAE,sBAAsB,CAAC;IACpC,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,qBAAa,sBAAuB,SAAQ,KAAK;IAC/C,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;gBAElB,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;CAKlD;AAyCD,wBAAsB,gBAAgB,CACpC,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE,kBAAuB,GAC/B,OAAO,CAAC,iBAAiB,CAAC,CA2E5B;AAED,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,UAAU,GAAG,sBAAsB,CAMtF;AAED,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,UAAU,GAAG,sBAAsB,EAC1C,MAAM,EAAE,iBAAiB,GACxB,OAAO,CAQT;AAED,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,SAAS,SAAS,EAAE,GAC1B,UAAU,CAEZ;AA0ED,MAAM,WAAW,yBAAyB;IACxC,MAAM,CAAC,EAAE,iBAAiB,CAAC;IAC3B,8DAA8D;IAC9D,WAAW,CAAC,EAAE,gBAAgB,GAAG,SAAS,CAAC;IAC3C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iEAAiE;IACjE,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;;GAKG;AACH,wBAAsB,2BAA2B,CAC/C,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,yBAA8B,GACtC,OAAO,CAAC;IAAE,SAAS,EAAE,SAAS,EAAE,EAAE,CAAC;IAAC,YAAY,EAAE,MAAM,CAAA;CAAE,CAAC,CAqB7D"}
+{"version":3,"file":"phase1.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube3/solver/phase1.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAMzD,OAAO,KAAK,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAOvE,MAAM,WAAW,sBAAsB;IACrC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,MAAM,CAAC;IACxB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;;OAMG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,iBAAiB,CAAC;IAC3B,8DAA8D;IAC9D,WAAW,CAAC,EAAE,gBAAgB,GAAG,SAAS,CAAC;CAC5C;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,UAAU,CAAC;IAClB,WAAW,EAAE,sBAAsB,CAAC;IACpC,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,qBAAa,sBAAuB,SAAQ,KAAK;IAC/C,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;gBAElB,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;CAKlD;AA4CD,wBAAsB,gBAAgB,CACpC,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE,kBAAuB,GAC/B,OAAO,CAAC,iBAAiB,CAAC,CAwF5B;AAED,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,UAAU,GAAG,sBAAsB,CAMtF;AAED,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,UAAU,GAAG,sBAAsB,EAC1C,MAAM,EAAE,iBAAiB,GACxB,OAAO,CAQT;AAED,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,SAAS,SAAS,EAAE,GAC1B,UAAU,CAEZ;AAyFD,MAAM,WAAW,yBAAyB;IACxC,MAAM,CAAC,EAAE,iBAAiB,CAAC;IAC3B,8DAA8D;IAC9D,WAAW,CAAC,EAAE,gBAAgB,GAAG,SAAS,CAAC;IAC3C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,iEAAiE;IACjE,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;;GAKG;AACH,wBAAsB,2BAA2B,CAC/C,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,yBAA8B,GACtC,OAAO,CAAC;IAAE,SAAS,EAAE,SAAS,EAAE,EAAE,CAAC;IAAC,YAAY,EAAE,MAAM,CAAA;CAAE,CAAC,CA2B7D"}

package/dist/puzzles/cube3/solver/phase1.js

@@ -28,7 +28,7 @@ export async function solveCube3Phase1(state, options = {}) {
     const maxDepth = options.maxDepth ?? 12;
     const start = encodeCube3Phase1Coordinates(state);
     const deadline = options.timeoutMs === undefined ? undefined : performance.now() + options.timeoutMs;
-    const context = createPhase1SearchContext(tables, jointTables, maxDepth, deadline);
+    const context = createPhase1SearchContext(tables, jointTables, maxDepth, deadline, options.maxNodes);
     if (await isCube3Phase1Solved(start, tables)) {
         return {
             moves: [],
@@ -70,6 +70,9 @@ export async function solveCube3Phase1(state, options = {}) {
                 visitedNodes: context.visitedNodes
             };
         }
+        if (context.nodesExceeded) {
+            throw new Cube3Phase1SearchError(`3x3 Phase 1 node budget exceeded (${options.maxNodes} nodes).`, context.visitedNodes);
+        }
         if (context.timedOut) {
             throw new Cube3Phase1SearchError(`3x3 Phase 1 search timed out after ${options.timeoutMs}ms.`, context.visitedNodes);
         }
@@ -100,8 +103,17 @@ const PHASE1_MOVE_FACES = CUBE3_PHASE1_MOVES.map((move) => {
 });
 function searchPhase1(cornerOrientation, edgeOrientation, udSlice, previousFace, previousPreviousFace, remainingDepth, path, context) {
     context.visitedNodes += 1;
-    if (context.deadline !== undefined && (context.visitedNodes & 1023) === 0 && performance.now() > context.deadline) {
+    if (context.nodeCap !== undefined &&
+        context.visitedNodes > context.nodeCap) {
+        context.nodesExceeded = true;
+    }
+    if (!context.nodesExceeded &&
+        context.deadline !== undefined &&
+        (context.visitedNodes & 1023) === 0 &&
+        performance.now() > context.deadline) {
         context.timedOut = true;
+    }
+    if (context.timedOut || context.nodesExceeded) {
         return false;
     }
     if (remainingDepth === 0) {
@@ -124,7 +136,7 @@ function searchPhase1(cornerOrientation, edgeOrientation, udSlice, previousFace,
             return true;
         }
         path.pop();
-        if (context.timedOut) {
+        if (context.timedOut || context.nodesExceeded) {
             return false;
         }
     }
@@ -141,13 +153,13 @@ export async function collectCube3Phase1Solutions(state, depth, options = {}) {
     const jointTables = options.jointTables ?? tables.jointTables;
     const limit = options.limit ?? 32;
     const deadline = options.timeoutMs === undefined ? undefined : performance.now() + options.timeoutMs;
-    const context = createPhase1SearchContext(tables, jointTables, depth, deadline);
+    const context = createPhase1SearchContext(tables, jointTables, depth, deadline, options.maxNodes);
     const start = encodeCube3Phase1Coordinates(state);
     const solutions = [];
     searchPhase1Collect(start.cornerOrientation, start.edgeOrientation, start.udSlice, -1, -1, depth, [], solutions, limit, context);
     return { solutions, visitedNodes: context.visitedNodes };
 }
-function createPhase1SearchContext(tables, jointTables, maxDepth, deadline) {
+function createPhase1SearchContext(tables, jointTables, maxDepth, deadline, nodeCap) {
     const scratchLevels = maxDepth + 1;
     const scratchSize = scratchLevels * CUBE3_PHASE1_MOVES.length;
     return {
@@ -155,8 +167,10 @@ function createPhase1SearchContext(tables, jointTables, maxDepth, deadline) {
         jointTables,
         maxDepth,
         deadline,
+        nodeCap,
         visitedNodes: 0,
         timedOut: false,
+        nodesExceeded: false,
         scratchMove: new Int32Array(scratchSize),
         scratchBound: new Int32Array(scratchSize),
         scratchCo: new Int32Array(scratchSize),
@@ -252,8 +266,17 @@ function collectPhase1Children(cornerOrientation, edgeOrientation, udSlice, prev
  */
 function searchPhase1Collect(cornerOrientation, edgeOrientation, udSlice, previousFace, previousPreviousFace, remainingDepth, path, solutions, limit, context) {
     context.visitedNodes += 1;
-    if (context.deadline !== undefined && (context.visitedNodes & 1023) === 0 && performance.now() > context.deadline) {
+    if (context.nodeCap !== undefined &&
+        context.visitedNodes > context.nodeCap) {
+        context.nodesExceeded = true;
+    }
+    if (!context.nodesExceeded &&
+        context.deadline !== undefined &&
+        (context.visitedNodes & 1023) === 0 &&
+        performance.now() > context.deadline) {
         context.timedOut = true;
+    }
+    if (context.timedOut || context.nodesExceeded) {
         return true;
     }
     if (remainingDepth === 0) {

package/dist/puzzles/cube3/solver/phase2.d.ts

@@ -9,7 +9,18 @@ export interface Cube3Phase2Coordinates {
 }
 export interface Cube3Phase2Options {
     maxDepth?: number;
+    /**
+     * Legacy wall-clock deadline (checked every 1024 nodes): the stopping
+     * point — and the result — depends on machine speed and CPU load.
+     * Prefer `maxNodes` for reproducible outcomes.
+     */
     timeoutMs?: number;
+    /**
+     * Deterministic work cap: stop after visiting this many nodes (checked
+     * on every node; overshoot ≤ 1). Same input + same cap ⇒ same result
+     * regardless of load/clock. Composes with `timeoutMs` when both are set.
+     */
+    maxNodes?: number;
     tables?: Cube3Phase2Tables;
     /** Combined (cp x uep) pair-distance pruning tables (experimental). */
     pairTables?: Cube3PairTables | undefined;
@@ -63,8 +74,25 @@ export interface Cube3SolveOptions {
      * Per-candidate phase-2 budget (ms) inside the improvement loop.
      * Defaults to `phase2.timeoutMs` when set, else 25. The initial solve
      * always uses `phase2.timeoutMs` untouched, so this never starves it.
+     * Legacy wall-clock; superseded by `improvePhase2MaxNodes`.
      */
     improvePhase2TimeoutMs?: number;
+    /**
+     * Deterministic node budget for the improvement loop (phase-1 collection
+     * + candidate phase-2 searches), counted as visited search nodes across
+     * the whole loop of ONE solve call. When set, the wall deadline
+     * (`timeoutMs`, default 800 ms) is NOT armed: the returned solution
+     * depends only on (state, tables, budgets) and is reproducible under any
+     * CPU load — this is the mode the 4x4 finish uses.
+     */
+    improveMaxNodes?: number;
+    /**
+     * Deterministic per-candidate phase-2 node cap inside the improvement
+     * loop (counterpart of `improvePhase2TimeoutMs`). Defaults to
+     * `phase2.maxNodes` when set, else the shared `improveMaxNodes`
+     * remainder. Ignored unless `improveMaxNodes` is set.
+     */
+    improvePhase2MaxNodes?: number;
     /**
      * Solve rotated copies of the state and keep the shortest solution
      * (1 = UD only, 3 = UD/x/z triple, up to 24 for the full rotation

package/dist/puzzles/cube3/solver/phase2.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"phase2.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube3/solver/phase2.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAezD,OAAO,KAAK,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AACzE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAarD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAQ9D,MAAM,WAAW,sBAAsB;IACrC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,MAAM,CAAC,EAAE,iBAAiB,CAAC;IAC3B,uEAAuE;IACvE,UAAU,CAAC,EAAE,eAAe,GAAG,SAAS,CAAC;IACzC;;;;;;OAMG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,oBAAoB,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,UAAU,CAAC;IAClB,WAAW,EAAE,sBAAsB,CAAC;IACpC,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,MAAM,iBAAiB,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,CAAC;AAE1D,MAAM,WAAW,iBAAiB;IAChC,MAAM,CAAC,EAAE,kBAAkB,CAAC;IAC5B,MAAM,CAAC,EAAE,kBAAkB,CAAC;IAC5B,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;;;OAOG;IACH,OAAO,CAAC,EAAE,iBAAiB,CAAC;IAC5B;;;;;;OAMG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B;;;OAGG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B;;;;OAIG;IACH,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC;;;;;;OAMG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,gBAAgB;IAC/B,MAAM,EAAE,iBAAiB,CAAC;IAC1B,MAAM,EAAE,iBAAiB,CAAC;IAC1B,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,UAAU,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,qBAAa,sBAAuB,SAAQ,KAAK;IAC/C,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;gBAElB,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;CAKlD;AAyCD,wBAAsB,gBAAgB,CACpC,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE,kBAAuB,GAC/B,OAAO,CAAC,iBAAiB,CAAC,CAiF5B;AAED,wBAAsB,eAAe,CACnC,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE,iBAAsB,GAC9B,OAAO,CAAC,gBAAgB,CAAC,CAmK3B;AA8CD,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,UAAU,GAAG,sBAAsB,CAMtF;AAED,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,UAAU,GAAG,sBAAsB,GAAG,OAAO,CAQvF;AAED,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,SAAS,SAAS,EAAE,GAC1B,UAAU,CAEZ"}
+{"version":3,"file":"phase2.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube3/solver/phase2.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAezD,OAAO,KAAK,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AACzE,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAarD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAQ9D,MAAM,WAAW,sBAAsB;IACrC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,iBAAiB,CAAC;IAC3B,uEAAuE;IACvE,UAAU,CAAC,EAAE,eAAe,GAAG,SAAS,CAAC;IACzC;;;;;;OAMG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,oBAAoB,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,iBAAiB;IAChC,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,UAAU,CAAC;IAClB,WAAW,EAAE,sBAAsB,CAAC;IACpC,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,MAAM,iBAAiB,GAAG,MAAM,GAAG,OAAO,GAAG,MAAM,CAAC;AAE1D,MAAM,WAAW,iBAAiB;IAChC,MAAM,CAAC,EAAE,kBAAkB,CAAC;IAC5B,MAAM,CAAC,EAAE,kBAAkB,CAAC;IAC5B,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;;;;OAOG;IACH,OAAO,CAAC,EAAE,iBAAiB,CAAC;IAC5B;;;;;;OAMG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B;;;OAGG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B;;;;;OAKG;IACH,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC;;;;;;;OAOG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;;;OAKG;IACH,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAC/B;;;;;;OAMG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,gBAAgB;IAC/B,MAAM,EAAE,iBAAiB,CAAC;IAC1B,MAAM,EAAE,iBAAiB,CAAC;IAC1B,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,UAAU,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED,qBAAa,sBAAuB,SAAQ,KAAK;IAC/C,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;gBAElB,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM;CAKlD;AA4CD,wBAAsB,gBAAgB,CACpC,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE,kBAAuB,GAC/B,OAAO,CAAC,iBAAiB,CAAC,CA8F5B;AAED,wBAAsB,eAAe,CACnC,KAAK,EAAE,UAAU,EACjB,OAAO,GAAE,iBAAsB,GAC9B,OAAO,CAAC,gBAAgB,CAAC,CAyM3B;AA8CD,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,UAAU,GAAG,sBAAsB,CAMtF;AAED,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,UAAU,GAAG,sBAAsB,GAAG,OAAO,CAQvF;AAED,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,UAAU,EACjB,KAAK,EAAE,SAAS,SAAS,EAAE,GAC1B,UAAU,CAEZ"}