@cubingcenter/scrambler 0.4.0 → 0.5.0

package/dist/puzzles/pyraminx/solver.js

@@ -1,160 +0,0 @@
-import { applyPyraminxMove } from "./moves.js";
-import { createSolvedPyraminxState } from "./state.js";
-// Fast state-to-index encoder/decoder to allow optimal BFS solving
-// Factorials for permutation encoding
-const FACT = [1, 1, 2, 6, 24, 120, 720];
-export function getPermutationIndex(perm) {
-    let index = 0;
-    const n = perm.length;
-    for (let i = 0; i < n; i++) {
-        let count = 0;
-        for (let j = i + 1; j < n; j++) {
-            if (perm[j] < perm[i])
-                count++;
-        }
-        index += count * FACT[n - 1 - i];
-    }
-    return index;
-}
-export function getPermutationFromIndex(index, n) {
-    const perm = Array(n).fill(0);
-    const temp = Array.from({ length: n }, (_, i) => i);
-    let val = index;
-    for (let i = 0; i < n; i++) {
-        const f = FACT[n - 1 - i];
-        const choice = Math.floor(val / f);
-        val %= f;
-        perm[i] = temp[choice];
-        temp.splice(choice, 1);
-    }
-    return perm;
-}
-export function getOrientationIndex(orient) {
-    let index = 0;
-    for (let i = 0; i < 5; i++) {
-        index = (index << 1) | orient[i];
-    }
-    return index;
-}
-export function getOrientationFromIndex(index) {
-    const orient = Array(6).fill(0);
-    let temp = index;
-    let sum = 0;
-    for (let i = 4; i >= 0; i--) {
-        const bit = temp & 1;
-        orient[i] = bit;
-        sum += bit;
-        temp >>= 1;
-    }
-    orient[5] = sum % 2 === 0 ? 0 : 1;
-    return orient;
-}
-export function getCentersIndex(centers) {
-    return centers[0] + 3 * centers[1] + 9 * centers[2] + 27 * centers[3];
-}
-export function getCentersFromIndex(index) {
-    let temp = index;
-    const centers = Array(4).fill(0);
-    for (let i = 0; i < 4; i++) {
-        centers[i] = temp % 3;
-        temp = Math.floor(temp / 3);
-    }
-    return centers;
-}
-export function getStateIndex(state) {
-    const c = getCentersIndex(state.centers);
-    const p = getPermutationIndex(state.edgesPerm);
-    const o = getOrientationIndex(state.edgesOrient);
-    // c is 0..80, p is 0..719, o is 0..31
-    return c + 81 * (p + 720 * o);
-}
-// Bidirectional BFS solver
-const MOVES = ["U", "U'", "L", "L'", "R", "R'", "B", "B'"];
-export function solvePyraminx(state) {
-    const startIdx = getStateIndex(state);
-    const solvedIdx = getStateIndex(createSolvedPyraminxState());
-    if (startIdx === solvedIdx)
-        return [];
-    // Bidirectional BFS:
-    // forwardMap and backwardMap store the move that led to this index and the parent index
-    const forwardMap = new Map();
-    const backwardMap = new Map();
-    const forwardQueue = [startIdx];
-    const backwardQueue = [solvedIdx];
-    forwardMap.set(startIdx, { move: "", parent: -1 });
-    backwardMap.set(solvedIdx, { move: "", parent: -1 });
-    while (forwardQueue.length > 0 && backwardQueue.length > 0) {
-        // Expand forward
-        const fSize = forwardQueue.length;
-        for (let i = 0; i < Math.min(fSize, 1000); i++) {
-            const currIdx = forwardQueue.shift();
-            const currState = getPyraminxStateFromIndex(currIdx);
-            for (const move of MOVES) {
-                const nextState = applyPyraminxMove(currState, move);
-                const nextIdx = getStateIndex(nextState);
-                if (!forwardMap.has(nextIdx)) {
-                    forwardMap.set(nextIdx, { move, parent: currIdx });
-                    if (backwardMap.has(nextIdx)) {
-                        return reconstructPath(nextIdx, forwardMap, backwardMap);
-                    }
-                    forwardQueue.push(nextIdx);
-                }
-            }
-        }
-        // Expand backward
-        const bSize = backwardQueue.length;
-        for (let i = 0; i < Math.min(bSize, 1000); i++) {
-            const currIdx = backwardQueue.shift();
-            const currState = getPyraminxStateFromIndex(currIdx);
-            for (const move of MOVES) {
-                const nextState = applyPyraminxMove(currState, move);
-                const nextIdx = getStateIndex(nextState);
-                if (!backwardMap.has(nextIdx)) {
-                    // Note: we record the inverse move since we are searching from solved
-                    const invMove = move.endsWith("'") ? move.slice(0, -1) : `${move}'`;
-                    backwardMap.set(nextIdx, { move: invMove, parent: currIdx });
-                    if (forwardMap.has(nextIdx)) {
-                        return reconstructPath(nextIdx, forwardMap, backwardMap);
-                    }
-                    backwardQueue.push(nextIdx);
-                }
-            }
-        }
-    }
-    throw new Error("Pyraminx state is unsolvable");
-}
-function getPyraminxStateFromIndex(index) {
-    let val = index;
-    const centersIdx = val % 81;
-    val = Math.floor(val / 81);
-    const permIdx = val % 720;
-    const orientIdx = Math.floor(val / 720);
-    return {
-        centers: getCentersFromIndex(centersIdx),
-        edgesPerm: getPermutationFromIndex(permIdx, 6),
-        edgesOrient: getOrientationFromIndex(orientIdx),
-        tips: [0, 0, 0, 0] // tips are solved separately
-    };
-}
-function reconstructPath(meetingIdx, forwardMap, backwardMap) {
-    const path = [];
-    // Reconstruct forward path
-    let curr = meetingIdx;
-    while (curr !== -1) {
-        const edge = forwardMap.get(curr);
-        if (edge.parent !== -1) {
-            path.unshift(edge.move);
-        }
-        curr = edge.parent;
-    }
-    // Reconstruct backward path
-    curr = meetingIdx;
-    while (curr !== -1) {
-        const edge = backwardMap.get(curr);
-        if (edge.parent !== -1) {
-            path.push(edge.move);
-        }
-        curr = edge.parent;
-    }
-    return path;
-}

