()
| 141 | } |
| 142 | |
| 143 | private static void calcperm() { |
| 144 | int c, q, l, m, p, r; |
| 145 | //calculate solving arrays |
| 146 | //first permutation |
| 147 | //initialise arrays |
| 148 | for (p = 0; p < 360; p++) { |
| 149 | perm[p] = -1; |
| 150 | for (m = 0; m < 4; m++) |
| 151 | permmv[p][m] = (short) getprmmv(p, m); |
| 152 | } |
| 153 | //fill it |
| 154 | perm[0] = 0; |
| 155 | Utils.createPrun(perm, 5, permmv, 2); |
| 156 | |
| 157 | //then twist && flip |
| 158 | //initialise arrays |
| 159 | for (p = 0; p < 81; p++) |
| 160 | for (m = 0; m < 4; m++) { |
| 161 | twstmv[p][m] = (short) gettwsmv(p, m); |
| 162 | if (p < 32) flipmv[p][m] = (short) getflpmv(p, m); |
| 163 | } |
| 164 | //fill it |
| 165 | for (p = 0; p < 2592; p++) twst[p] = -1; |
| 166 | twst[0] = 0; |
| 167 | Utils.createPrun(twst, 7, twstmv, flipmv, 2); |
| 168 | } |
| 169 | |
| 170 | private static int getprmmv(int p, int m) { |
| 171 | //given position p<360 and move m<4, return new position number |
no test coverage detected