cubing 0.26.1 → 0.26.2

package/dist/esm/redi_cube-5B6YHJGL.js

@@ -1,565 +0,0 @@
-"use strict";
-import {
-  randomUIntBelowFactory
-} from "./chunk-V55YSWJY.js";
-import {
-  Alg
-} from "./chunk-QZOJPCN5.js";
-import "./chunk-MGJA5U5O.js";
-
-// src/cubing/vendor/xyzzy/redi_cube.js
-function factorial(n) {
-  if (n < 2)
-    return n;
-  let f = 1;
-  for (let i = 2; i <= n; i++)
-    f *= i;
-  return f;
-}
-function C(n, k) {
-  if (k < 0 || k > n)
-    return 0;
-  if (k === 0 || k === n)
-    return 1;
-  let c = 1;
-  for (let i = 0; i < k; i++) {
-    c = c * (n - i) / (i + 1) | 0;
-  }
-  return c;
-}
-function permutation_to_index(perm) {
-  perm = perm.slice();
-  let n = perm.length;
-  let f = factorial(n - 1);
-  let ind = 0;
-  while (n > 1) {
-    n--;
-    let e = perm[0];
-    ind += e * f;
-    for (let i = 0; i < n; i++) {
-      let x = perm[i + 1];
-      perm[i] = x - (x > e);
-    }
-    f /= n;
-  }
-  return ind;
-}
-function index_to_permutation(ind, n) {
-  let perm = [];
-  let f = factorial(n - 1);
-  for (let i = 0; i < n; i++) {
-    perm[i] = ind / f | 0;
-    ind %= f;
-    f /= n - 1 - i;
-  }
-  for (let i = n - 2; i >= 0; i--) {
-    for (let j = i + 1; j < n; j++) {
-      perm[j] += +(perm[j] >= perm[i]);
-    }
-  }
-  return perm;
-}
-function permutation_parity(A) {
-  let n = A.length;
-  let parity = 0;
-  for (let i = 0; i < n - 1; i++) {
-    for (let j = i; j < n; j++) {
-      if (A[i] > A[j])
-        parity ^= 1;
-    }
-  }
-  return parity;
-}
-function index_to_evenpermutation(ind, n) {
-  let perm = [];
-  let f = factorial(n - 1) / 2;
-  let parity = 0;
-  for (let i = 0; i < n - 1; i++) {
-    perm[i] = ind / f | 0;
-    ind %= f;
-    f /= n - 1 - i;
-  }
-  perm[n - 1] = 0;
-  for (let i = n - 2; i >= 0; i--) {
-    for (let j = i + 1; j < n; j++) {
-      if (perm[j] >= perm[i])
-        perm[j]++;
-      else
-        parity ^= 1;
-    }
-  }
-  if (parity === 1)
-    [perm[n - 2], perm[n - 1]] = [perm[n - 1], perm[n - 2]];
-  return perm;
-}
-function evenpermutation_to_index(perm) {
-  return permutation_to_index(perm) >> 1;
-}
-function comb_to_index(l) {
-  let bits = l.length;
-  let ones = 0;
-  for (let i = 0; i < bits; i++)
-    ones += +(l[i] === 1);
-  let zeros = bits - ones;
-  if (zeros === 0 || ones === 0 || bits === 1)
-    return 0;
-  let b = C(bits - 1, ones);
-  let ind = 0;
-  for (let i = 0; zeros > 0 && ones > 0 && bits > 1; i++) {
-    bits--;
-    if (l[i] === 0) {
-      b = b * --zeros / bits;
-    } else {
-      ind += b;
-      b = b * ones-- / bits;
-    }
-  }
-  return ind;
-}
-function index_to_comb(ind, ones, bits) {
-  let zeros = bits - ones;
-  let b = C(bits - 1, ones);
-  let l = [];
-  let n = bits - 1;
-  for (let i = 0; i < n; i++) {
-    bits--;
-    if (ind < b) {
-      l.push(0);
-      b = b * --zeros / bits;
-    } else {
-      l.push(1);
-      ind -= b;
-      b = b * ones-- / bits;
-    }
-  }
-  l.push(ones);
-  return l;
-}
-function compose(A, B) {
-  let C2 = [];
-  for (let i = 0; i < B.length; i++)
-    C2[i] = A[B[i]];
-  return C2;
-}
-function permutation_from_cycle(cycle, n) {
-  let perm = [];
-  for (let i = 0; i < n; i++)
-    perm[i] = i;
-  for (let i = 0; i < cycle.length; i++) {
-    perm[cycle[i]] = cycle[(i + 1) % cycle.length];
-  }
-  return perm;
-}
-function unsparsify_list(d, n) {
-  let l = Array(n).fill(0);
-  for (let k in d)
-    l[k] = d[k];
-  return l;
-}
-function compose_state(state1, state2) {
-  let o = Array(8).fill(0);
-  for (let i = 0; i < 8; i++)
-    o[i] = (state1[1][i] + state2[1][i]) % 3;
-  return [compose(state1[0], state2[0]), o];
-}
-var move_UL = [
-  permutation_from_cycle([0, 1, 4], 12),
-  unsparsify_list({ 0: 2 }, 8)
-];
-var move_U = [
-  permutation_from_cycle([1, 2, 5], 12),
-  unsparsify_list({ 1: 2 }, 8)
-];
-var move_UR = [
-  permutation_from_cycle([2, 3, 6], 12),
-  unsparsify_list({ 2: 2 }, 8)
-];
-var move_F = [
-  permutation_from_cycle([3, 0, 7], 12),
-  unsparsify_list({ 3: 2 }, 8)
-];
-var move_L = [
-  permutation_from_cycle([9, 8, 4], 12),
-  unsparsify_list({ 4: 2 }, 8)
-];
-var move_B = [
-  permutation_from_cycle([10, 9, 5], 12),
-  unsparsify_list({ 5: 2 }, 8)
-];
-var move_R = [
-  permutation_from_cycle([11, 10, 6], 12),
-  unsparsify_list({ 6: 2 }, 8)
-];
-var move_D = [
-  permutation_from_cycle([8, 11, 7], 12),
-  unsparsify_list({ 7: 2 }, 8)
-];
-var solved = [index_to_permutation(0, 12), Array(8).fill(0)];
-var moves = [move_UL, move_U, move_UR, move_F, move_L, move_B, move_R, move_D];
-var move_names = ["UL", "U", "UR", "F", "L", "B", "R", "D"];
-var tetrad = [0, 1, 0, 1, 1, 0, 1, 0];
-function stringify_move_sequence(move_sequence) {
-  let suffixes = ["0", "", "'"];
-  let s = move_sequence.map(([m, r]) => move_names[m] + suffixes[r]);
-  return s.join(" ");
-}
-function generate_random_state(randomUintBelow2) {
-  let p = index_to_evenpermutation(Math.floor(randomUintBelow2(factorial(12)) / 2), 12);
-  let o = Array(8);
-  for (let i = 0; i < 8; i++)
-    o[i] = randomUintBelow2(3);
-  return [p, o];
-}
-function generate_random_state_scramble(randomUintBelow2) {
-  return solve(generate_random_state(randomUintBelow2));
-}
-function solve(state) {
-  let phase1_indices = index_phase1(state);
-  let phase1_mtables = [
-    generate_phase1_edge_mtable(),
-    generate_phase1_separate_mtable()
-  ];
-  let phase1_ptables = [
-    generate_phase1_edge_ptable(),
-    generate_phase1_separate_ptable()
-  ];
-  let phase2_mtables = [
-    generate_phase2_edge_mtable(),
-    generate_phase2_corner_mtable()
-  ];
-  let phase2_ptables = [
-    generate_phase2_edge_ptable(),
-    generate_phase1_corner_ptable()
-  ];
-  let phase1gen = ida_solve_gen(phase1_indices, phase1_mtables, phase1_ptables);
-  let best = void 0;
-  let intermediate_states = /* @__PURE__ */ new Set();
-  let start_time = +new Date();
-  for (let i = 0; i < 25; i++) {
-    let { value: sol1, done } = phase1gen.next();
-    let new_state = state;
-    for (let [m, r] of sol1) {
-      for (let i2 = 0; i2 < r; i2++)
-        new_state = compose_state(new_state, moves[m]);
-    }
-    if (intermediate_states.has(new_state.toString())) {
-      continue;
-    } else
-      intermediate_states.add(new_state.toString());
-    let edge_ind = evenpermutation_to_index(new_state[0].slice(0, 8));
-    let corner_ind = 0;
-    for (let i2 = 0; i2 < 4; i2++)
-      corner_ind += new_state[1][i2] * 3 ** i2;
-    let phase2_indices = [edge_ind, corner_ind];
-    let moves_left = best ? best.length - sol1.length - 1 : 999999;
-    let sol2 = ida_solve(phase2_indices, phase2_mtables, phase2_ptables, moves_left);
-    if (sol2 === void 0) {
-      continue;
-    }
-    if (best === void 0 || best.length > sol1.length + sol2.length) {
-      best = sol1.concat(sol2);
-    }
-    if (new Date() - start_time > 300)
-      break;
-  }
-  return best;
-}
-function index_phase1(state) {
-  let edge_ind = 0;
-  for (let i = 0; i < 4; i++)
-    edge_ind += state[0].indexOf(i + 8) * 12 ** i;
-  let corner_ind = 0;
-  for (let i = 0; i < 4; i++)
-    corner_ind += state[1][i + 4] * 3 ** i;
-  let filtered = state[0].map((x) => Math.max(-1, x - 8));
-  let separate_ind = comb_to_index(filtered.map((x) => +(x >= 0))) * 2 + permutation_parity(filtered.filter((x) => x >= 0));
-  return [edge_ind, corner_ind + 81 * separate_ind];
-}
-var tables = {};
-function generate_phase1_corner_mtable() {
-  if (tables.phase1cm)
-    return tables.phase1cm;
-  let mtable = [];
-  for (let i = 0; i < 81; i++) {
-    mtable[i] = Array(8);
-    let o = [
-      i % 3,
-      Math.floor(i / 3) % 3,
-      Math.floor(i / 9) % 3,
-      Math.floor(i / 27)
-    ];
-    mtable[i][0] = mtable[i][1] = mtable[i][2] = mtable[i][3] = i;
-    for (let j = 0; j < 4; j++) {
-      o[j] = (o[j] + 2) % 3;
-      mtable[i][4 + j] = o[0] + o[1] * 3 + o[2] * 9 + o[3] * 27;
-      o[j] = (o[j] + 1) % 3;
-    }
-  }
-  return tables.phase1cm = mtable;
-}
-function generate_phase1_corner_ptable() {
-  if (tables.phase1cp)
-    return tables.phase1cp;
-  let ptable = Array(81);
-  for (let i = 0; i < 81; i++) {
-    let o = [
-      i % 3,
-      Math.floor(i / 3) % 3,
-      Math.floor(i / 9) % 3,
-      Math.floor(i / 27)
-    ];
-    ptable[i] = (o[0] !== 0) + (o[1] !== 0) + (o[2] !== 0) + (o[3] !== 0);
-  }
-  return tables.phase1cp = ptable;
-}
-function generate_phase1_edge_mtable() {
-  if (tables.phase1em)
-    return tables.phase1em;
-  let mtable_single = [];
-  for (let i = 0; i < 12; i++) {
-    mtable_single[i] = [];
-    for (let m = 0; m < 8; m++) {
-      mtable_single[i][m] = moves[m][0].indexOf(i);
-    }
-  }
-  let mtable = Array(12 ** 4);
-  for (let i = 0; i < 12 ** 4; i++) {
-    mtable[i] = Array(8);
-    for (let m = 0; m < 8; m++) {
-      let I = 0;
-      for (let j = 0; j < 4; j++) {
-        I += mtable_single[Math.floor(i / 12 ** j) % 12][m] * 12 ** j;
-      }
-      mtable[i][m] = I;
-    }
-  }
-  return tables.phase1em = mtable;
-}
-function generate_phase1_edge_ptable() {
-  if (tables.phase1ep)
-    return tables.phase1ep;
-  return tables.phase1ep = bfs(generate_phase1_edge_mtable(), [
-    8 + 12 * (9 + 12 * (10 + 12 * 11))
-  ]);
-}
-function generate_phase1_separate_mtable() {
-  if (tables.phase1sm)
-    return tables.phase1sm;
-  const C12_4 = C(12, 4);
-  let mtable_c = [];
-  for (let i = 0; i < C12_4; i++) {
-    mtable_c[i] = [];
-    let comb = index_to_comb(i, 4, 12), perm = [];
-    for (let j = 0, k = 0; j < 12; j++) {
-      if (comb[j] === 0)
-        perm[j] = -1;
-      else
-        perm[j] = k++;
-    }
-    for (let m = 0; m < 8; m++) {
-      let new_perm = compose(perm, moves[m][0]);
-      let new_comb = compose(comb, moves[m][0]);
-      let parity = permutation_parity(new_perm.filter((x) => x >= 0));
-      mtable_c[i][m] = comb_to_index(new_comb) * 2 + parity;
-    }
-  }
-  let mtable_co = generate_phase1_corner_mtable();
-  let mtable = [];
-  for (let j = 0; j < C12_4; j++) {
-    for (let i = 0; i < 81; i++) {
-      let m0 = mtable[i + 81 * (2 * j)] = [];
-      let m1 = mtable[i + 81 * (2 * j + 1)] = [];
-      for (let m = 0; m < 8; m++) {
-        m0[m] = mtable_co[i][m] + 81 * mtable_c[j][m];
-        m1[m] = mtable_co[i][m] + 81 * (mtable_c[j][m] ^ 1);
-      }
-    }
-  }
-  return tables.phase1sm = mtable;
-}
-function generate_phase1_separate_ptable() {
-  if (tables.phase1sp)
-    return tables.phase1sp;
-  return tables.phase1sp = bfs(generate_phase1_separate_mtable(), [0]);
-}
-function generate_phase2_corner_mtable() {
-  if (tables.phase2cm)
-    return tables.phase2cm;
-  let phase1_mtable = generate_phase1_corner_mtable();
-  let mtable = Array(81);
-  for (let i = 0; i < 81; i++) {
-    mtable[i] = phase1_mtable[i].slice(4, 8);
-  }
-  return tables.phase2cm = mtable;
-}
-function generate_phase2_edge_mtable() {
-  if (tables.phase2em)
-    return tables.phase2em;
-  const n = 8;
-  const HALFFACT8 = factorial(n) / 2;
-  let mtable = Array(HALFFACT8);
-  let perm = [0, 1, 2, 3, 4, 5, 6, 7];
-  for (let i = 0; i < HALFFACT8; i++) {
-    mtable[i] = Array(4);
-    for (let m = 0; m < 4; m++) {
-      let new_perm = compose(perm, moves[m][0].slice(0, 8));
-      mtable[i][m] = evenpermutation_to_index(new_perm);
-    }
-    if (i === HALFFACT8 - 1)
-      break;
-    let parity = 0;
-    do {
-      for (let k = n - 2; k >= 0; k--) {
-        if (perm[k] > perm[k + 1])
-          continue;
-        let l = k + 1;
-        for (let L = l; L < n; L++)
-          if (perm[L] > perm[k])
-            l = L;
-        [perm[k], perm[l]] = [perm[l], perm[k]];
-        parity ^= 1;
-        for (let j = 0; k + 1 + j < n - 1 - j; j++, parity ^= 1) {
-          [perm[k + 1 + j], perm[n - 1 - j]] = [
-            perm[n - 1 - j],
-            perm[k + 1 + j]
-          ];
-        }
-        break;
-      }
-    } while (parity !== 0);
-  }
-  return tables.phase2em = mtable;
-}
-function generate_phase2_edge_ptable() {
-  if (tables.phase2ep)
-    return tables.phase2ep;
-  return tables.phase2ep = bfs(generate_phase2_edge_mtable(), [0]);
-}
-function bfs(mtable, goal_states) {
-  let N = mtable.length;
-  let nmoves = mtable[0].length;
-  let ptable = Array(N).fill(-1);
-  let queue = goal_states.slice(), new_queue = [];
-  let depth = 0;
-  while (queue.length > 0) {
-    new_queue.length = 0;
-    for (let state of queue) {
-      if (ptable[state] !== -1)
-        continue;
-      ptable[state] = depth;
-      for (let move_index = 0; move_index < nmoves; move_index++) {
-        let new_state = mtable[state][move_index];
-        while (new_state != state) {
-          new_queue.push(new_state);
-          new_state = mtable[new_state][move_index];
-        }
-      }
-    }
-    [queue, new_queue] = [new_queue, queue];
-    depth += 1;
-  }
-  return ptable;
-}
-function ida_solve(indices, mtables, ptables, max_bound) {
-  max_bound = max_bound || 999999;
-  let ncoords = indices.length;
-  let bound = 0;
-  for (let i = 0; i < ncoords; i++)
-    bound = Math.max(bound, ptables[i][indices[i]]);
-  while (bound <= max_bound) {
-    let path = ida_search(indices, mtables, ptables, bound, -1);
-    if (path !== void 0)
-      return path;
-    bound++;
-  }
-}
-function ida_search(indices, mtables, ptables, bound, last) {
-  let ncoords = indices.length;
-  let nmoves = mtables[0][0].length;
-  let heuristic = 0;
-  for (let i = 0; i < ncoords; i++)
-    heuristic = Math.max(heuristic, ptables[i][indices[i]]);
-  if (heuristic > bound)
-    return;
-  if (bound === 0)
-    return [];
-  if (heuristic === 0 && bound === 1)
-    return;
-  for (let m = 0; m < nmoves; m++) {
-    if (m === last)
-      continue;
-    if (m < last && tetrad[m] == tetrad[last])
-      continue;
-    let new_indices = indices.slice();
-    for (let c = 0; c < ncoords; c++)
-      new_indices[c] = mtables[c][indices[c]][m];
-    let r = 1;
-    while (indices.some((_, i) => indices[i] != new_indices[i])) {
-      let subpath = ida_search(new_indices, mtables, ptables, bound - 1, m);
-      if (subpath !== void 0)
-        return [[m, r]].concat(subpath);
-      for (let c = 0; c < ncoords; c++) {
-        new_indices[c] = mtables[c][new_indices[c]][m];
-      }
-      r++;
-    }
-  }
-  return;
-}
-function* ida_solve_gen(indices, mtables, ptables) {
-  let ncoords = indices.length;
-  let bound = 0;
-  for (let i = 0; i < ncoords; i++)
-    bound = Math.max(bound, ptables[i][indices[i]]);
-  while (true) {
-    yield* ida_search_gen(indices, mtables, ptables, bound, -1);
-    bound++;
-  }
-}
-function* ida_search_gen(indices, mtables, ptables, bound, last) {
-  let ncoords = indices.length;
-  let nmoves = mtables[0][0].length;
-  let heuristic = 0;
-  for (let i = 0; i < ncoords; i++)
-    heuristic = Math.max(heuristic, ptables[i][indices[i]]);
-  if (heuristic > bound)
-    return;
-  if (bound === 0) {
-    yield [];
-    return;
-  }
-  if (heuristic === 0 && bound === 1)
-    return;
-  for (let m = 0; m < nmoves; m++) {
-    if (m === last)
-      continue;
-    if (m < last && tetrad[m] == tetrad[last])
-      continue;
-    let new_indices = indices.slice();
-    for (let c = 0; c < ncoords; c++)
-      new_indices[c] = mtables[c][indices[c]][m];
-    let r = 1;
-    while (indices.some((_, i) => indices[i] != new_indices[i])) {
-      let subpath_gen = ida_search_gen(new_indices, mtables, ptables, bound - 1, m);
-      while (true) {
-        let { value: subpath, done } = subpath_gen.next();
-        if (done)
-          break;
-        yield [[m, r]].concat(subpath);
-      }
-      for (let c = 0; c < ncoords; c++) {
-        new_indices[c] = mtables[c][new_indices[c]][m];
-      }
-      r++;
-    }
-  }
-}
-var randomUintBelow = randomUIntBelowFactory();
-async function getRandomRediCubeScramble() {
-  return new Alg(stringify_move_sequence(generate_random_state_scramble(await randomUintBelow)));
-}
-"use strict";
-export {
-  getRandomRediCubeScramble
-};
-//# sourceMappingURL=redi_cube-5B6YHJGL.js.map