package/dist/puzzles/skewb/solver.d.ts

@@ -1,11 +0,0 @@
-import type { SkewbMove, SkewbState } from "./types.js";
-export declare function getPermutationIndex(perm: readonly number[]): number;
-export declare function getPermutationFromIndex(index: number, n: number): number[];
-export declare function getOrientationIndex(orient: readonly number[]): number;
-export declare function getOrientationFromIndex(index: number): number[];
-export declare function getCenterIndex(centers: readonly number[]): number;
-export declare function getCenterFromIndex(index: number): number[];
-export declare function getStateIndex(state: SkewbState): number;
-export declare function getStateFromIndex(index: number): SkewbState;
-export declare function solveSkewb(state: SkewbState): SkewbMove[];
-//# sourceMappingURL=solver.d.ts.map

package/dist/puzzles/skewb/solver.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"solver.d.ts","sourceRoot":"","sources":["../../../src/puzzles/skewb/solver.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAMxD,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAWnE;AAED,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAY1E;AAED,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAOrE;AAED,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAS/D;AAED,wBAAgB,cAAc,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CASjE;AAED,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAE1D;AAED,wBAAgB,aAAa,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,CAOvD;AAED,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,CAY3D;AAID,wBAAgB,UAAU,CAAC,KAAK,EAAE,UAAU,GAAG,SAAS,EAAE,CA+CzD"}

package/dist/puzzles/skewb/solver.js

