@cubingcenter/scrambler 0.7.0 → 0.8.0

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

@@ -46,7 +46,7 @@ export async function solveCube3Phase2(state, options = {}) {
     const maxDepth = options.maxDepth ?? 18;
     const start = encodeCube3Phase2Coordinates(state);
     const deadline = options.timeoutMs === undefined ? undefined : performance.now() + options.timeoutMs;
-    const context = createPhase2SearchContext(tables, pairTables, maxDepth, deadline);
+    const context = createPhase2SearchContext(tables, pairTables, maxDepth, deadline, options.maxNodes);
     const spRange = tables.moveTables.slicePermutation.range;
     const cpspTable = tables.pruningTables.cornerPermutationSlicePermutation.values;
     const epspTable = tables.pruningTables.udEdgePermutationSlicePermutation.values;
@@ -77,6 +77,9 @@ export async function solveCube3Phase2(state, options = {}) {
                 visitedNodes: context.visitedNodes
             };
         }
+        if (context.nodesExceeded) {
+            throw new Cube3Phase2SearchError(`3x3 Phase 2 node budget exceeded (${options.maxNodes} nodes).`, context.visitedNodes);
+        }
         if (context.timedOut) {
             throw new Cube3Phase2SearchError(`3x3 Phase 2 search timed out after ${options.timeoutMs}ms.`, context.visitedNodes);
         }