package/dist/esm/redi_cube-5B6YHJGL.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/cubing/vendor/xyzzy/redi_cube.js"],
-  "sourcesContent": ["/* eslint-disable */\n/* Redi cube scramble generator */\n// From https://torchlight.github.io/rediscrambler.js\n// Added to `cubing.js` under the GPL license by permission from the author (@torchlight/xyzzy).\n\n\"use strict\";\n\nimport { Alg } from \"../../alg\";\nimport { randomUIntBelowFactory } from \"../random-uint-below\";\n\nfunction counter(A) {\n  let counts = [];\n  for (let a of A) counts[a] = (counts[a] || 0) + 1;\n  return counts;\n}\n\n/* Combinatoric functions */\n\nfunction factorial(n) {\n  if (n < 2) return n;\n  let f = 1;\n  for (let i = 2; i <= n; i++) f *= i;\n  return f;\n}\n\nfunction C(n, k) {\n  if (k < 0 || k > n) return 0;\n  if (k === 0 || k === n) return 1;\n  let c = 1;\n  for (let i = 0; i < k; i++) {\n    c = ((c * (n - i)) / (i + 1)) | 0;\n  }\n  return c;\n}\n\nfunction permutation_to_index(perm) {\n  perm = perm.slice();\n  let n = perm.length;\n  let f = factorial(n - 1);\n  let ind = 0;\n  while (n > 1) {\n    n--;\n    // invariant: f == factorial(n)\n    // also, perm stores meaningful values up to perm[n]\n    let e = perm[0];\n    ind += e * f;\n    for (let i = 0; i < n; i++) {\n      let x = perm[i + 1];\n      perm[i] = x - (x > e);\n    }\n    f /= n;\n  }\n  return ind;\n}\n\nfunction index_to_permutation(ind, n) {\n  let perm = [];\n  let f = factorial(n - 1);\n  for (let i = 0; i < n; i++) {\n    perm[i] = (ind / f) | 0;\n    ind %= f;\n    f /= n - 1 - i;\n  }\n  // could probably use some kind of binary tree to make this linearithmic, but I am hella lazy.\n  for (let i = n - 2; i >= 0; i--) {\n    for (let j = i + 1; j < n; j++) {\n      perm[j] += +(perm[j] >= perm[i]);\n    }\n  }\n  return perm;\n}\n\nfunction permutation_parity(A) {\n  let n = A.length;\n  let parity = 0;\n  // again, there is a linearithmic algorithm to count inversions, but >lazy\n  for (let i = 0; i < n - 1; i++) {\n    for (let j = i; j < n; j++) {\n      if (A[i] > A[j]) parity ^= 1;\n    }\n  }\n  return parity;\n}\n\nfunction index_to_evenpermutation(ind, n) {\n  let perm = [];\n  let f = factorial(n - 1) / 2;\n  let parity = 0;\n  for (let i = 0; i < n - 1; i++) {\n    perm[i] = (ind / f) | 0;\n    ind %= f;\n    f /= n - 1 - i;\n  }\n  perm[n - 1] = 0;\n  for (let i = n - 2; i >= 0; i--) {\n    for (let j = i + 1; j < n; j++) {\n      if (perm[j] >= perm[i]) perm[j]++;\n      else parity ^= 1;\n    }\n  }\n  if (parity === 1) [perm[n - 2], perm[n - 1]] = [perm[n - 1], perm[n - 2]];\n  return perm;\n}\n\nfunction evenpermutation_to_index(perm) {\n  return permutation_to_index(perm) >> 1;\n}\n\nfunction comb_to_index(l) {\n  let bits = l.length;\n  let ones = 0;\n  for (let i = 0; i < bits; i++) ones += +(l[i] === 1);\n  let zeros = bits - ones;\n  if (zeros === 0 || ones === 0 || bits === 1) return 0;\n  let b = C(bits - 1, ones);\n  let ind = 0;\n  for (let i = 0; zeros > 0 && ones > 0 && bits > 1; i++) {\n    bits--;\n    if (l[i] === 0) {\n      b = (b * --zeros) / bits;\n    } // l[i] === 1\n    else {\n      ind += b;\n      b = (b * ones--) / bits;\n    }\n  }\n  return ind;\n}\n\nfunction index_to_comb(ind, ones, bits) {\n  let zeros = bits - ones;\n  let b = C(bits - 1, ones);\n  let l = [];\n  let n = bits - 1;\n  for (let i = 0; i < n; i++) {\n    bits--;\n    if (ind < b) {\n      l.push(0);\n      b = (b * --zeros) / bits;\n    } else {\n      l.push(1);\n      ind -= b;\n      b = (b * ones--) / bits;\n    }\n  }\n  l.push(ones);\n  return l;\n}\n\nfunction compose(A, B) {\n  let C = [];\n  for (let i = 0; i < B.length; i++) C[i] = A[B[i]];\n  return C;\n}\n\nfunction permutation_from_cycle(cycle, n) {\n  let perm = [];\n  for (let i = 0; i < n; i++) perm[i] = i;\n  for (let i = 0; i < cycle.length; i++) {\n    perm[cycle[i]] = cycle[(i + 1) % cycle.length];\n  }\n  return perm;\n}\n\nfunction unsparsify_list(d, n) {\n  let l = Array(n).fill(0);\n  for (let k in d) l[k] = d[k];\n  return l;\n}\n\nfunction compose_state(state1, state2) {\n  let o = Array(8).fill(0);\n  for (let i = 0; i < 8; i++) o[i] = (state1[1][i] + state2[1][i]) % 3;\n  return [compose(state1[0], state2[0]), o];\n}\n\nlet move_UL = [\n  permutation_from_cycle([0, 1, 4], 12),\n  unsparsify_list({ 0: 2 }, 8),\n];\nlet move_U = [\n  permutation_from_cycle([1, 2, 5], 12),\n  unsparsify_list({ 1: 2 }, 8),\n];\nlet move_UR = [\n  permutation_from_cycle([2, 3, 6], 12),\n  unsparsify_list({ 2: 2 }, 8),\n];\nlet move_F = [\n  permutation_from_cycle([3, 0, 7], 12),\n  unsparsify_list({ 3: 2 }, 8),\n];\nlet move_L = [\n  permutation_from_cycle([9, 8, 4], 12),\n  unsparsify_list({ 4: 2 }, 8),\n];\nlet move_B = [\n  permutation_from_cycle([10, 9, 5], 12),\n  unsparsify_list({ 5: 2 }, 8),\n];\nlet move_R = [\n  permutation_from_cycle([11, 10, 6], 12),\n  unsparsify_list({ 6: 2 }, 8),\n];\nlet move_D = [\n  permutation_from_cycle([8, 11, 7], 12),\n  unsparsify_list({ 7: 2 }, 8),\n];\n\nlet solved = [index_to_permutation(0, 12), Array(8).fill(0)];\n\nlet moves = [move_UL, move_U, move_UR, move_F, move_L, move_B, move_R, move_D];\nlet move_names = [\"UL\", \"U\", \"UR\", \"F\", \"L\", \"B\", \"R\", \"D\"];\nlet tetrad = [0, 1, 0, 1, 1, 0, 1, 0];\n\nfunction apply_move_sequence(state, move_sequence) {\n  for (let [m, r] of move_sequence) {\n    for (let i = 0; i < r; i++) state = compose_state(state, moves[m]);\n  }\n  return state;\n}\n\nfunction stringify_move_sequence(move_sequence) {\n  let suffixes = [\"0\", \"\", \"'\"];\n  let s = move_sequence.map(([m, r]) => move_names[m] + suffixes[r]);\n  return s.join(\" \");\n}\n\nfunction print_move_sequence(move_sequence) {\n  console.log(stringify_move_sequence(move_sequence));\n}\n\nfunction generate_random_state(randomUintBelow) {\n  let p = index_to_evenpermutation(\n    Math.floor(randomUintBelow(factorial(12)) / 2),\n    12,\n  );\n  let o = Array(8);\n  for (let i = 0; i < 8; i++) o[i] = randomUintBelow(3);\n  return [p, o];\n}\n\nfunction generate_random_state_scramble(randomUintBelow) {\n  return solve(generate_random_state(randomUintBelow));\n}\n\nfunction generate_scramble_sequence() {\n  return stringify_move_sequence(generate_random_state_scramble());\n}\n\nfunction solve(state) {\n  let phase1_indices = index_phase1(state);\n  let phase1_mtables = [\n    generate_phase1_edge_mtable(),\n    generate_phase1_separate_mtable(),\n  ];\n  let phase1_ptables = [\n    generate_phase1_edge_ptable(),\n    generate_phase1_separate_ptable(),\n  ];\n  let phase2_mtables = [\n    generate_phase2_edge_mtable(),\n    generate_phase2_corner_mtable(),\n  ];\n  let phase2_ptables = [\n    generate_phase2_edge_ptable(),\n    generate_phase1_corner_ptable(),\n  ];\n\n  let phase1gen = ida_solve_gen(phase1_indices, phase1_mtables, phase1_ptables);\n  let best = undefined;\n  let intermediate_states = new Set();\n  let start_time = +new Date();\n  for (let i = 0; i < 25; i++) {\n    let { value: sol1, done } = phase1gen.next();\n    let new_state = state;\n    for (let [m, r] of sol1) {\n      for (let i = 0; i < r; i++)\n        new_state = compose_state(new_state, moves[m]);\n    }\n    if (intermediate_states.has(new_state.toString())) {\n      // console.log(\"skip\");\n      continue;\n    } else intermediate_states.add(new_state.toString());\n    let edge_ind = evenpermutation_to_index(new_state[0].slice(0, 8));\n    let corner_ind = 0;\n    for (let i = 0; i < 4; i++) corner_ind += new_state[1][i] * 3 ** i;\n    let phase2_indices = [edge_ind, corner_ind];\n    //let sol2 = [];\n    let moves_left = best ? best.length - sol1.length - 1 : 999999;\n    let sol2 = ida_solve(\n      phase2_indices,\n      phase2_mtables,\n      phase2_ptables,\n      moves_left,\n    );\n    if (sol2 === undefined) {\n      // console.log(\"prune\");\n      continue;\n    }\n    // console.log(\n    //   `to ${new_state} in ${sol1.length} moves; total move count ${\n    //     sol1.length + sol2.length\n    //   }`,\n    // );\n    if (best === undefined || best.length > sol1.length + sol2.length) {\n      best = sol1.concat(sol2);\n    }\n    // bail if we've spent too much time\n    if (new Date() - start_time > 300) break;\n  }\n  return best;\n}\n\nfunction index_phase1(state) {\n  let edge_ind = 0;\n  for (let i = 0; i < 4; i++) edge_ind += state[0].indexOf(i + 8) * 12 ** i;\n  let corner_ind = 0;\n  for (let i = 0; i < 4; i++) corner_ind += state[1][i + 4] * 3 ** i;\n  let filtered = state[0].map((x) => Math.max(-1, x - 8));\n  let separate_ind =\n    comb_to_index(filtered.map((x) => +(x >= 0))) * 2 +\n    permutation_parity(filtered.filter((x) => x >= 0));\n  return [edge_ind, corner_ind + 81 * separate_ind];\n}\n\nlet tables = {};\n\nfunction generate_phase1_corner_mtable() {\n  if (tables.phase1cm) return tables.phase1cm;\n  let mtable = [];\n  for (let i = 0; i < 81; i++) {\n    mtable[i] = Array(8);\n    let o = [\n      i % 3,\n      Math.floor(i / 3) % 3,\n      Math.floor(i / 9) % 3,\n      Math.floor(i / 27),\n    ];\n    mtable[i][0] = mtable[i][1] = mtable[i][2] = mtable[i][3] = i;\n    for (let j = 0; j < 4; j++) {\n      o[j] = (o[j] + 2) % 3;\n      mtable[i][4 + j] = o[0] + o[1] * 3 + o[2] * 9 + o[3] * 27;\n      o[j] = (o[j] + 1) % 3;\n    }\n  }\n  return (tables.phase1cm = mtable);\n}\n\nfunction generate_phase1_corner_ptable() {\n  if (tables.phase1cp) return tables.phase1cp;\n  let ptable = Array(81);\n  for (let i = 0; i < 81; i++) {\n    let o = [\n      i % 3,\n      Math.floor(i / 3) % 3,\n      Math.floor(i / 9) % 3,\n      Math.floor(i / 27),\n    ];\n    ptable[i] = (o[0] !== 0) + (o[1] !== 0) + (o[2] !== 0) + (o[3] !== 0);\n  }\n  return (tables.phase1cp = ptable);\n}\n\nfunction generate_phase1_edge_mtable() {\n  if (tables.phase1em) return tables.phase1em;\n  let mtable_single = [];\n  for (let i = 0; i < 12; i++) {\n    mtable_single[i] = [];\n    for (let m = 0; m < 8; m++) {\n      mtable_single[i][m] = moves[m][0].indexOf(i);\n    }\n  }\n  let mtable = Array(12 ** 4);\n  for (let i = 0; i < 12 ** 4; i++) {\n    mtable[i] = Array(8);\n    for (let m = 0; m < 8; m++) {\n      let I = 0;\n      for (let j = 0; j < 4; j++) {\n        I += mtable_single[Math.floor(i / 12 ** j) % 12][m] * 12 ** j;\n      }\n      mtable[i][m] = I;\n    }\n  }\n  return (tables.phase1em = mtable);\n}\n\nfunction generate_phase1_edge_ptable() {\n  if (tables.phase1ep) return tables.phase1ep;\n  return (tables.phase1ep = bfs(generate_phase1_edge_mtable(), [\n    8 + 12 * (9 + 12 * (10 + 12 * 11)),\n  ]));\n}\n\nfunction generate_phase1_separate_mtable() {\n  if (tables.phase1sm) return tables.phase1sm;\n  const C12_4 = C(12, 4);\n  let mtable_c = [];\n  for (let i = 0; i < C12_4; i++) {\n    mtable_c[i] = [];\n    let comb = index_to_comb(i, 4, 12),\n      perm = [];\n    for (let j = 0, k = 0; j < 12; j++) {\n      if (comb[j] === 0) perm[j] = -1;\n      else perm[j] = k++;\n    }\n    for (let m = 0; m < 8; m++) {\n      let new_perm = compose(perm, moves[m][0]);\n      let new_comb = compose(comb, moves[m][0]);\n      let parity = permutation_parity(new_perm.filter((x) => x >= 0));\n      mtable_c[i][m] = comb_to_index(new_comb) * 2 + parity;\n    }\n  }\n  let mtable_co = generate_phase1_corner_mtable();\n  let mtable = [];\n  for (let j = 0; j < C12_4; j++) {\n    for (let i = 0; i < 81; i++) {\n      let m0 = (mtable[i + 81 * (2 * j)] = []);\n      let m1 = (mtable[i + 81 * (2 * j + 1)] = []);\n      for (let m = 0; m < 8; m++) {\n        m0[m] = mtable_co[i][m] + 81 * mtable_c[j][m];\n        m1[m] = mtable_co[i][m] + 81 * (mtable_c[j][m] ^ 1);\n      }\n    }\n  }\n  return (tables.phase1sm = mtable);\n}\n\nfunction generate_phase1_separate_ptable() {\n  if (tables.phase1sp) return tables.phase1sp;\n  return (tables.phase1sp = bfs(generate_phase1_separate_mtable(), [0]));\n}\n\nfunction generate_phase2_corner_mtable() {\n  if (tables.phase2cm) return tables.phase2cm;\n  let phase1_mtable = generate_phase1_corner_mtable();\n  let mtable = Array(81);\n  for (let i = 0; i < 81; i++) {\n    mtable[i] = phase1_mtable[i].slice(4, 8);\n  }\n  return (tables.phase2cm = mtable);\n}\n\nfunction generate_phase2_edge_mtable() {\n  if (tables.phase2em) return tables.phase2em;\n  const n = 8;\n  const HALFFACT8 = factorial(n) / 2;\n  let mtable = Array(HALFFACT8);\n  let perm = [0, 1, 2, 3, 4, 5, 6, 7];\n  for (let i = 0; i < HALFFACT8; i++) {\n    //perm = index_to_evenpermutation(i, 8);\n    mtable[i] = Array(4);\n    for (let m = 0; m < 4; m++) {\n      let new_perm = compose(perm, moves[m][0].slice(0, 8));\n      mtable[i][m] = evenpermutation_to_index(new_perm);\n    }\n\n    if (i === HALFFACT8 - 1) break;\n    // update perm to lex-next even permutation\n    let parity = 0;\n    do {\n      for (let k = n - 2; k >= 0; k--) {\n        if (perm[k] > perm[k + 1]) continue;\n        let l = k + 1;\n        for (let L = l; L < n; L++) if (perm[L] > perm[k]) l = L;\n        [perm[k], perm[l]] = [perm[l], perm[k]];\n        parity ^= 1;\n        for (let j = 0; k + 1 + j < n - 1 - j; j++, parity ^= 1) {\n          [perm[k + 1 + j], perm[n - 1 - j]] = [\n            perm[n - 1 - j],\n            perm[k + 1 + j],\n          ];\n        }\n        break;\n      }\n    } while (parity !== 0);\n  }\n  return (tables.phase2em = mtable);\n}\n\nfunction generate_phase2_edge_ptable() {\n  if (tables.phase2ep) return tables.phase2ep;\n  return (tables.phase2ep = bfs(generate_phase2_edge_mtable(), [0]));\n}\n\nfunction bfs(mtable, goal_states) {\n  let N = mtable.length;\n  let nmoves = mtable[0].length;\n  let ptable = Array(N).fill(-1);\n  let queue = goal_states.slice(),\n    new_queue = [];\n  let depth = 0;\n  while (queue.length > 0) {\n    new_queue.length = 0;\n    for (let state of queue) {\n      if (ptable[state] !== -1) continue;\n      ptable[state] = depth;\n      for (let move_index = 0; move_index < nmoves; move_index++) {\n        let new_state = mtable[state][move_index];\n        while (new_state != state) {\n          new_queue.push(new_state);\n          new_state = mtable[new_state][move_index];\n        }\n      }\n    }\n    [queue, new_queue] = [new_queue, queue];\n    depth += 1;\n  }\n  return ptable;\n}\n\nfunction ida_solve(indices, mtables, ptables, max_bound) {\n  max_bound = max_bound || 999999;\n  let ncoords = indices.length;\n  let bound = 0;\n  for (let i = 0; i < ncoords; i++)\n    bound = Math.max(bound, ptables[i][indices[i]]);\n  while (bound <= max_bound) {\n    let path = ida_search(indices, mtables, ptables, bound, -1);\n    if (path !== undefined) return path;\n    bound++;\n  }\n}\n\nfunction ida_search(indices, mtables, ptables, bound, last) {\n  let ncoords = indices.length;\n  let nmoves = mtables[0][0].length;\n  let heuristic = 0;\n  for (let i = 0; i < ncoords; i++)\n    heuristic = Math.max(heuristic, ptables[i][indices[i]]);\n  if (heuristic > bound) return;\n  if (bound === 0) return [];\n  if (heuristic === 0 && bound === 1) return;\n  for (let m = 0; m < nmoves; m++) {\n    if (m === last) continue;\n    if (m < last && tetrad[m] == tetrad[last]) continue;\n    let new_indices = indices.slice();\n    for (let c = 0; c < ncoords; c++)\n      new_indices[c] = mtables[c][indices[c]][m];\n    let r = 1;\n    while (indices.some((_, i) => indices[i] != new_indices[i])) {\n      let subpath = ida_search(new_indices, mtables, ptables, bound - 1, m);\n      if (subpath !== undefined) return [[m, r]].concat(subpath);\n      for (let c = 0; c < ncoords; c++) {\n        new_indices[c] = mtables[c][new_indices[c]][m];\n      }\n      r++;\n    }\n  }\n  return;\n}\n\nfunction* ida_solve_gen(indices, mtables, ptables) {\n  let ncoords = indices.length;\n  let bound = 0;\n  for (let i = 0; i < ncoords; i++)\n    bound = Math.max(bound, ptables[i][indices[i]]);\n  while (true) {\n    yield* ida_search_gen(indices, mtables, ptables, bound, -1);\n    bound++;\n  }\n}\n\nfunction* ida_search_gen(indices, mtables, ptables, bound, last) {\n  let ncoords = indices.length;\n  let nmoves = mtables[0][0].length;\n  let heuristic = 0;\n  for (let i = 0; i < ncoords; i++)\n    heuristic = Math.max(heuristic, ptables[i][indices[i]]);\n  if (heuristic > bound) return;\n  if (bound === 0) {\n    yield [];\n    return;\n  }\n  if (heuristic === 0 && bound === 1) return;\n  for (let m = 0; m < nmoves; m++) {\n    if (m === last) continue;\n    if (m < last && tetrad[m] == tetrad[last]) continue;\n    let new_indices = indices.slice();\n    for (let c = 0; c < ncoords; c++)\n      new_indices[c] = mtables[c][indices[c]][m];\n    let r = 1;\n    while (indices.some((_, i) => indices[i] != new_indices[i])) {\n      let subpath_gen = ida_search_gen(\n        new_indices,\n        mtables,\n        ptables,\n        bound - 1,\n        m,\n      );\n      while (true) {\n        let { value: subpath, done } = subpath_gen.next();\n        if (done) break;\n        yield [[m, r]].concat(subpath);\n      }\n      for (let c = 0; c < ncoords; c++) {\n        new_indices[c] = mtables[c][new_indices[c]][m];\n      }\n      r++;\n    }\n  }\n}\n\nconst randomUintBelow = randomUIntBelowFactory();\nexport async function getRandomRediCubeScramble() {\n  return new Alg(\n    stringify_move_sequence(\n      generate_random_state_scramble(await randomUintBelow),\n    ),\n  );\n}\n"],
-  "mappings": ";;;;;;;;;;AAkBA,mBAAmB,GAAG;AACpB,MAAI,IAAI;AAAG,WAAO;AAClB,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,KAAK,GAAG;AAAK,SAAK;AAClC,SAAO;AACT;AAEA,WAAW,GAAG,GAAG;AACf,MAAI,IAAI,KAAK,IAAI;AAAG,WAAO;AAC3B,MAAI,MAAM,KAAK,MAAM;AAAG,WAAO;AAC/B,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAM,IAAK,KAAI,KAAO,KAAI,KAAM;AAAA,EAClC;AACA,SAAO;AACT;AAEA,8BAA8B,MAAM;AAClC,SAAO,KAAK,MAAM;AAClB,MAAI,IAAI,KAAK;AACb,MAAI,IAAI,UAAU,IAAI,CAAC;AACvB,MAAI,MAAM;AACV,SAAO,IAAI,GAAG;AACZ;AAGA,QAAI,IAAI,KAAK;AACb,WAAO,IAAI;AACX,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,IAAI,KAAK,IAAI;AACjB,WAAK,KAAK,IAAK,KAAI;AAAA,IACrB;AACA,SAAK;AAAA,EACP;AACA,SAAO;AACT;AAEA,8BAA8B,KAAK,GAAG;AACpC,MAAI,OAAO,CAAC;AACZ,MAAI,IAAI,UAAU,IAAI,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,SAAK,KAAM,MAAM,IAAK;AACtB,WAAO;AACP,SAAK,IAAI,IAAI;AAAA,EACf;AAEA,WAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,aAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,WAAK,MAAM,CAAE,MAAK,MAAM,KAAK;AAAA,IAC/B;AAAA,EACF;AACA,SAAO;AACT;AAEA,4BAA4B,GAAG;AAC7B,MAAI,IAAI,EAAE;AACV,MAAI,SAAS;AAEb,WAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,EAAE,KAAK,EAAE;AAAI,kBAAU;AAAA,IAC7B;AAAA,EACF;AACA,SAAO;AACT;AAEA,kCAAkC,KAAK,GAAG;AACxC,MAAI,OAAO,CAAC;AACZ,MAAI,IAAI,UAAU,IAAI,CAAC,IAAI;AAC3B,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,SAAK,KAAM,MAAM,IAAK;AACtB,WAAO;AACP,SAAK,IAAI,IAAI;AAAA,EACf;AACA,OAAK,IAAI,KAAK;AACd,WAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,aAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,UAAI,KAAK,MAAM,KAAK;AAAI,aAAK;AAAA;AACxB,kBAAU;AAAA,IACjB;AAAA,EACF;AACA,MAAI,WAAW;AAAG,KAAC,KAAK,IAAI,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,KAAK,IAAI,IAAI,KAAK,IAAI,EAAE;AACxE,SAAO;AACT;AAEA,kCAAkC,MAAM;AACtC,SAAO,qBAAqB,IAAI,KAAK;AACvC;AAEA,uBAAuB,GAAG;AACxB,MAAI,OAAO,EAAE;AACb,MAAI,OAAO;AACX,WAAS,IAAI,GAAG,IAAI,MAAM;AAAK,YAAQ,CAAE,GAAE,OAAO;AAClD,MAAI,QAAQ,OAAO;AACnB,MAAI,UAAU,KAAK,SAAS,KAAK,SAAS;AAAG,WAAO;AACpD,MAAI,IAAI,EAAE,OAAO,GAAG,IAAI;AACxB,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,QAAQ,KAAK,OAAO,KAAK,OAAO,GAAG,KAAK;AACtD;AACA,QAAI,EAAE,OAAO,GAAG;AACd,UAAK,IAAI,EAAE,QAAS;AAAA,IACtB,OACK;AACH,aAAO;AACP,UAAK,IAAI,SAAU;AAAA,IACrB;AAAA,EACF;AACA,SAAO;AACT;AAEA,uBAAuB,KAAK,MAAM,MAAM;AACtC,MAAI,QAAQ,OAAO;AACnB,MAAI,IAAI,EAAE,OAAO,GAAG,IAAI;AACxB,MAAI,IAAI,CAAC;AACT,MAAI,IAAI,OAAO;AACf,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B;AACA,QAAI,MAAM,GAAG;AACX,QAAE,KAAK,CAAC;AACR,UAAK,IAAI,EAAE,QAAS;AAAA,IACtB,OAAO;AACL,QAAE,KAAK,CAAC;AACR,aAAO;AACP,UAAK,IAAI,SAAU;AAAA,IACrB;AAAA,EACF;AACA,IAAE,KAAK,IAAI;AACX,SAAO;AACT;AAEA,iBAAiB,GAAG,GAAG;AACrB,MAAI,KAAI,CAAC;AACT,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ;AAAK,OAAE,KAAK,EAAE,EAAE;AAC9C,SAAO;AACT;AAEA,gCAAgC,OAAO,GAAG;AACxC,MAAI,OAAO,CAAC;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG;AAAK,SAAK,KAAK;AACtC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,SAAK,MAAM,MAAM,MAAO,KAAI,KAAK,MAAM;AAAA,EACzC;AACA,SAAO;AACT;AAEA,yBAAyB,GAAG,GAAG;AAC7B,MAAI,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACvB,WAAS,KAAK;AAAG,MAAE,KAAK,EAAE;AAC1B,SAAO;AACT;AAEA,uBAAuB,QAAQ,QAAQ;AACrC,MAAI,IAAI,MAAM,CAAC,EAAE,KAAK,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,GAAG;AAAK,MAAE,KAAM,QAAO,GAAG,KAAK,OAAO,GAAG,MAAM;AACnE,SAAO,CAAC,QAAQ,OAAO,IAAI,OAAO,EAAE,GAAG,CAAC;AAC1C;AAEA,IAAI,UAAU;AAAA,EACZ,uBAAuB,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE;AAAA,EACpC,gBAAgB,EAAE,GAAG,EAAE,GAAG,CAAC;AAC7B;AACA,IAAI,SAAS;AAAA,EACX,uBAAuB,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE;AAAA,EACpC,gBAAgB,EAAE,GAAG,EAAE,GAAG,CAAC;AAC7B;AACA,IAAI,UAAU;AAAA,EACZ,uBAAuB,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE;AAAA,EACpC,gBAAgB,EAAE,GAAG,EAAE,GAAG,CAAC;AAC7B;AACA,IAAI,SAAS;AAAA,EACX,uBAAuB,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE;AAAA,EACpC,gBAAgB,EAAE,GAAG,EAAE,GAAG,CAAC;AAC7B;AACA,IAAI,SAAS;AAAA,EACX,uBAAuB,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE;AAAA,EACpC,gBAAgB,EAAE,GAAG,EAAE,GAAG,CAAC;AAC7B;AACA,IAAI,SAAS;AAAA,EACX,uBAAuB,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE;AAAA,EACrC,gBAAgB,EAAE,GAAG,EAAE,GAAG,CAAC;AAC7B;AACA,IAAI,SAAS;AAAA,EACX,uBAAuB,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE;AAAA,EACtC,gBAAgB,EAAE,GAAG,EAAE,GAAG,CAAC;AAC7B;AACA,IAAI,SAAS;AAAA,EACX,uBAAuB,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE;AAAA,EACrC,gBAAgB,EAAE,GAAG,EAAE,GAAG,CAAC;AAC7B;AAEA,IAAI,SAAS,CAAC,qBAAqB,GAAG,EAAE,GAAG,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;AAE3D,IAAI,QAAQ,CAAC,SAAS,QAAQ,SAAS,QAAQ,QAAQ,QAAQ,QAAQ,MAAM;AAC7E,IAAI,aAAa,CAAC,MAAM,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,GAAG;AAC1D,IAAI,SAAS,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AASpC,iCAAiC,eAAe;AAC9C,MAAI,WAAW,CAAC,KAAK,IAAI,GAAG;AAC5B,MAAI,IAAI,cAAc,IAAI,CAAC,CAAC,GAAG,OAAO,WAAW,KAAK,SAAS,EAAE;AACjE,SAAO,EAAE,KAAK,GAAG;AACnB;AAMA,+BAA+B,kBAAiB;AAC9C,MAAI,IAAI,yBACN,KAAK,MAAM,iBAAgB,UAAU,EAAE,CAAC,IAAI,CAAC,GAC7C,EACF;AACA,MAAI,IAAI,MAAM,CAAC;AACf,WAAS,IAAI,GAAG,IAAI,GAAG;AAAK,MAAE,KAAK,iBAAgB,CAAC;AACpD,SAAO,CAAC,GAAG,CAAC;AACd;AAEA,wCAAwC,kBAAiB;AACvD,SAAO,MAAM,sBAAsB,gBAAe,CAAC;AACrD;AAMA,eAAe,OAAO;AACpB,MAAI,iBAAiB,aAAa,KAAK;AACvC,MAAI,iBAAiB;AAAA,IACnB,4BAA4B;AAAA,IAC5B,gCAAgC;AAAA,EAClC;AACA,MAAI,iBAAiB;AAAA,IACnB,4BAA4B;AAAA,IAC5B,gCAAgC;AAAA,EAClC;AACA,MAAI,iBAAiB;AAAA,IACnB,4BAA4B;AAAA,IAC5B,8BAA8B;AAAA,EAChC;AACA,MAAI,iBAAiB;AAAA,IACnB,4BAA4B;AAAA,IAC5B,8BAA8B;AAAA,EAChC;AAEA,MAAI,YAAY,cAAc,gBAAgB,gBAAgB,cAAc;AAC5E,MAAI,OAAO;AACX,MAAI,sBAAsB,oBAAI,IAAI;AAClC,MAAI,aAAa,CAAC,IAAI,KAAK;AAC3B,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,QAAI,EAAE,OAAO,MAAM,SAAS,UAAU,KAAK;AAC3C,QAAI,YAAY;AAChB,aAAS,CAAC,GAAG,MAAM,MAAM;AACvB,eAAS,KAAI,GAAG,KAAI,GAAG;AACrB,oBAAY,cAAc,WAAW,MAAM,EAAE;AAAA,IACjD;AACA,QAAI,oBAAoB,IAAI,UAAU,SAAS,CAAC,GAAG;AAEjD;AAAA,IACF;AAAO,0BAAoB,IAAI,UAAU,SAAS,CAAC;AACnD,QAAI,WAAW,yBAAyB,UAAU,GAAG,MAAM,GAAG,CAAC,CAAC;AAChE,QAAI,aAAa;AACjB,aAAS,KAAI,GAAG,KAAI,GAAG;AAAK,oBAAc,UAAU,GAAG,MAAK,KAAK;AACjE,QAAI,iBAAiB,CAAC,UAAU,UAAU;AAE1C,QAAI,aAAa,OAAO,KAAK,SAAS,KAAK,SAAS,IAAI;AACxD,QAAI,OAAO,UACT,gBACA,gBACA,gBACA,UACF;AACA,QAAI,SAAS,QAAW;AAEtB;AAAA,IACF;AAMA,QAAI,SAAS,UAAa,KAAK,SAAS,KAAK,SAAS,KAAK,QAAQ;AACjE,aAAO,KAAK,OAAO,IAAI;AAAA,IACzB;AAEA,QAAI,IAAI,KAAK,IAAI,aAAa;AAAK;AAAA,EACrC;AACA,SAAO;AACT;AAEA,sBAAsB,OAAO;AAC3B,MAAI,WAAW;AACf,WAAS,IAAI,GAAG,IAAI,GAAG;AAAK,gBAAY,MAAM,GAAG,QAAQ,IAAI,CAAC,IAAI,MAAM;AACxE,MAAI,aAAa;AACjB,WAAS,IAAI,GAAG,IAAI,GAAG;AAAK,kBAAc,MAAM,GAAG,IAAI,KAAK,KAAK;AACjE,MAAI,WAAW,MAAM,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,IAAI,IAAI,CAAC,CAAC;AACtD,MAAI,eACF,cAAc,SAAS,IAAI,CAAC,MAAM,CAAE,MAAK,EAAE,CAAC,IAAI,IAChD,mBAAmB,SAAS,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;AACnD,SAAO,CAAC,UAAU,aAAa,KAAK,YAAY;AAClD;AAEA,IAAI,SAAS,CAAC;AAEd,yCAAyC;AACvC,MAAI,OAAO;AAAU,WAAO,OAAO;AACnC,MAAI,SAAS,CAAC;AACd,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,WAAO,KAAK,MAAM,CAAC;AACnB,QAAI,IAAI;AAAA,MACN,IAAI;AAAA,MACJ,KAAK,MAAM,IAAI,CAAC,IAAI;AAAA,MACpB,KAAK,MAAM,IAAI,CAAC,IAAI;AAAA,MACpB,KAAK,MAAM,IAAI,EAAE;AAAA,IACnB;AACA,WAAO,GAAG,KAAK,OAAO,GAAG,KAAK,OAAO,GAAG,KAAK,OAAO,GAAG,KAAK;AAC5D,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAE,KAAM,GAAE,KAAK,KAAK;AACpB,aAAO,GAAG,IAAI,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI,EAAE,KAAK,IAAI,EAAE,KAAK;AACvD,QAAE,KAAM,GAAE,KAAK,KAAK;AAAA,IACtB;AAAA,EACF;AACA,SAAQ,OAAO,WAAW;AAC5B;AAEA,yCAAyC;AACvC,MAAI,OAAO;AAAU,WAAO,OAAO;AACnC,MAAI,SAAS,MAAM,EAAE;AACrB,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,QAAI,IAAI;AAAA,MACN,IAAI;AAAA,MACJ,KAAK,MAAM,IAAI,CAAC,IAAI;AAAA,MACpB,KAAK,MAAM,IAAI,CAAC,IAAI;AAAA,MACpB,KAAK,MAAM,IAAI,EAAE;AAAA,IACnB;AACA,WAAO,KAAM,GAAE,OAAO,KAAM,GAAE,OAAO,KAAM,GAAE,OAAO,KAAM,GAAE,OAAO;AAAA,EACrE;AACA,SAAQ,OAAO,WAAW;AAC5B;AAEA,uCAAuC;AACrC,MAAI,OAAO;AAAU,WAAO,OAAO;AACnC,MAAI,gBAAgB,CAAC;AACrB,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,kBAAc,KAAK,CAAC;AACpB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,oBAAc,GAAG,KAAK,MAAM,GAAG,GAAG,QAAQ,CAAC;AAAA,IAC7C;AAAA,EACF;AACA,MAAI,SAAS,MAAM,MAAM,CAAC;AAC1B,WAAS,IAAI,GAAG,IAAI,MAAM,GAAG,KAAK;AAChC,WAAO,KAAK,MAAM,CAAC;AACnB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,IAAI;AACR,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAK,cAAc,KAAK,MAAM,IAAI,MAAM,CAAC,IAAI,IAAI,KAAK,MAAM;AAAA,MAC9D;AACA,aAAO,GAAG,KAAK;AAAA,IACjB;AAAA,EACF;AACA,SAAQ,OAAO,WAAW;AAC5B;AAEA,uCAAuC;AACrC,MAAI,OAAO;AAAU,WAAO,OAAO;AACnC,SAAQ,OAAO,WAAW,IAAI,4BAA4B,GAAG;AAAA,IAC3D,IAAI,KAAM,KAAI,KAAM,MAAK,KAAK;AAAA,EAChC,CAAC;AACH;AAEA,2CAA2C;AACzC,MAAI,OAAO;AAAU,WAAO,OAAO;AACnC,QAAM,QAAQ,EAAE,IAAI,CAAC;AACrB,MAAI,WAAW,CAAC;AAChB,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,aAAS,KAAK,CAAC;AACf,QAAI,OAAO,cAAc,GAAG,GAAG,EAAE,GAC/B,OAAO,CAAC;AACV,aAAS,IAAI,GAAG,IAAI,GAAG,IAAI,IAAI,KAAK;AAClC,UAAI,KAAK,OAAO;AAAG,aAAK,KAAK;AAAA;AACxB,aAAK,KAAK;AAAA,IACjB;AACA,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,WAAW,QAAQ,MAAM,MAAM,GAAG,EAAE;AACxC,UAAI,WAAW,QAAQ,MAAM,MAAM,GAAG,EAAE;AACxC,UAAI,SAAS,mBAAmB,SAAS,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;AAC9D,eAAS,GAAG,KAAK,cAAc,QAAQ,IAAI,IAAI;AAAA,IACjD;AAAA,EACF;AACA,MAAI,YAAY,8BAA8B;AAC9C,MAAI,SAAS,CAAC;AACd,WAAS,IAAI,GAAG,IAAI,OAAO,KAAK;AAC9B,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,UAAI,KAAM,OAAO,IAAI,KAAM,KAAI,MAAM,CAAC;AACtC,UAAI,KAAM,OAAO,IAAI,KAAM,KAAI,IAAI,MAAM,CAAC;AAC1C,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,WAAG,KAAK,UAAU,GAAG,KAAK,KAAK,SAAS,GAAG;AAC3C,WAAG,KAAK,UAAU,GAAG,KAAK,KAAM,UAAS,GAAG,KAAK;AAAA,MACnD;AAAA,IACF;AAAA,EACF;AACA,SAAQ,OAAO,WAAW;AAC5B;AAEA,2CAA2C;AACzC,MAAI,OAAO;AAAU,WAAO,OAAO;AACnC,SAAQ,OAAO,WAAW,IAAI,gCAAgC,GAAG,CAAC,CAAC,CAAC;AACtE;AAEA,yCAAyC;AACvC,MAAI,OAAO;AAAU,WAAO,OAAO;AACnC,MAAI,gBAAgB,8BAA8B;AAClD,MAAI,SAAS,MAAM,EAAE;AACrB,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,WAAO,KAAK,cAAc,GAAG,MAAM,GAAG,CAAC;AAAA,EACzC;AACA,SAAQ,OAAO,WAAW;AAC5B;AAEA,uCAAuC;AACrC,MAAI,OAAO;AAAU,WAAO,OAAO;AACnC,QAAM,IAAI;AACV,QAAM,YAAY,UAAU,CAAC,IAAI;AACjC,MAAI,SAAS,MAAM,SAAS;AAC5B,MAAI,OAAO,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAClC,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAElC,WAAO,KAAK,MAAM,CAAC;AACnB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,WAAW,QAAQ,MAAM,MAAM,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC;AACpD,aAAO,GAAG,KAAK,yBAAyB,QAAQ;AAAA,IAClD;AAEA,QAAI,MAAM,YAAY;AAAG;AAEzB,QAAI,SAAS;AACb,OAAG;AACD,eAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,YAAI,KAAK,KAAK,KAAK,IAAI;AAAI;AAC3B,YAAI,IAAI,IAAI;AACZ,iBAAS,IAAI,GAAG,IAAI,GAAG;AAAK,cAAI,KAAK,KAAK,KAAK;AAAI,gBAAI;AACvD,SAAC,KAAK,IAAI,KAAK,EAAE,IAAI,CAAC,KAAK,IAAI,KAAK,EAAE;AACtC,kBAAU;AACV,iBAAS,IAAI,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,KAAK,UAAU,GAAG;AACvD,WAAC,KAAK,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI;AAAA,YACnC,KAAK,IAAI,IAAI;AAAA,YACb,KAAK,IAAI,IAAI;AAAA,UACf;AAAA,QACF;AACA;AAAA,MACF;AAAA,IACF,SAAS,WAAW;AAAA,EACtB;AACA,SAAQ,OAAO,WAAW;AAC5B;AAEA,uCAAuC;AACrC,MAAI,OAAO;AAAU,WAAO,OAAO;AACnC,SAAQ,OAAO,WAAW,IAAI,4BAA4B,GAAG,CAAC,CAAC,CAAC;AAClE;AAEA,aAAa,QAAQ,aAAa;AAChC,MAAI,IAAI,OAAO;AACf,MAAI,SAAS,OAAO,GAAG;AACvB,MAAI,SAAS,MAAM,CAAC,EAAE,KAAK,EAAE;AAC7B,MAAI,QAAQ,YAAY,MAAM,GAC5B,YAAY,CAAC;AACf,MAAI,QAAQ;AACZ,SAAO,MAAM,SAAS,GAAG;AACvB,cAAU,SAAS;AACnB,aAAS,SAAS,OAAO;AACvB,UAAI,OAAO,WAAW;AAAI;AAC1B,aAAO,SAAS;AAChB,eAAS,aAAa,GAAG,aAAa,QAAQ,cAAc;AAC1D,YAAI,YAAY,OAAO,OAAO;AAC9B,eAAO,aAAa,OAAO;AACzB,oBAAU,KAAK,SAAS;AACxB,sBAAY,OAAO,WAAW;AAAA,QAChC;AAAA,MACF;AAAA,IACF;AACA,KAAC,OAAO,SAAS,IAAI,CAAC,WAAW,KAAK;AACtC,aAAS;AAAA,EACX;AACA,SAAO;AACT;AAEA,mBAAmB,SAAS,SAAS,SAAS,WAAW;AACvD,cAAY,aAAa;AACzB,MAAI,UAAU,QAAQ;AACtB,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,SAAS;AAC3B,YAAQ,KAAK,IAAI,OAAO,QAAQ,GAAG,QAAQ,GAAG;AAChD,SAAO,SAAS,WAAW;AACzB,QAAI,OAAO,WAAW,SAAS,SAAS,SAAS,OAAO,EAAE;AAC1D,QAAI,SAAS;AAAW,aAAO;AAC/B;AAAA,EACF;AACF;AAEA,oBAAoB,SAAS,SAAS,SAAS,OAAO,MAAM;AAC1D,MAAI,UAAU,QAAQ;AACtB,MAAI,SAAS,QAAQ,GAAG,GAAG;AAC3B,MAAI,YAAY;AAChB,WAAS,IAAI,GAAG,IAAI,SAAS;AAC3B,gBAAY,KAAK,IAAI,WAAW,QAAQ,GAAG,QAAQ,GAAG;AACxD,MAAI,YAAY;AAAO;AACvB,MAAI,UAAU;AAAG,WAAO,CAAC;AACzB,MAAI,cAAc,KAAK,UAAU;AAAG;AACpC,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,MAAM;AAAM;AAChB,QAAI,IAAI,QAAQ,OAAO,MAAM,OAAO;AAAO;AAC3C,QAAI,cAAc,QAAQ,MAAM;AAChC,aAAS,IAAI,GAAG,IAAI,SAAS;AAC3B,kBAAY,KAAK,QAAQ,GAAG,QAAQ,IAAI;AAC1C,QAAI,IAAI;AACR,WAAO,QAAQ,KAAK,CAAC,GAAG,MAAM,QAAQ,MAAM,YAAY,EAAE,GAAG;AAC3D,UAAI,UAAU,WAAW,aAAa,SAAS,SAAS,QAAQ,GAAG,CAAC;AACpE,UAAI,YAAY;AAAW,eAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,OAAO;AACzD,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,oBAAY,KAAK,QAAQ,GAAG,YAAY,IAAI;AAAA,MAC9C;AACA;AAAA,IACF;AAAA,EACF;AACA;AACF;AAEA,wBAAwB,SAAS,SAAS,SAAS;AACjD,MAAI,UAAU,QAAQ;AACtB,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,SAAS;AAC3B,YAAQ,KAAK,IAAI,OAAO,QAAQ,GAAG,QAAQ,GAAG;AAChD,SAAO,MAAM;AACX,WAAO,eAAe,SAAS,SAAS,SAAS,OAAO,EAAE;AAC1D;AAAA,EACF;AACF;AAEA,yBAAyB,SAAS,SAAS,SAAS,OAAO,MAAM;AAC/D,MAAI,UAAU,QAAQ;AACtB,MAAI,SAAS,QAAQ,GAAG,GAAG;AAC3B,MAAI,YAAY;AAChB,WAAS,IAAI,GAAG,IAAI,SAAS;AAC3B,gBAAY,KAAK,IAAI,WAAW,QAAQ,GAAG,QAAQ,GAAG;AACxD,MAAI,YAAY;AAAO;AACvB,MAAI,UAAU,GAAG;AACf,UAAM,CAAC;AACP;AAAA,EACF;AACA,MAAI,cAAc,KAAK,UAAU;AAAG;AACpC,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,MAAM;AAAM;AAChB,QAAI,IAAI,QAAQ,OAAO,MAAM,OAAO;AAAO;AAC3C,QAAI,cAAc,QAAQ,MAAM;AAChC,aAAS,IAAI,GAAG,IAAI,SAAS;AAC3B,kBAAY,KAAK,QAAQ,GAAG,QAAQ,IAAI;AAC1C,QAAI,IAAI;AACR,WAAO,QAAQ,KAAK,CAAC,GAAG,MAAM,QAAQ,MAAM,YAAY,EAAE,GAAG;AAC3D,UAAI,cAAc,eAChB,aACA,SACA,SACA,QAAQ,GACR,CACF;AACA,aAAO,MAAM;AACX,YAAI,EAAE,OAAO,SAAS,SAAS,YAAY,KAAK;AAChD,YAAI;AAAM;AACV,cAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,OAAO;AAAA,MAC/B;AACA,eAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,oBAAY,KAAK,QAAQ,GAAG,YAAY,IAAI;AAAA,MAC9C;AACA;AAAA,IACF;AAAA,EACF;AACF;AAEA,IAAM,kBAAkB,uBAAuB;AAC/C,2CAAkD;AAChD,SAAO,IAAI,IACT,wBACE,+BAA+B,MAAM,eAAe,CACtD,CACF;AACF;",
-  "names": []
-}