@@ -1,149 +0,0 @@
-import { applySkewbMove } from "./moves.js";
-import { createSolvedSkewbState } from "./state.js";
-const FACT = [1, 1, 2, 6, 24, 120, 720, 5040, 40320];
-export function getPermutationIndex(perm) {
-    // perm length 8, but pos0 is always 0 for WCA reachable states.
-    // We encode full 8-perm via Lehmer code (0..40319), but for fixed corner it will be in subset.
-    let index = 0;
-    const n = perm.length;
-    for (let i = 0; i < n; i++) {
-        let count = 0;
-        for (let j = i + 1; j < n; j++)
-            if (perm[j] < perm[i])
-                count++;
-        index += count * FACT[n - 1 - i];
-    }
-    return index;
-}
-export function getPermutationFromIndex(index, n) {
-    const perm = Array(n).fill(0);
-    const temp = Array.from({ length: n }, (_, i) => i);
-    let val = index;
-    for (let i = 0; i < n; i++) {
-        const f = FACT[n - 1 - i];
-        const choice = Math.floor(val / f);
-        val %= f;
-        perm[i] = temp[choice];
-        temp.splice(choice, 1);
-    }
-    return perm;
-}
-export function getOrientationIndex(orient) {
-    // orient length 8, index 0 is fixed 0, encode remaining 7 base3
-    let index = 0;
-    for (let i = 7; i >= 1; i--) {
-        index = index * 3 + orient[i];
-    }
-    return index;
-}
-export function getOrientationFromIndex(index) {
-    const orient = Array(8).fill(0);
-    orient[0] = 0;
-    let val = index;
-    for (let i = 1; i < 8; i++) {
-        orient[i] = val % 3;
-        val = Math.floor(val / 3);
-    }
-    return orient;
-}
-export function getCenterIndex(centers) {
-    let index = 0;
-    const n = centers.length;
-    for (let i = 0; i < n; i++) {
-        let count = 0;
-        for (let j = i + 1; j < n; j++)
-            if (centers[j] < centers[i])
-                count++;
-        index += count * FACT[n - 1 - i];
-    }
-    return index;
-}
-export function getCenterFromIndex(index) {
-    return getPermutationFromIndex(index, 6);
-}
-export function getStateIndex(state) {
-    const p = getPermutationIndex(state.corners.permutation);
-    const c = getCenterIndex(state.centers);
-    const o = getOrientationIndex(state.corners.orientation);
-    // p in 0..40319, c in 0..719, o in 0..2186
-    // Combine: ((p * 720 + c) * 2187 + o) -> up to 63B fits in JS number (53-bit)
-    return ((p * 720 + c) * 2187 + o);
-}
-export function getStateFromIndex(index) {
-    const o = index % 2187;
-    let val = Math.floor(index / 2187);
-    const c = val % 720;
-    const p = Math.floor(val / 720);
-    return {
-        corners: {
-            permutation: getPermutationFromIndex(p, 8),
-            orientation: getOrientationFromIndex(o),
-        },
-        centers: getCenterFromIndex(c),
-    };
-}
-const MOVES = ["R", "R'", "U", "U'", "L", "L'", "B", "B'"];
-export function solveSkewb(state) {
-    const startIdx = getStateIndex(state);
-    const solvedIdx = getStateIndex(createSolvedSkewbState());
-    if (startIdx === solvedIdx)
-        return [];
-    const forwardMap = new Map();
-    const backwardMap = new Map();
-    const forwardQueue = [startIdx];
-    const backwardQueue = [solvedIdx];
-    forwardMap.set(startIdx, { move: "", parent: -1 });
-    backwardMap.set(solvedIdx, { move: "", parent: -1 });
-    while (forwardQueue.length > 0 && backwardQueue.length > 0) {
-        const fSize = forwardQueue.length;
-        for (let i = 0; i < Math.min(fSize, 1000); i++) {
-            const currIdx = forwardQueue.shift();
-            const currState = getStateFromIndex(currIdx);
-            for (const move of MOVES) {
-                const nextState = applySkewbMove(currState, move);
-                const nextIdx = getStateIndex(nextState);
-                if (!forwardMap.has(nextIdx)) {
-                    forwardMap.set(nextIdx, { move, parent: currIdx });
-                    if (backwardMap.has(nextIdx))
-                        return reconstructPath(nextIdx, forwardMap, backwardMap);
-                    forwardQueue.push(nextIdx);
-                }
-            }
-        }
-        const bSize = backwardQueue.length;
-        for (let i = 0; i < Math.min(bSize, 1000); i++) {
-            const currIdx = backwardQueue.shift();
-            const currState = getStateFromIndex(currIdx);
-            for (const move of MOVES) {
-                const nextState = applySkewbMove(currState, move);
-                const nextIdx = getStateIndex(nextState);
-                if (!backwardMap.has(nextIdx)) {
-                    const invMove = move.endsWith("'") ? move.slice(0, -1) : `${move}'`;
-                    backwardMap.set(nextIdx, { move: invMove, parent: currIdx });
-                    if (forwardMap.has(nextIdx))
-                        return reconstructPath(nextIdx, forwardMap, backwardMap);
-                    backwardQueue.push(nextIdx);
-                }
-            }
-        }
-    }
-    throw new Error("Skewb state is unsolvable");
-}
-function reconstructPath(meetingIdx, forwardMap, backwardMap) {
-    const path = [];
-    let curr = meetingIdx;
-    while (curr !== -1) {
-        const edge = forwardMap.get(curr);
-        if (edge.parent !== -1)
-            path.unshift(edge.move);
-        curr = edge.parent;
-    }
-    curr = meetingIdx;
-    while (curr !== -1) {
-        const edge = backwardMap.get(curr);
-        if (edge.parent !== -1)
-            path.push(edge.move);
-        curr = edge.parent;
-    }
-    return path;
-}

