private void DoSearch() { Init(); solution = ""; int ud = new Center1(cubeToSolve.GetCenter(), 0).Getsym(); int fb = new Center1(cubeToSolve.GetCenter(), 1).Getsym(); int rl = new Center1(cubeToSolve.GetCenter(), 2).Getsym(); int udprun = Center1.Csprun[ud >> 6]; int fbprun = Center1.Csprun[fb >> 6]; int rlprun = Center1.Csprun[rl >> 6]; p1SolsCnt = 0; arr2idx = 0; p1sols.Clear(); for (length1 = Math.Min(Math.Min(udprun, fbprun), rlprun); length1 < 100; length1++) { if (rlprun <= length1 && Search1((int)((uint)rl >> 6), rl & 0x3f, length1, -1, 0) || udprun <= length1 && Search1((int)((uint)ud >> 6), ud & 0x3f, length1, -1, 0) || fbprun <= length1 && Search1((int)((uint)fb >> 6), fb & 0x3f, length1, -1, 0)) { break; } } //FullCube[] p1SolsArr = p1sols.ToArray(new FullCube[0]); FullCube[] p1SolsArr = new FullCube[p1sols.Count]; p1sols.CopyTo(p1SolsArr, 0); Array.Sort(p1SolsArr, 0, p1SolsArr.Length); int MAX_LENGTH2 = 9; int length12; do { for (length12 = p1SolsArr[0].Value; length12 < 100; length12++) { for (int i = 0; i < p1SolsArr.Length; i++) { if (p1SolsArr[i].Value > length12) { break; } if (length12 - p1SolsArr[i].Length1 > MAX_LENGTH2) { continue; } c1.Copy(p1SolsArr[i]); ct2.Set(c1.GetCenter(), c1.GetEdge().GetParity()); int s2ct = ct2.Getct(); int s2rl = ct2.Getrl(); length1 = p1SolsArr[i].Length1; length2 = length12 - p1SolsArr[i].Length1; if (Search2(s2ct, s2rl, length2, 28, 0)) { goto OUT; } } } OUT: MAX_LENGTH2++; } while (length12 == 100); Array.Sort(arr2, 0, arr2idx); int length123, index = 0; int solcnt = 0; int MAX_LENGTH3 = 13; do { for (length123 = arr2[0].Value; length123 < 100; length123++) { for (int i = 0; i < Math.Min(arr2idx, PHASE3_ATTEMPTS); i++) { if (arr2[i].Value > length123) { break; } if (length123 - arr2[i].Length1 - arr2[i].Length2 > MAX_LENGTH3) { continue; } int eparity = e12.Set(arr2[i].GetEdge()); ct3.Set(arr2[i].GetCenter(), eparity ^ arr2[i].GetCorner().GetParity()); int ct = ct3.Getct(); int edge = e12.Get(10); int prun = Edge3.Getprun(e12.Getsym()); int lm = 20; if (prun <= length123 - arr2[i].Length1 - arr2[i].Length2 && Search3(edge, ct, prun, length123 - arr2[i].Length1 - arr2[i].Length2, lm, 0)) { solcnt++; index = i; goto OUT2; } } } OUT2: MAX_LENGTH3++; } while (length123 == 100); FullCube solcube = new FullCube(arr2[index]); length1 = solcube.Length1; length2 = solcube.Length2; int length = length123 - length1 - length2; for (int i = 0; i < length; i++) { solcube.Move(Move3std[move3[i]]); } string facelet = solcube.To333Facelet(); string sol = search333.Solution(facelet, 20, 100, 50, 0); if (sol.StartsWith("Error 8")) { sol = search333.Solution(facelet, 21, 1000000, 30, 0); } int len333 = sol.Length / 3; if (sol.StartsWith("Error")) { throw new Exception(); } int[] sol333 = Util.Tomove(sol); for (int i = 0; i < sol333.Length; i++) { solcube.Move(sol333[i]); } StringBuilder str = new StringBuilder(); str.Append(solcube.GetMoveString(InverseSolution, WithRotation)); solution = str.ToString(); totlen = length1 + length2 + length + len333; }
public static void Init() { Center2 c = new Center2(); for (int i = 0; i < 35 * 2; i++) { for (int m = 0; m < 28; m++) { c.Setrl(i); c.Move(Moves.Move2std[m]); Rlmv[i][m] = c.Getrl(); } } for (int i = 0; i < 70; i++) { c.Setrl(i); for (int j = 0; j < 16; j++) { rlrot[i][j] = c.Getrl(); c.Rot(0); if (j % 2 == 1) { c.Rot(1); } if (j % 8 == 7) { c.Rot(2); } } } for (int i = 0; i < 6435; i++) { c.Setct(i); for (int j = 0; j < 16; j++) { ctrot[i][j] = (char)c.Getct(); c.Rot(0); if (j % 2 == 1) { c.Rot(1); } if (j % 8 == 7) { c.Rot(2); } } } for (int i = 0; i < 6435; i++) { for (int m = 0; m < 28; m++) { c.Setct(i); c.Move(Moves.Move2std[m]); Ctmv[i][m] = (char)c.Getct(); } } ArrayExtension.Fill(Ctprun, (sbyte)-1); Ctprun[0] = Ctprun[18] = Ctprun[28] = Ctprun[46] = Ctprun[54] = Ctprun[56] = 0; int depth = 0; int done = 6; while (done != 6435 * 35 * 2) { for (int i = 0; i < 6435 * 35 * 2; i++) { if (Ctprun[i] != depth) { continue; } int ct = i / 70; int rl = i % 70; for (int m = 0; m < 23; m++) { int ctx = Ctmv[ct][m]; int rlx = Rlmv[rl][m]; int idx = ctx * 70 + rlx; if (Ctprun[idx] == -1) { Ctprun[idx] = (sbyte)(depth + 1); done++; } } } depth++; } }