(int ep, int eo, int d, int lm)
| 169 | } |
| 170 | |
| 171 | private static boolean idacross(int ep, int eo, int d, int lm) { |
| 172 | if (d == 0) return ep == 1656 && eo == 1104; |
| 173 | if (epd[ep] > d || eod[eo] > d) return false; |
| 174 | for (int i = 0; i < 6; i++) |
| 175 | if (i != lm) { |
| 176 | int epx = ep, eox = eo; |
| 177 | for (int j = 0; j < 3; j++) { |
| 178 | epx = epm[epx][i]; eox = eom[eox][i]; |
| 179 | if (idacross(epx, eox, d - 1, i)) { |
| 180 | seq[d] = i * 3 + j; |
| 181 | //sb.insert(0, " " + turn[face][i] + suff[j]); |
| 182 | return true; |
| 183 | } |
| 184 | } |
| 185 | } |
| 186 | return false; |
| 187 | } |
| 188 | |
| 189 | private static void idacross(int ep, int eo, int d, int lm, int face, int[] path) { |
| 190 | if (d == 0) { |
no test coverage detected