(int ep, int eo, int co, int feo, int slot, int d, int lm)
| 231 | } |
| 232 | |
| 233 | private static boolean idaxcross(int ep, int eo, int co, int feo, int slot, int d, int lm) { |
| 234 | if (d == 0) return ep == 1656 && eo == 1104 && co == (slot + 4) * 3 && feo == slot * 2; |
| 235 | if (epd[ep] > d || eod[eo] > d || fecd[slot][feo * 24 + co] > d) return false; |
| 236 | for (int i = 0; i < 6; i++) |
| 237 | if (i != lm) { |
| 238 | int cox = co, epx = ep, eox = eo, fx = feo; |
| 239 | for (int j = 0; j < 3; j++) { |
| 240 | cox = fcm[cox][i]; fx = fem[fx][i]; |
| 241 | epx = epm[epx][i]; eox = eom[eox][i]; |
| 242 | if (idaxcross(epx, eox, cox, fx, slot, d - 1, i)) { |
| 243 | seq[d] = i * 3 + j; |
| 244 | //sb.insert(0, " " + turn[0][i] + suff[j]); |
| 245 | return true; |
| 246 | } |
| 247 | } |
| 248 | } |
| 249 | return false; |
| 250 | } |
| 251 | |
| 252 | private static void idaxcross(int ep, int eo, int co, int feo, int slot, int d, int lm, int face, int[] path) { |
| 253 | if (d == 0) { |
no test coverage detected