package/dist-cjs/puzzles/pyraminx/solver.js

@@ -1,170 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getPermutationIndex = getPermutationIndex;
-exports.getPermutationFromIndex = getPermutationFromIndex;
-exports.getOrientationIndex = getOrientationIndex;
-exports.getOrientationFromIndex = getOrientationFromIndex;
-exports.getCentersIndex = getCentersIndex;
-exports.getCentersFromIndex = getCentersFromIndex;
-exports.getStateIndex = getStateIndex;
-exports.solvePyraminx = solvePyraminx;
-const moves_js_1 = require("./moves.js");
-const state_js_1 = require("./state.js");
-// Fast state-to-index encoder/decoder to allow optimal BFS solving
-// Factorials for permutation encoding
-const FACT = [1, 1, 2, 6, 24, 120, 720];
-function getPermutationIndex(perm) {
-    let index = 0;
-    const n = perm.length;
-    for (let i = 0; i < n; i++) {
-        let count = 0;
-        for (let j = i + 1; j < n; j++) {
-            if (perm[j] < perm[i])
-                count++;
-        }
-        index += count * FACT[n - 1 - i];
-    }
-    return index;
-}
-function getPermutationFromIndex(index, n) {
-    const perm = Array(n).fill(0);
-    const temp = Array.from({ length: n }, (_, i) => i);
-    let val = index;
-    for (let i = 0; i < n; i++) {
-        const f = FACT[n - 1 - i];
-        const choice = Math.floor(val / f);
-        val %= f;
-        perm[i] = temp[choice];
-        temp.splice(choice, 1);
-    }
-    return perm;
-}
-function getOrientationIndex(orient) {
-    let index = 0;
-    for (let i = 0; i < 5; i++) {
-        index = (index << 1) | orient[i];
-    }
-    return index;
-}
-function getOrientationFromIndex(index) {
-    const orient = Array(6).fill(0);
-    let temp = index;
-    let sum = 0;
-    for (let i = 4; i >= 0; i--) {
-        const bit = temp & 1;
-        orient[i] = bit;
-        sum += bit;
-        temp >>= 1;
-    }
-    orient[5] = sum % 2 === 0 ? 0 : 1;
-    return orient;
-}
-function getCentersIndex(centers) {
-    return centers[0] + 3 * centers[1] + 9 * centers[2] + 27 * centers[3];
-}
-function getCentersFromIndex(index) {
-    let temp = index;
-    const centers = Array(4).fill(0);
-    for (let i = 0; i < 4; i++) {
-        centers[i] = temp % 3;
-        temp = Math.floor(temp / 3);
-    }
-    return centers;
-}
-function getStateIndex(state) {
-    const c = getCentersIndex(state.centers);
-    const p = getPermutationIndex(state.edgesPerm);
-    const o = getOrientationIndex(state.edgesOrient);
-    // c is 0..80, p is 0..719, o is 0..31
-    return c + 81 * (p + 720 * o);
-}
-// Bidirectional BFS solver
-const MOVES = ["U", "U'", "L", "L'", "R", "R'", "B", "B'"];
-function solvePyraminx(state) {
-    const startIdx = getStateIndex(state);
-    const solvedIdx = getStateIndex((0, state_js_1.createSolvedPyraminxState)());
-    if (startIdx === solvedIdx)
-        return [];
-    // Bidirectional BFS:
-    // forwardMap and backwardMap store the move that led to this index and the parent index
-    const forwardMap = new Map();
-    const backwardMap = new Map();
-    const forwardQueue = [startIdx];
-    const backwardQueue = [solvedIdx];
-    forwardMap.set(startIdx, { move: "", parent: -1 });
-    backwardMap.set(solvedIdx, { move: "", parent: -1 });
-    while (forwardQueue.length > 0 && backwardQueue.length > 0) {
-        // Expand forward
-        const fSize = forwardQueue.length;
-        for (let i = 0; i < Math.min(fSize, 1000); i++) {
-            const currIdx = forwardQueue.shift();
-            const currState = getPyraminxStateFromIndex(currIdx);
-            for (const move of MOVES) {
-                const nextState = (0, moves_js_1.applyPyraminxMove)(currState, move);
-                const nextIdx = getStateIndex(nextState);
-                if (!forwardMap.has(nextIdx)) {
-                    forwardMap.set(nextIdx, { move, parent: currIdx });
-                    if (backwardMap.has(nextIdx)) {
-                        return reconstructPath(nextIdx, forwardMap, backwardMap);
-                    }
-                    forwardQueue.push(nextIdx);
-                }
-            }
-        }
-        // Expand backward
-        const bSize = backwardQueue.length;
-        for (let i = 0; i < Math.min(bSize, 1000); i++) {
-            const currIdx = backwardQueue.shift();
-            const currState = getPyraminxStateFromIndex(currIdx);
-            for (const move of MOVES) {
-                const nextState = (0, moves_js_1.applyPyraminxMove)(currState, move);
-                const nextIdx = getStateIndex(nextState);
-                if (!backwardMap.has(nextIdx)) {
-                    // Note: we record the inverse move since we are searching from solved
-                    const invMove = move.endsWith("'") ? move.slice(0, -1) : `${move}'`;
-                    backwardMap.set(nextIdx, { move: invMove, parent: currIdx });
-                    if (forwardMap.has(nextIdx)) {
-                        return reconstructPath(nextIdx, forwardMap, backwardMap);
-                    }
-                    backwardQueue.push(nextIdx);
-                }
-            }
-        }
-    }
-    throw new Error("Pyraminx state is unsolvable");
-}
-function getPyraminxStateFromIndex(index) {
-    let val = index;
-    const centersIdx = val % 81;
-    val = Math.floor(val / 81);
-    const permIdx = val % 720;
-    const orientIdx = Math.floor(val / 720);
-    return {
-        centers: getCentersFromIndex(centersIdx),
-        edgesPerm: getPermutationFromIndex(permIdx, 6),
-        edgesOrient: getOrientationFromIndex(orientIdx),
-        tips: [0, 0, 0, 0] // tips are solved separately
-    };
-}
-function reconstructPath(meetingIdx, forwardMap, backwardMap) {
-    const path = [];
-    // Reconstruct forward path
-    let curr = meetingIdx;
-    while (curr !== -1) {
-        const edge = forwardMap.get(curr);
-        if (edge.parent !== -1) {
-            path.unshift(edge.move);
-        }
-        curr = edge.parent;
-    }
-    // Reconstruct backward path
-    curr = meetingIdx;
-    while (curr !== -1) {
-        const edge = backwardMap.get(curr);
-        if (edge.parent !== -1) {
-            path.push(edge.move);
-        }
-        curr = edge.parent;
-    }
-    return path;
-}