package/dist/esm/redi_cube.kpuzzle.json-VGO74GBL.js

@@ -1,66 +0,0 @@
-import "./chunk-MGJA5U5O.js";
-
-// src/cubing/puzzles/implementations/redi-cube/redi_cube.kpuzzle.json.ts
-var rediCubeKPuzzleDefinition = {
-  name: "redi_cube",
-  orbits: {
-    EDGES: { numPieces: 12, numOrientations: 2 },
-    CORNERS: { numPieces: 8, numOrientations: 3 }
-  },
-  startStateData: {
-    EDGES: {
-      pieces: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11],
-      orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
-    },
-    CORNERS: {
-      pieces: [0, 1, 2, 3, 4, 5, 6, 7],
-      orientation: [0, 0, 0, 0, 0, 0, 0, 0]
-    }
-  },
-  moves: {
-    F: {
-      EDGES: {
-        permutation: [8, 0, 2, 3, 4, 5, 6, 7, 1, 9, 10, 11],
-        orientation: [0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
-      },
-      CORNERS: {
-        permutation: [0, 1, 2, 3, 4, 5, 6, 7],
-        orientation: [1, 0, 0, 0, 0, 0, 0, 0]
-      }
-    },
-    x: {
-      EDGES: {
-        permutation: [4, 8, 0, 9, 6, 10, 2, 11, 5, 7, 1, 3],
-        orientation: [1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0]
-      },
-      CORNERS: {
-        permutation: [4, 0, 3, 5, 7, 6, 2, 1],
-        orientation: [2, 1, 2, 1, 1, 2, 1, 2]
-      }
-    },
-    y: {
-      EDGES: {
-        permutation: [1, 2, 3, 0, 5, 6, 7, 4, 10, 8, 11, 9],
-        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1]
-      },
-      CORNERS: {
-        permutation: [1, 2, 3, 0, 7, 4, 5, 6],
-        orientation: [0, 0, 0, 0, 0, 0, 0, 0]
-      }
-    }
-  },
-  experimentalDerivedMoves: {
-    z: "[x: y]",
-    UR: "[y: F]",
-    U: "[y2: F]",
-    UL: "[y': F]",
-    D: "[x: F]",
-    L: "[z2: F]",
-    R: "[x2: F]",
-    B: "[y2 x: F]"
-  }
-};
-export {
-  rediCubeKPuzzleDefinition
-};
-//# sourceMappingURL=redi_cube.kpuzzle.json-VGO74GBL.js.map