| 51 | } |
| 52 | |
| 53 | public static void createPrun() { |
| 54 | Arrays.fill(prun, (byte)-1); |
| 55 | prun[0] = 0; |
| 56 | int depth = 0; |
| 57 | int done = 1; |
| 58 | while (done != 29400) { |
| 59 | for (int i = 0; i < 29400; i++) { |
| 60 | if (prun[i] == depth) { |
| 61 | for (int m = 0; m < 17; m++) { |
| 62 | if (prun[ctmove[i][m]] == -1) { |
| 63 | prun[ctmove[i][m]] = (byte) (depth + 1); |
| 64 | done++; |
| 65 | } |
| 66 | } |
| 67 | } |
| 68 | } |
| 69 | depth++; |
| 70 | // System.out.println(String.format("%2d%10d", depth, done)); |
| 71 | } |
| 72 | } |
| 73 | |
| 74 | void set(CenterCube c, int eXc_parity) { |
| 75 | int parity = (c.ct[0] > c.ct[8] ^ c.ct[8] > c.ct[16] ^ c.ct[0] > c.ct[16]) ? 1 : 0; |