| 116 | } |
| 117 | |
| 118 | private static boolean search(int p, int f, int t, int solvedp, int d, int lm) { |
| 119 | if (d == 0) return p == solvedp && f == solvedp * 2 && t == 0; |
| 120 | if (prun[t * 120 + p * 4 + f % 4] > d) return false; |
| 121 | for (int i = 0; i < 4; i++) |
| 122 | if (i != lm) { |
| 123 | int x = p, y = f, z = t; |
| 124 | for (int j = 0; j < 2; j++) { |
| 125 | x = epm[x][i]; |
| 126 | y = eom[y][i]; |
| 127 | z = com[z][i]; |
| 128 | if (search(x, y, z, solvedp, d - 1, i)) { |
| 129 | seq[d] = i * 2 + j; |
| 130 | return true; |
| 131 | } |
| 132 | } |
| 133 | } |
| 134 | return false; |
| 135 | } |
| 136 | |
| 137 | private static int[] solvedEp = {0, 6, 8}; |
| 138 | private static String solve(String scramble, int face) { |