()
| 150 | } |
| 151 | |
| 152 | private static void calcperm() { |
| 153 | //calculate solving arrays |
| 154 | //first permutation |
| 155 | for (int p = 0; p < 5040; p++) { |
| 156 | perm[p] = -1; |
| 157 | for (int m = 0; m < 3; m++) |
| 158 | permmv[p][m] = (short) getprmmv(p, m); |
| 159 | } |
| 160 | perm[0] = 0; |
| 161 | Utils.createPrun(perm, 7, permmv, 3); |
| 162 | |
| 163 | //then twist |
| 164 | for (int p = 0; p < 729; p++) { |
| 165 | twst[p] = -1; |
| 166 | for (int m = 0; m < 3; m++) |
| 167 | twstmv[p][m] = (short) gettwsmv(p, m); |
| 168 | } |
| 169 | twst[0] = 0; |
| 170 | Utils.createPrun(twst, 6, twstmv, 3); |
| 171 | } |
| 172 | |
| 173 | private static boolean search(int p, int t, int l, int lm, int[] seq) { |
| 174 | //searches for solution, from position p|t, in l moves exactly. last move was lm, current depth=d |
no test coverage detected