@@ -117,7 +120,19 @@ export async function solveCube3State(state, options = {}) {
         const p2Tables = options.phase2?.tables ?? await loadCube3Phase2Tables();
         const scoredPairTables = options.phase2?.pairTables ??
             (options.phase2?.skipPairTables ? undefined : await loadCube3PairTables());
-        const deadline = performance.now() + (options.timeoutMs ?? 800);
+        // Work budget for the improvement loop. Preferred: `improveMaxNodes`
+        // (deterministic node counter — the wall deadline stays unarmed so the
+        // outcome cannot depend on CPU load/clock). Legacy: `timeoutMs ?? 800`
+        // wall deadline, kept for existing callers.
+        const nodeMode = options.improveMaxNodes !== undefined;
+        let remainingNodes = options.improveMaxNodes ?? 0;
+        const deadline = nodeMode ? undefined : performance.now() + (options.timeoutMs ?? 800);
+        const budgetExhausted = () => nodeMode ? remainingNodes <= 0 : performance.now() > deadline;
+        const spendNodes = (used) => {
+            if (nodeMode) {
+                remainingNodes = Math.max(0, remainingNodes - used);
+            }
+        };
         const p2SpRange = p2Tables.moveTables.slicePermutation.range;
         const p2cpsp = p2Tables.pruningTables.cornerPermutationSlicePermutation.values;
         const p2uepsp = p2Tables.pruningTables.udEdgePermutationSlicePermutation.values;
@@ -129,18 +144,21 @@ export async function solveCube3State(state, options = {}) {
         const minDepth = phase1.depth;
         const scored = [];
         for (let d = minDepth; d <= minDepth + improveDepths && d < bestMoves.length; d++) {
-            if (performance.now() > deadline)
+            if (budgetExhausted())
                 break;
             const { solutions: p1Solutions, visitedNodes } = await collectCube3Phase1Solutions(state, d, {
                 tables: p1Tables,
                 limit: solutionLimit,
-                timeoutMs: Math.max(1, deadline - performance.now())
+                ...(nodeMode
+                    ? { maxNodes: Math.max(1, remainingNodes) }
+                    : { timeoutMs: Math.max(1, deadline - performance.now()) })
             });
             improvementNodes += visitedNodes;
-            if (performance.now() > deadline)
+            spendNodes(visitedNodes);
+            if (budgetExhausted())
                 break;
             for (const p1Moves of p1Solutions) {
-                if (performance.now() > deadline)
+                if (budgetExhausted())
                     break;
                 if (p1Moves.length >= bestMoves.length)
                     continue;
@@ -177,7 +195,7 @@ export async function solveCube3State(state, options = {}) {
         // Sort ALL candidates globally across depths by admissible total lower bound
         scored.sort((left, right) => left.est - right.est);
         for (const cand of scored) {
-            if (performance.now() > deadline)
+            if (budgetExhausted())
                 break;
             // Prune: since candidates are sorted by est, no subsequent candidate can beat bestMoves.length
             if (cand.est >= bestMoves.length)
@@ -186,19 +204,31 @@ export async function solveCube3State(state, options = {}) {
             if (maxP2 <= 0)
                 continue;
             try {
-                const remainingBudget = Math.max(1, deadline - performance.now());
-                const attemptTimeout = options.improvePhase2TimeoutMs ??
-                    options.phase2?.timeoutMs ?? 25;
+                // Strip any legacy wall `timeoutMs` from the spread: in node mode
+                // the wall deadline must not be armed at all (pure function of
+                // budgets); in wall mode the per-candidate cap below re-adds it.
+                const phase2Source = options.phase2 ?? {};
+                const { timeoutMs: legacyPhase2Wall, ...phase2CandidateBase } = phase2Source;
+                // Per-candidate budget: node cap (deterministic) when the loop runs
+                // on `improveMaxNodes`, else the legacy wall cap.
+                const candidateCap = nodeMode
+                    ? {
+                        maxNodes: Math.max(1, Math.min(options.improvePhase2MaxNodes ?? phase2CandidateBase.maxNodes ?? remainingNodes, remainingNodes))
+                    }
+                    : {
+                        timeoutMs: Math.min(options.improvePhase2TimeoutMs ?? legacyPhase2Wall ?? 25, Math.max(1, deadline - performance.now()))
+                    };
                 const candP2 = await solveCube3Phase2(cand.state, {
-                    ...options.phase2,
+                    ...phase2CandidateBase,
                     pairTables: scoredPairTables,
                     tables: p2Tables,
                     maxDepth: maxP2,
                     previousFace: cand.pFace,
                     previousPreviousFace: cand.ppFace,
-                    timeoutMs: Math.min(attemptTimeout, remainingBudget)
+                    ...candidateCap
                 });
                 improvementNodes += candP2.visitedNodes;
+                spendNodes(candP2.visitedNodes);
                 const candTotal = cand.moves.length + candP2.moves.length;
                 if (candTotal < bestMoves.length) {
                     bestMoves = [...cand.moves, ...candP2.moves];
@@ -292,7 +322,7 @@ const PHASE2_MOVE_FACES = CUBE3_PHASE2_MOVES.map((move) => {
     const char = move[0];
     return char === "U" ? 0 : char === "D" ? 1 : char === "R" ? 2 : char === "L" ? 3 : char === "F" ? 4 : 5;
 });
-function createPhase2SearchContext(tables, pairTables, maxDepth, deadline) {
+function createPhase2SearchContext(tables, pairTables, maxDepth, deadline, nodeCap = undefined) {
     const scratchLevels = maxDepth + 1;
     const scratchSize = scratchLevels * CUBE3_PHASE2_MOVES.length;
     return {
@@ -300,8 +330,10 @@ function createPhase2SearchContext(tables, pairTables, maxDepth, deadline) {
         pairTables,
         maxDepth,
         deadline,
+        nodeCap,
         visitedNodes: 0,
         timedOut: false,
+        nodesExceeded: false,
         scratchMove: new Int32Array(scratchSize),
         scratchBound: new Int32Array(scratchSize),
         scratchCp: new Int32Array(scratchSize),
@@ -311,8 +343,17 @@ function createPhase2SearchContext(tables, pairTables, maxDepth, deadline) {
 }
 function searchPhase2(cornerPermutation, udEdgePermutation, slicePermutation, 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) {
@@ -403,7 +444,7 @@ function searchPhase2(cornerPermutation, udEdgePermutation, slicePermutation, pr
             return true;
         }
         path.pop();
-        if (context.timedOut) {
+        if (context.timedOut || context.nodesExceeded) {
             return false;
         }
     }

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

@@ -1 +1 @@
-{"version":3,"file":"tables.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube3/solver/tables.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAM7C,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AAQ7D,MAAM,MAAM,mBAAmB,GAAG,MAAM,oBAAoB,CAAC;AAE7D,MAAM,MAAM,qBAAqB,GAC7B,mBAAmB,GACnB,kCAAkC,GAClC,mCAAmC,GACnC,mCAAmC,CAAC;AAExC,MAAM,WAAW,cAAc;IAC7B,UAAU,EAAE,mBAAmB,CAAC;IAChC,KAAK,EAAE,SAAS,SAAS,EAAE,CAAC;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,gBAAgB,EAAE,MAAM,CAAC;IACzB;;;;OAIG;IACH,MAAM,EAAE,UAAU,GAAG,WAAW,CAAC;IACjC,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,iBAAiB;IAChC,UAAU,EAAE,qBAAqB,CAAC;IAClC,KAAK,EAAE,SAAS,SAAS,EAAE,CAAC;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,UAAU,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,iBAAiB;IAChC,WAAW,EAAE,SAAS,SAAS,EAAE,CAAC;IAClC,WAAW,EAAE,SAAS,SAAS,EAAE,CAAC;IAClC,UAAU,EAAE;QACV,iBAAiB,EAAE,cAAc,CAAC;QAClC,eAAe,EAAE,cAAc,CAAC;QAChC,OAAO,EAAE,cAAc,CAAC;QACxB,iBAAiB,EAAE,cAAc,CAAC;QAClC,iBAAiB,EAAE,cAAc,CAAC;QAClC,gBAAgB,EAAE,cAAc,CAAC;KAClC,CAAC;IACF,aAAa,EAAE;QACb,iBAAiB,EAAE,iBAAiB,CAAC;QACrC,eAAe,EAAE,iBAAiB,CAAC;QACnC,OAAO,EAAE,iBAAiB,CAAC;QAC3B,gCAAgC,EAAE,iBAAiB,CAAC;QACpD,iBAAiB,EAAE,iBAAiB,CAAC;QACrC,iBAAiB,EAAE,iBAAiB,CAAC;QACrC,gBAAgB,EAAE,iBAAiB,CAAC;QACpC,iCAAiC,EAAE,iBAAiB,CAAC;QACrD,iCAAiC,EAAE,iBAAiB,CAAC;KACtD,CAAC;IACF,WAAW,EAAE,gBAAgB,GAAG,SAAS,CAAC;CAC3C;AAED;;;;;;GAMG;AACH,MAAM,WAAW,gBAAgB;IAC/B,uEAAuE;IACvE,SAAS,EAAE,UAAU,CAAC;IACtB,qEAAqE;IACrE,SAAS,EAAE,UAAU,CAAC;CACvB;AAED,MAAM,WAAW,iBAAiB;IAChC,WAAW,EAAE,SAAS,SAAS,EAAE,CAAC;IAClC,UAAU,EAAE,IAAI,CACd,iBAAiB,CAAC,YAAY,CAAC,EAC/B,mBAAmB,GAAG,iBAAiB,GAAG,SAAS,CACpD,CAAC;IACF,aAAa,EAAE,IAAI,CACjB,iBAAiB,CAAC,eAAe,CAAC,EAClC,mBAAmB,GAAG,iBAAiB,GAAG,SAAS,CACpD,GAAG;QACF,gCAAgC,EAAE,iBAAiB,CAAC;KACrD,CAAC;IACF,kEAAkE;IAClE,WAAW,EAAE,gBAAgB,GAAG,SAAS,CAAC;CAC3C;AAED,MAAM,WAAW,iBAAiB;IAChC,WAAW,EAAE,SAAS,SAAS,EAAE,CAAC;IAClC,UAAU,EAAE,IAAI,CACd,iBAAiB,CAAC,YAAY,CAAC,EAC/B,mBAAmB,GAAG,mBAAmB,GAAG,kBAAkB,CAC/D,CAAC;IACF,aAAa,EAAE,IAAI,CACjB,iBAAiB,CAAC,eAAe,CAAC,EAClC,mBAAmB,GAAG,mBAAmB,GAAG,kBAAkB,CAC/D,GAAG;QACF,iCAAiC,EAAE,iBAAiB,CAAC;QACrD,iCAAiC,EAAE,iBAAiB,CAAC;KACtD,CAAC;CACH;AAED,eAAO,MAAM,kBAAkB,oIAAc,CAAC;AAC9C,eAAO,MAAM,kBAAkB,EAAE,SAAS,SAAS,EAWlD,CAAC;AAMF,wBAAsB,qBAAqB,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAGxE;AAED,wBAAsB,qBAAqB,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAGxE;AAED,wBAAsB,qBAAqB,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAGxE;AAED,wBAAgB,yBAAyB,IAAI,iBAAiB,CAmC7D;AAED,wBAAgB,yBAAyB,IAAI,iBAAiB,CA4B7D;AAED,wBAAgB,yBAAyB,IAAI,iBAAiB,CAsC7D;AAED,wBAAgB,sBAAsB,CACpC,UAAU,EAAE,mBAAmB,EAC/B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,SAAS,SAAS,EAAE,GAC1B,cAAc,CAqBhB;AAED,wBAAgB,yBAAyB,CAAC,SAAS,EAAE,cAAc,GAAG,iBAAiB,CAsCtF;AAED,wBAAgB,iCAAiC,CAC/C,MAAM,EAAE,cAAc,EACtB,MAAM,EAAE,cAAc,GACrB,iBAAiB,CAgDnB;AAED,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,cAAc,EACrB,UAAU,EAAE,MAAM,EAClB,IAAI,EAAE,SAAS,GACd,MAAM,CAQR;AAED,wBAAgB,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,CAS1D"}
+{"version":3,"file":"tables.d.ts","sourceRoot":"","sources":["../../../../src/puzzles/cube3/solver/tables.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAM7C,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AAS7D,MAAM,MAAM,mBAAmB,GAAG,MAAM,oBAAoB,CAAC;AAE7D,MAAM,MAAM,qBAAqB,GAC7B,mBAAmB,GACnB,kCAAkC,GAClC,mCAAmC,GACnC,mCAAmC,CAAC;AAExC,MAAM,WAAW,cAAc;IAC7B,UAAU,EAAE,mBAAmB,CAAC;IAChC,KAAK,EAAE,SAAS,SAAS,EAAE,CAAC;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,gBAAgB,EAAE,MAAM,CAAC;IACzB;;;;OAIG;IACH,MAAM,EAAE,UAAU,GAAG,WAAW,CAAC;IACjC,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,iBAAiB;IAChC,UAAU,EAAE,qBAAqB,CAAC;IAClC,KAAK,EAAE,SAAS,SAAS,EAAE,CAAC;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,UAAU,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,iBAAiB;IAChC,WAAW,EAAE,SAAS,SAAS,EAAE,CAAC;IAClC,WAAW,EAAE,SAAS,SAAS,EAAE,CAAC;IAClC,UAAU,EAAE;QACV,iBAAiB,EAAE,cAAc,CAAC;QAClC,eAAe,EAAE,cAAc,CAAC;QAChC,OAAO,EAAE,cAAc,CAAC;QACxB,iBAAiB,EAAE,cAAc,CAAC;QAClC,iBAAiB,EAAE,cAAc,CAAC;QAClC,gBAAgB,EAAE,cAAc,CAAC;KAClC,CAAC;IACF,aAAa,EAAE;QACb,iBAAiB,EAAE,iBAAiB,CAAC;QACrC,eAAe,EAAE,iBAAiB,CAAC;QACnC,OAAO,EAAE,iBAAiB,CAAC;QAC3B,gCAAgC,EAAE,iBAAiB,CAAC;QACpD,iBAAiB,EAAE,iBAAiB,CAAC;QACrC,iBAAiB,EAAE,iBAAiB,CAAC;QACrC,gBAAgB,EAAE,iBAAiB,CAAC;QACpC,iCAAiC,EAAE,iBAAiB,CAAC;QACrD,iCAAiC,EAAE,iBAAiB,CAAC;KACtD,CAAC;IACF,WAAW,EAAE,gBAAgB,GAAG,SAAS,CAAC;CAC3C;AAED;;;;;;GAMG;AACH,MAAM,WAAW,gBAAgB;IAC/B,uEAAuE;IACvE,SAAS,EAAE,UAAU,CAAC;IACtB,qEAAqE;IACrE,SAAS,EAAE,UAAU,CAAC;CACvB;AAED,MAAM,WAAW,iBAAiB;IAChC,WAAW,EAAE,SAAS,SAAS,EAAE,CAAC;IAClC,UAAU,EAAE,IAAI,CACd,iBAAiB,CAAC,YAAY,CAAC,EAC/B,mBAAmB,GAAG,iBAAiB,GAAG,SAAS,CACpD,CAAC;IACF,aAAa,EAAE,IAAI,CACjB,iBAAiB,CAAC,eAAe,CAAC,EAClC,mBAAmB,GAAG,iBAAiB,GAAG,SAAS,CACpD,GAAG;QACF,gCAAgC,EAAE,iBAAiB,CAAC;KACrD,CAAC;IACF,kEAAkE;IAClE,WAAW,EAAE,gBAAgB,GAAG,SAAS,CAAC;CAC3C;AAED,MAAM,WAAW,iBAAiB;IAChC,WAAW,EAAE,SAAS,SAAS,EAAE,CAAC;IAClC,UAAU,EAAE,IAAI,CACd,iBAAiB,CAAC,YAAY,CAAC,EAC/B,mBAAmB,GAAG,mBAAmB,GAAG,kBAAkB,CAC/D,CAAC;IACF,aAAa,EAAE,IAAI,CACjB,iBAAiB,CAAC,eAAe,CAAC,EAClC,mBAAmB,GAAG,mBAAmB,GAAG,kBAAkB,CAC/D,GAAG;QACF,iCAAiC,EAAE,iBAAiB,CAAC;QACrD,iCAAiC,EAAE,iBAAiB,CAAC;KACtD,CAAC;CACH;AAED,eAAO,MAAM,kBAAkB,oIAAc,CAAC;AAC9C,eAAO,MAAM,kBAAkB,EAAE,SAAS,SAAS,EAWlD,CAAC;AAUF,wBAAgB,qBAAqB,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAElE;AAED,wBAAgB,qBAAqB,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAElE;AAED,wBAAgB,qBAAqB,IAAI,OAAO,CAAC,iBAAiB,CAAC,CAElE;AAED,wBAAgB,yBAAyB,IAAI,iBAAiB,CAmC7D;AAED,wBAAgB,yBAAyB,IAAI,iBAAiB,CA4B7D;AAED,wBAAgB,yBAAyB,IAAI,iBAAiB,CAsC7D;AAED,wBAAgB,sBAAsB,CACpC,UAAU,EAAE,mBAAmB,EAC/B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,SAAS,SAAS,EAAE,GAC1B,cAAc,CAqBhB;AAED,wBAAgB,yBAAyB,CAAC,SAAS,EAAE,cAAc,GAAG,iBAAiB,CAsCtF;AAED,wBAAgB,iCAAiC,CAC/C,MAAM,EAAE,cAAc,EACtB,MAAM,EAAE,cAAc,GACrB,iBAAiB,CAgDnB;AAED,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,cAAc,EACrB,UAAU,EAAE,MAAM,EAClB,IAAI,EAAE,SAAS,GACd,MAAM,CAQR;AAED,wBAAgB,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,MAAM,CAS1D"}

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

@@ -2,6 +2,7 @@ import { CUBE3_MOVES } from "../types.js";
 import { CUBE3_COORDINATE_RANGES, encodeCube3Coordinates, moveCoordinate } from "./coordinates.js";
 import { createSolvedCube3State } from "../state.js";
 import { loadGeneratedCube3Phase1Tables, loadGeneratedCube3Phase2Tables, loadGeneratedCube3SolverTables } from "./generated-assets.js";
+import { loadOnce } from "../../shared/load-once.js";
 export const CUBE3_PHASE1_MOVES = CUBE3_MOVES;
 export const CUBE3_PHASE2_MOVES = [
     "U",
@@ -15,20 +16,21 @@ export const CUBE3_PHASE2_MOVES = [
     "F2",
     "B2"
 ];
-let cachedTables;
-let cachedPhase1Tables;
-let cachedPhase2Tables;
-export async function loadCube3SolverTables() {
-    cachedTables ??= await loadGeneratedCube3SolverTables();
-    return cachedTables;
+// Promise slots (shared helper, see shared/load-once.ts): concurrent cold
+// calls share ONE in-flight load instead of racing several loads and
+// clobbering each other's results; a rejection purges the slot so the next
+// call can retry.
+const solverTablesSlot = { promise: undefined };
+const phase1TablesSlot = { promise: undefined };
+const phase2TablesSlot = { promise: undefined };
+export function loadCube3SolverTables() {
+    return loadOnce(solverTablesSlot, loadGeneratedCube3SolverTables);
 }
-export async function loadCube3Phase1Tables() {
-    cachedPhase1Tables ??= await loadGeneratedCube3Phase1Tables();
-    return cachedPhase1Tables;
+export function loadCube3Phase1Tables() {
+    return loadOnce(phase1TablesSlot, loadGeneratedCube3Phase1Tables);
 }
-export async function loadCube3Phase2Tables() {
-    cachedPhase2Tables ??= await loadGeneratedCube3Phase2Tables();
-    return cachedPhase2Tables;
+export function loadCube3Phase2Tables() {
+    return loadOnce(phase2TablesSlot, loadGeneratedCube3Phase2Tables);
 }
 export function generateCube3Phase1Tables() {
     const cornerOrientation = generateCube3MoveTable("cornerOrientation", CUBE3_COORDINATE_RANGES.cornerOrientation, CUBE3_PHASE1_MOVES);

package/dist/puzzles/cube4/browser-worker-pool.d.ts

@@ -0,0 +1,82 @@
+/**
+ * Web Worker pool for 4x4 random-state scrambles — the browser counterpart
+ * of `worker-pool.ts` with the same protocol, lazy-spawn lifecycle, FIFO
+ * queue, typed error propagation and per-thread table reuse.
+ *
+ * Unlike the Node pool (which locates its own worker file), the browser
+ * pool REQUIRES the caller to pass `workerUrl`, because only the caller's
+ * file can host the static `new URL("./browser-worker.js", import.meta.url)`
+ * expression that bundlers (Vite, Webpack 5, Parcel) statically analyse to
+ * emit a separate worker chunk:
+ *
+ * ```ts
+ * const pool = new Cube4BrowserWorkerPool({
+ *   workerUrl: new URL("./browser-worker.js", import.meta.url)
+ * });
+ * const batch = await pool.generateBatch(8, { seed: "demo" });
+ * await pool.terminate();
+ * ```
+ *
+ * This file contains no `import.meta` and no static Node imports, so it
+ * also compiles in the CommonJS build (unlike a hard-coded
+ * `new URL(..., import.meta.url)` default).
+ *
+ * Errors crossing the worker boundary arrive as `Error` instances with the
+ * original `name`, `message` and `code` preserved (`worker-protocol.ts`).
+ */
+import type { ScrambleResult } from "../../core/types.js";
+import { type Cube4WorkerGenerationOptions } from "./worker-protocol.js";
+export interface Cube4BrowserWorkerPoolOptions {
+    /**
+     * URL of the worker entry, normally
+     * `new URL("./browser-worker.js", import.meta.url)` written in the
+     * consumer's module (statically analysable by bundlers).
+     */
+    workerUrl: string | URL;
+    /**
+     * Maximum number of Web Workers. Defaults to
+     * `navigator.hardwareConcurrency - 1` (min 1).
+     */
+    size?: number;
+}
+/** Typed rejection used for post-terminate operations and shutdown itself. */
+export declare class Cube4BrowserWorkerPoolClosedError extends Error {
+    readonly code: "cube4-browser-pool-closed";
+    constructor(action?: string);
+}
+/**
+ * Batch seed derivation — identical to core `generateScrambles` and to
+ * `deriveBatchCube4Options` in the Node pool.
+ */
+export declare function deriveBrowserBatchCube4Options(options: Cube4WorkerGenerationOptions, index: number, count: number): Cube4WorkerGenerationOptions;
+export declare class Cube4BrowserWorkerPool {
+    private readonly workers;
+    private readonly queue;
+    private readonly workerUrl;
+    private readonly maxSize;
+    private pumping;
+    private terminatePromise;
+    private nextId;
+    private terminated;
+    constructor(options: Cube4BrowserWorkerPoolOptions);
+    /** Threads spawned so far (lazily grown; 0 before the first job). */
+    get workerCount(): number;
+    get queuedCount(): number;
+    get busyCount(): number;
+    get closed(): boolean;
+    generate(options?: Cube4WorkerGenerationOptions): Promise<ScrambleResult>;
+    generateBatch(count: number, options?: Cube4WorkerGenerationOptions): Promise<ScrambleResult[]>;
+    /**
+     * Prompt shutdown: rejects queued/in-flight tasks and terminates every
+     * Web Worker synchronously (no threads to join in the browser).
+     * Idempotent.
+     */
+    terminate(): void;
+    private pump;
+    private runPump;
+    private spawnWorker;
+    private dispatch;
+    private handleResponse;
+    private handleWorkerGone;
+}
+//# sourceMappingURL=browser-worker-pool.d.ts.map

package/dist/puzzles/cube4/browser-worker-pool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"browser-worker-pool.d.ts","sourceRoot":"","sources":["../../../src/puzzles/cube4/browser-worker-pool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAC1D,OAAO,EAEL,KAAK,4BAA4B,EAGlC,MAAM,sBAAsB,CAAC;AAE9B,MAAM,WAAW,6BAA6B;IAC5C;;;;OAIG;IACH,SAAS,EAAE,MAAM,GAAG,GAAG,CAAC;IACxB;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED,8EAA8E;AAC9E,qBAAa,iCAAkC,SAAQ,KAAK;IAC1D,QAAQ,CAAC,IAAI,EAAG,2BAA2B,CAAU;gBAEzC,MAAM,SAAc;CAIjC;AAED;;;GAGG;AACH,wBAAgB,8BAA8B,CAC5C,OAAO,EAAE,4BAA4B,EACrC,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,GACZ,4BAA4B,CAK9B;AAqBD,qBAAa,sBAAsB;IACjC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAsB;IAC9C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAoB;IAC1C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,gBAAgB,CAA4B;IACpD,OAAO,CAAC,MAAM,CAAK;IACnB,OAAO,CAAC,UAAU,CAAS;gBAEf,OAAO,EAAE,6BAA6B;IAiBlD,qEAAqE;IACrE,IAAI,WAAW,IAAI,MAAM,CAExB;IAED,IAAI,WAAW,IAAI,MAAM,CAExB;IAED,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,IAAI,MAAM,IAAI,OAAO,CAEpB;IAED,QAAQ,CAAC,OAAO,GAAE,4BAAiC,GAAG,OAAO,CAAC,cAAc,CAAC;IAW7E,aAAa,CACX,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,4BAAiC,GACzC,OAAO,CAAC,cAAc,EAAE,CAAC;IAW5B;;;;OAIG;IACH,SAAS,IAAI,IAAI;IAoBjB,OAAO,CAAC,IAAI;YAUE,OAAO;IAerB,OAAO,CAAC,WAAW;IAoBnB,OAAO,CAAC,QAAQ;IAYhB,OAAO,CAAC,cAAc;IActB,OAAO,CAAC,gBAAgB;CAUzB"}

package/dist/puzzles/cube4/browser-worker-pool.js

@@ -0,0 +1,205 @@
+/**
+ * Web Worker pool for 4x4 random-state scrambles — the browser counterpart
+ * of `worker-pool.ts` with the same protocol, lazy-spawn lifecycle, FIFO
+ * queue, typed error propagation and per-thread table reuse.
+ *
+ * Unlike the Node pool (which locates its own worker file), the browser
+ * pool REQUIRES the caller to pass `workerUrl`, because only the caller's
+ * file can host the static `new URL("./browser-worker.js", import.meta.url)`
+ * expression that bundlers (Vite, Webpack 5, Parcel) statically analyse to
+ * emit a separate worker chunk:
+ *
+ * ```ts
+ * const pool = new Cube4BrowserWorkerPool({
+ *   workerUrl: new URL("./browser-worker.js", import.meta.url)
+ * });
+ * const batch = await pool.generateBatch(8, { seed: "demo" });
+ * await pool.terminate();
+ * ```
+ *
+ * This file contains no `import.meta` and no static Node imports, so it
+ * also compiles in the CommonJS build (unlike a hard-coded
+ * `new URL(..., import.meta.url)` default).
+ *
+ * Errors crossing the worker boundary arrive as `Error` instances with the
+ * original `name`, `message` and `code` preserved (`worker-protocol.ts`).
+ */
+import { deserializeCube4Error } from "./worker-protocol.js";
+/** Typed rejection used for post-terminate operations and shutdown itself. */
+export class Cube4BrowserWorkerPoolClosedError extends Error {
+    code = "cube4-browser-pool-closed";
+    constructor(action = "operation") {
+        super(`[cube4] browser worker pool is closed (${action} rejected).`);
+        this.name = "Cube4BrowserWorkerPoolClosedError";
+    }
+}
+/**
+ * Batch seed derivation — identical to core `generateScrambles` and to
+ * `deriveBatchCube4Options` in the Node pool.
+ */
+export function deriveBrowserBatchCube4Options(options, index, count) {
+    if (count === 1 || options.seed === undefined) {
+        return options;
+    }
+    return { ...options, seed: `${options.seed}:${index}` };
+}
+function defaultBrowserSize() {
+    if (typeof navigator !== "undefined" && navigator.hardwareConcurrency) {
+        return Math.max(1, navigator.hardwareConcurrency - 1);
+    }
+    return 4;
+}
+export class Cube4BrowserWorkerPool {
+    workers = [];
+    queue = [];
+    workerUrl;
+    maxSize;
+    pumping = false;
+    terminatePromise;
+    nextId = 0;
+    terminated = false;
+    constructor(options) {
+        if (typeof Worker === "undefined") {
+            throw new Error("[cube4] Web Workers are not available in this environment; " +
+                "use generateCube4Scramble() directly for single-threaded generation.");
+        }
+        if (options.size !== undefined) {
+            if (!Number.isInteger(options.size) || options.size < 1) {
+                throw new RangeError(`[cube4] pool size must be an integer >= 1 (got ${options.size}).`);
+            }
+        }
+        this.workerUrl =
+            typeof options.workerUrl === "string" ? options.workerUrl : options.workerUrl.href;
+        this.maxSize = options.size ?? defaultBrowserSize();
+    }
+    /** Threads spawned so far (lazily grown; 0 before the first job). */
+    get workerCount() {
+        return this.workers.length;
+    }
+    get queuedCount() {
+        return this.queue.length;
+    }
+    get busyCount() {
+        return this.workers.reduce((n, rec) => n + (rec.task !== null ? 1 : 0), 0);
+    }
+    get closed() {
+        return this.terminated;
+    }
+    generate(options = {}) {
+        if (this.terminated) {
+            return Promise.reject(new Cube4BrowserWorkerPoolClosedError("generate"));
+        }
+        const id = this.nextId++;
+        return new Promise((resolve, reject) => {
+            this.queue.push({ id, options, resolve, reject });
+            this.pump();
+        });
+    }
+    generateBatch(count, options = {}) {
+        if (!Number.isInteger(count) || count < 1) {
+            return Promise.reject(new RangeError(`count must be a positive integer (got ${count}).`));
+        }
+        return Promise.all(Array.from({ length: count }, (_, index) => this.generate(deriveBrowserBatchCube4Options(options, index, count))));
+    }
+    /**
+     * Prompt shutdown: rejects queued/in-flight tasks and terminates every
+     * Web Worker synchronously (no threads to join in the browser).
+     * Idempotent.
+     */
+    terminate() {
+        if (this.terminatePromise !== undefined)
+            return;
+        this.terminated = true;
+        const closed = () => new Cube4BrowserWorkerPoolClosedError();
+        for (const task of this.queue.splice(0))
+            task.reject(closed());
+        const records = this.workers.splice(0);
+        for (const rec of records) {
+            if (rec.task !== null) {
+                rec.task.reject(closed());
+                rec.task = null;
+            }
+            rec.worker.terminate();
+        }
+        this.terminatePromise = Promise.resolve();
+    }
+    // ── internals (same shape as the Node pool) ──────────────────────────
+    pump() {
+        if (this.pumping || this.terminated)
+            return;
+        this.pumping = true;
+        void this.runPump()
+            .catch(() => undefined)
+            .finally(() => {
+            this.pumping = false;
+        });
+    }
+    async runPump() {
+        while (!this.terminated && this.queue.length > 0) {
+            const idle = this.workers.find((rec) => rec.task === null);
+            if (idle !== undefined) {
+                this.dispatch(idle, this.queue.shift());
+                continue;
+            }
+            if (this.workers.length < this.maxSize) {
+                this.spawnWorker();
+                continue;
+            }
+            break;
+        }
+    }
+    spawnWorker() {
+        const worker = new Worker(this.workerUrl, { type: "module", name: "cubingcenter-444" });
+        const rec = { worker, task: null };
+        worker.onmessage = (event) => {
+            this.handleResponse(rec, event.data);
+        };
+        worker.onerror = (event) => {
+            this.handleWorkerGone(rec, event.error instanceof Error
+                ? event.error
+                : new Error(event.message || "[cube4] browser worker failed."));
+        };
+        this.workers.push(rec);
+        return rec;
+    }
+    dispatch(rec, task) {
+        rec.task = task;
+        const message = { id: task.id, options: task.options };
+        try {
+            rec.worker.postMessage(message);
+        }
+        catch (error) {
+            rec.task = null;
+            task.reject(error);
+            this.pump();
+        }
+    }
+    handleResponse(rec, response) {
+        const task = rec.task;
+        if (task === null || task.id !== response.id)
+            return;
+        rec.task = null;
+        if (this.terminated)
+            return;
+        if (response.ok)
+            task.resolve(response.result);
+        else
+            task.reject(deserializeCube4Error(response.error));
+        const next = this.queue.shift();
+        if (next !== undefined)
+            this.dispatch(rec, next);
+        this.pump();
+    }
+    handleWorkerGone(rec, error) {
+        const index = this.workers.indexOf(rec);
+        if (index === -1)
+            return;
+        this.workers.splice(index, 1);
+        const task = rec.task;
+        rec.task = null;
+        if (task !== null && !this.terminated)
+            task.reject(error);
+        if (!this.terminated)
+            this.pump();
+    }
+}

package/dist/puzzles/cube4/browser-worker.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=browser-worker.d.ts.map

package/dist/puzzles/cube4/browser-worker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"browser-worker.d.ts","sourceRoot":"","sources":["../../../src/puzzles/cube4/browser-worker.ts"],"names":[],"mappings":""}

package/dist/puzzles/cube4/browser-worker.js

@@ -0,0 +1,31 @@
+/// <reference lib="webworker" />
+/**
+ * Web Worker entry for 4x4 scramble generation (browser build).
+ *
+ * Mirror of `worker.ts`: no work at boot, tables loaded on the FIRST task
+ * and reused afterwards (the browser loader caches per worker via
+ * `scrambler.ts`'s promise-deduplicated `loadCube4Tables`), full options
+ * passed through verbatim, errors flattened through `worker-protocol.ts`.
+ *
+ * Bundlers pick this file up through the static
+ * `new Worker(new URL(..., import.meta.url))` pattern used by the pool's
+ * consumer — see `Cube4BrowserWorkerPool`'s `workerUrl` option.
+ */
+import { generateCube4Scramble } from "./scrambler.js";
+import { serializeCube4Error } from "./worker-protocol.js";
+const workerScope = self;
+workerScope.onmessage = (event) => {
+    const task = event.data;
+    void (async () => {
+        const response = await (async () => {
+            try {
+                const result = await generateCube4Scramble(task.options);
+                return { id: task.id, ok: true, result };
+            }
+            catch (error) {
+                return { id: task.id, ok: false, error: serializeCube4Error(error) };
+            }
+        })();
+        workerScope.postMessage(response);
+    })();
+};

package/dist/puzzles/cube4/index.d.ts

@@ -1,8 +1,15 @@
 export { CORNER_COUNT, WING_COUNT, CENTER_COUNT, FACE_COUNT, CENTERS_PER_FACE, U, R, F, D, L, B, CUBE4_FACE_MOVES, CUBE4_ALL_MOVES, CUBE4_OUTER_MOVES } from "./types.js";
 export type { Cube4Face, Cube4FaceMove, Cube4Move, Cube4MoveSuffix, Cube4State, Cube4Sticker, Cube4Facelets, Cube4ValidationResult, Cube4RandomStateOptions } from "./types.js";
 export { createSolvedCube4State, cloneCube4State, cube4StatesEqual, isSolvedCube4State, areCentersReduced, areWingsPaired } from "./state.js";
+export { Cube4FinishCapError, Cube4Phase2CapError, Cube4Phase3CapError } from "./reduction/solve.js";
 export { cube4ScrambleGenerator, generateCube4Scramble, generateCube4Attempt } from "./scrambler.js";
 export type { Cube4ScrambleOptions } from "./scrambler.js";
+export { Cube4WorkerPool, Cube4WorkerPoolClosedError, deriveBatchCube4Options, generateCube4ScrambleBatch, getDefaultCube4WorkerPool, closeDefaultCube4WorkerPool } from "./worker-pool.js";
+export type { Cube4WorkerPoolOptions } from "./worker-pool.js";
+export { Cube4BrowserWorkerPool, Cube4BrowserWorkerPoolClosedError, deriveBrowserBatchCube4Options } from "./browser-worker-pool.js";
+export type { Cube4BrowserWorkerPoolOptions } from "./browser-worker-pool.js";
+export { Cube4ScrambleCache, createCube4ScrambleCache, deriveCube4StreamOptions } from "./scramble-cache.js";
+export type { Cube4ScrambleCacheOptions, Cube4ScrambleGenerator } from "./scramble-cache.js";
 export { applyCube4Move, applyCube4Algorithm, invertCube4Move, invertCube4Algorithm, simplifyCube4Algorithm, formatCube4Algorithm, parseCube4Algorithm, parseCube4Move, parseMove, FACE_MOVE_EFFECTS } from "./moves.js";
 export { generateRandomCube4State } from "./random-state.js";
 export { validateCube4State, isOneMoveFromSolvedCube4State, isTrivialCube4State, isAllowedRandomCube4State } from "./validation.js";

package/dist/puzzles/cube4/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/puzzles/cube4/index.ts"],"names":[],"mappings":"AASA,OAAO,EACL,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,UAAU,EACV,gBAAgB,EAChB,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAChB,gBAAgB,EAChB,eAAe,EACf,iBAAiB,EAClB,MAAM,YAAY,CAAC;AACpB,YAAY,EACV,SAAS,EACT,aAAa,EACb,SAAS,EACT,eAAe,EACf,UAAU,EACV,YAAY,EACZ,aAAa,EACb,qBAAqB,EACrB,uBAAuB,EACxB,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,sBAAsB,EACtB,eAAe,EACf,gBAAgB,EAChB,kBAAkB,EAClB,iBAAiB,EACjB,cAAc,EACf,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,sBAAsB,EACtB,qBAAqB,EACrB,oBAAoB,EACrB,MAAM,gBAAgB,CAAC;AACxB,YAAY,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAE3D,OAAO,EACL,cAAc,EACd,mBAAmB,EACnB,eAAe,EACf,oBAAoB,EACpB,sBAAsB,EACtB,oBAAoB,EACpB,mBAAmB,EACnB,cAAc,EACd,SAAS,EACT,iBAAiB,EAClB,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,wBAAwB,EACzB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,kBAAkB,EAClB,6BAA6B,EAC7B,mBAAmB,EACnB,yBAAyB,EAC1B,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EACL,eAAe,EACf,mBAAmB,EACnB,iBAAiB,EAClB,MAAM,eAAe,CAAC;AAEvB,OAAO,EACL,gBAAgB,EAChB,iBAAiB,EACjB,YAAY,EACZ,kBAAkB,EAClB,mBAAmB,EACpB,MAAM,qBAAqB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/puzzles/cube4/index.ts"],"names":[],"mappings":"AASA,OAAO,EACL,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,UAAU,EACV,gBAAgB,EAChB,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAChB,gBAAgB,EAChB,eAAe,EACf,iBAAiB,EAClB,MAAM,YAAY,CAAC;AACpB,YAAY,EACV,SAAS,EACT,aAAa,EACb,SAAS,EACT,eAAe,EACf,UAAU,EACV,YAAY,EACZ,aAAa,EACb,qBAAqB,EACrB,uBAAuB,EACxB,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,sBAAsB,EACtB,eAAe,EACf,gBAAgB,EAChB,kBAAkB,EAClB,iBAAiB,EACjB,cAAc,EACf,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,mBAAmB,EACnB,mBAAmB,EACnB,mBAAmB,EACpB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACL,sBAAsB,EACtB,qBAAqB,EACrB,oBAAoB,EACrB,MAAM,gBAAgB,CAAC;AACxB,YAAY,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAE3D,OAAO,EACL,eAAe,EACf,0BAA0B,EAC1B,uBAAuB,EACvB,0BAA0B,EAC1B,yBAAyB,EACzB,2BAA2B,EAC5B,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EAAE,sBAAsB,EAAE,MAAM,kBAAkB,CAAC;AAE/D,OAAO,EACL,sBAAsB,EACtB,iCAAiC,EACjC,8BAA8B,EAC/B,MAAM,0BAA0B,CAAC;AAClC,YAAY,EAAE,6BAA6B,EAAE,MAAM,0BAA0B,CAAC;AAE9E,OAAO,EACL,kBAAkB,EAClB,wBAAwB,EACxB,wBAAwB,EACzB,MAAM,qBAAqB,CAAC;AAC7B,YAAY,EACV,yBAAyB,EACzB,sBAAsB,EACvB,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EACL,cAAc,EACd,mBAAmB,EACnB,eAAe,EACf,oBAAoB,EACpB,sBAAsB,EACtB,oBAAoB,EACpB,mBAAmB,EACnB,cAAc,EACd,SAAS,EACT,iBAAiB,EAClB,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,wBAAwB,EACzB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,kBAAkB,EAClB,6BAA6B,EAC7B,mBAAmB,EACnB,yBAAyB,EAC1B,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EACL,eAAe,EACf,mBAAmB,EACnB,iBAAiB,EAClB,MAAM,eAAe,CAAC;AAEvB,OAAO,EACL,gBAAgB,EAChB,iBAAiB,EACjB,YAAY,EACZ,kBAAkB,EAClB,mBAAmB,EACpB,MAAM,qBAAqB,CAAC"}

package/dist/puzzles/cube4/index.js

@@ -6,7 +6,11 @@ import { cube4ScrambleGenerator } from "./scrambler.js";
 registerScrambleGenerator(cube4ScrambleGenerator);
 export { CORNER_COUNT, WING_COUNT, CENTER_COUNT, FACE_COUNT, CENTERS_PER_FACE, U, R, F, D, L, B, CUBE4_FACE_MOVES, CUBE4_ALL_MOVES, CUBE4_OUTER_MOVES } from "./types.js";
 export { createSolvedCube4State, cloneCube4State, cube4StatesEqual, isSolvedCube4State, areCentersReduced, areWingsPaired } from "./state.js";
+export { Cube4FinishCapError, Cube4Phase2CapError, Cube4Phase3CapError } from "./reduction/solve.js";
 export { cube4ScrambleGenerator, generateCube4Scramble, generateCube4Attempt } from "./scrambler.js";
+export { Cube4WorkerPool, Cube4WorkerPoolClosedError, deriveBatchCube4Options, generateCube4ScrambleBatch, getDefaultCube4WorkerPool, closeDefaultCube4WorkerPool } from "./worker-pool.js";
+export { Cube4BrowserWorkerPool, Cube4BrowserWorkerPoolClosedError, deriveBrowserBatchCube4Options } from "./browser-worker-pool.js";
+export { Cube4ScrambleCache, createCube4ScrambleCache, deriveCube4StreamOptions } from "./scramble-cache.js";
 export { applyCube4Move, applyCube4Algorithm, invertCube4Move, invertCube4Algorithm, simplifyCube4Algorithm, formatCube4Algorithm, parseCube4Algorithm, parseCube4Move, parseMove, FACE_MOVE_EFFECTS } from "./moves.js";
 export { generateRandomCube4State } from "./random-state.js";
 export { validateCube4State, isOneMoveFromSolvedCube4State, isTrivialCube4State, isAllowedRandomCube4State } from "./validation.js";

package/dist/puzzles/cube4/moves.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"moves.d.ts","sourceRoot":"","sources":["../../../src/puzzles/cube4/moves.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,SAAS,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAOxF,UAAU,UAAU;IAClB,+DAA+D;IAC/D,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IACzB,yDAAyD;IACzD,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3B,kFAAkF;IAClF,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IACzB,oDAAoD;IACpD,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;CAC3B;AA0KD,QAAA,MAAM,iBAAiB,EAAE,MAAM,CAAC,aAAa,EAAE,UAAU,CAGxD,CAAC;AAuDF,wBAAgB,SAAS,CAAC,IAAI,EAAE,SAAS,GAAG;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,MAAM,EAAE,eAAe,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAc1G;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,GAAG,UAAU,CAK7E;AAED,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,SAAS,EAAE,GAAG,UAAU,CA4C9F;AAKD,wBAAgB,eAAe,CAAC,IAAI,EAAE,SAAS,GAAG,SAAS,CAI1D;AAED,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,GAAG,SAAS,EAAE,CAE7E;AAMD,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,GAAG,MAAM,CAExE;AAED,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,EAAE,CAIlE;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAMvD;AAkCD;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,GAAG,SAAS,EAAE,CAsB/E;AAMD,OAAO,EAAE,iBAAiB,EAAE,CAAC"}
+{"version":3,"file":"moves.d.ts","sourceRoot":"","sources":["../../../src/puzzles/cube4/moves.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,SAAS,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAOxF,UAAU,UAAU;IAClB,+DAA+D;IAC/D,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IACzB,yDAAyD;IACzD,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3B,kFAAkF;IAClF,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IACzB,oDAAoD;IACpD,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC;CAC3B;AA0KD,QAAA,MAAM,iBAAiB,EAAE,MAAM,CAAC,aAAa,EAAE,UAAU,CAGxD,CAAC;AAuDF,wBAAgB,SAAS,CAAC,IAAI,EAAE,SAAS,GAAG;IAAE,IAAI,EAAE,aAAa,CAAC;IAAC,MAAM,EAAE,eAAe,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAc1G;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,GAAG,UAAU,CAK7E;AAED,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,SAAS,EAAE,GAAG,UAAU,CA4C9F;AAKD,wBAAgB,eAAe,CAAC,IAAI,EAAE,SAAS,GAAG,SAAS,CAI1D;AAED,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,GAAG,SAAS,EAAE,CAE7E;AAMD,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,GAAG,MAAM,CAExE;AAED,wBAAgB,mBAAmB,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,EAAE,CAIlE;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,CAMvD;AA+HD;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,SAAS,SAAS,EAAE,GAAG,SAAS,EAAE,CAsC/E;AAMD,OAAO,EAAE,iBAAiB,EAAE,CAAC"}