package/dist-cjs/puzzles/skewb/solver.js

@@ -1,160 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getPermutationIndex = getPermutationIndex;
-exports.getPermutationFromIndex = getPermutationFromIndex;
-exports.getOrientationIndex = getOrientationIndex;
-exports.getOrientationFromIndex = getOrientationFromIndex;
-exports.getCenterIndex = getCenterIndex;
-exports.getCenterFromIndex = getCenterFromIndex;
-exports.getStateIndex = getStateIndex;
-exports.getStateFromIndex = getStateFromIndex;
-exports.solveSkewb = solveSkewb;
-const moves_js_1 = require("./moves.js");
-const state_js_1 = require("./state.js");
-const FACT = [1, 1, 2, 6, 24, 120, 720, 5040, 40320];
-function getPermutationIndex(perm) {
-    // perm length 8, but pos0 is always 0 for WCA reachable states.
-    // We encode full 8-perm via Lehmer code (0..40319), but for fixed corner it will be in subset.
-    let index = 0;
-    const n = perm.length;
-    for (let i = 0; i < n; i++) {
-        let count = 0;
-        for (let j = i + 1; j < n; j++)
-            if (perm[j] < perm[i])
-                count++;
-        index += count * FACT[n - 1 - i];
-    }
-    return index;
-}
-function getPermutationFromIndex(index, n) {
-    const perm = Array(n).fill(0);
-    const temp = Array.from({ length: n }, (_, i) => i);
-    let val = index;
-    for (let i = 0; i < n; i++) {
-        const f = FACT[n - 1 - i];
-        const choice = Math.floor(val / f);
-        val %= f;
-        perm[i] = temp[choice];
-        temp.splice(choice, 1);
-    }
-    return perm;
-}
-function getOrientationIndex(orient) {
-    // orient length 8, index 0 is fixed 0, encode remaining 7 base3
-    let index = 0;
-    for (let i = 7; i >= 1; i--) {
-        index = index * 3 + orient[i];
-    }
-    return index;
-}
-function getOrientationFromIndex(index) {
-    const orient = Array(8).fill(0);
-    orient[0] = 0;
-    let val = index;
-    for (let i = 1; i < 8; i++) {
-        orient[i] = val % 3;
-        val = Math.floor(val / 3);
-    }
-    return orient;
-}
-function getCenterIndex(centers) {
-    let index = 0;
-    const n = centers.length;
-    for (let i = 0; i < n; i++) {
-        let count = 0;
-        for (let j = i + 1; j < n; j++)
-            if (centers[j] < centers[i])
-                count++;
-        index += count * FACT[n - 1 - i];
-    }
-    return index;
-}
-function getCenterFromIndex(index) {
-    return getPermutationFromIndex(index, 6);
-}
-function getStateIndex(state) {
-    const p = getPermutationIndex(state.corners.permutation);
-    const c = getCenterIndex(state.centers);
-    const o = getOrientationIndex(state.corners.orientation);
-    // p in 0..40319, c in 0..719, o in 0..2186
-    // Combine: ((p * 720 + c) * 2187 + o) -> up to 63B fits in JS number (53-bit)
-    return ((p * 720 + c) * 2187 + o);
-}
-function getStateFromIndex(index) {
-    const o = index % 2187;
-    let val = Math.floor(index / 2187);
-    const c = val % 720;
-    const p = Math.floor(val / 720);
-    return {
-        corners: {
-            permutation: getPermutationFromIndex(p, 8),
-            orientation: getOrientationFromIndex(o),
-        },
-        centers: getCenterFromIndex(c),
-    };
-}
-const MOVES = ["R", "R'", "U", "U'", "L", "L'", "B", "B'"];
-function solveSkewb(state) {
-    const startIdx = getStateIndex(state);
-    const solvedIdx = getStateIndex((0, state_js_1.createSolvedSkewbState)());
-    if (startIdx === solvedIdx)
-        return [];
-    const forwardMap = new Map();
-    const backwardMap = new Map();
-    const forwardQueue = [startIdx];
-    const backwardQueue = [solvedIdx];
-    forwardMap.set(startIdx, { move: "", parent: -1 });
-    backwardMap.set(solvedIdx, { move: "", parent: -1 });
-    while (forwardQueue.length > 0 && backwardQueue.length > 0) {
-        const fSize = forwardQueue.length;
-        for (let i = 0; i < Math.min(fSize, 1000); i++) {
-            const currIdx = forwardQueue.shift();
-            const currState = getStateFromIndex(currIdx);
-            for (const move of MOVES) {
-                const nextState = (0, moves_js_1.applySkewbMove)(currState, move);
-                const nextIdx = getStateIndex(nextState);
-                if (!forwardMap.has(nextIdx)) {
-                    forwardMap.set(nextIdx, { move, parent: currIdx });
-                    if (backwardMap.has(nextIdx))
-                        return reconstructPath(nextIdx, forwardMap, backwardMap);
-                    forwardQueue.push(nextIdx);
-                }
-            }
-        }
-        const bSize = backwardQueue.length;
-        for (let i = 0; i < Math.min(bSize, 1000); i++) {
-            const currIdx = backwardQueue.shift();
-            const currState = getStateFromIndex(currIdx);
-            for (const move of MOVES) {
-                const nextState = (0, moves_js_1.applySkewbMove)(currState, move);
-                const nextIdx = getStateIndex(nextState);
-                if (!backwardMap.has(nextIdx)) {
-                    const invMove = move.endsWith("'") ? move.slice(0, -1) : `${move}'`;
-                    backwardMap.set(nextIdx, { move: invMove, parent: currIdx });
-                    if (forwardMap.has(nextIdx))
-                        return reconstructPath(nextIdx, forwardMap, backwardMap);
-                    backwardQueue.push(nextIdx);
-                }
-            }
-        }
-    }
-    throw new Error("Skewb state is unsolvable");
-}
-function reconstructPath(meetingIdx, forwardMap, backwardMap) {
-    const path = [];
-    let curr = meetingIdx;
-    while (curr !== -1) {
-        const edge = forwardMap.get(curr);
-        if (edge.parent !== -1)
-            path.unshift(edge.move);
-        curr = edge.parent;
-    }
-    curr = meetingIdx;
-    while (curr !== -1) {
-        const edge = backwardMap.get(curr);
-        if (edge.parent !== -1)
-            path.push(edge.move);
-        curr = edge.parent;
-    }
-    return path;
-}