| 357 | } |
| 358 | |
| 359 | boolean search2(int ct, int rl, int maxl, int lm, int depth) { |
| 360 | if (ct==0 && ctprun[rl] == 0) { |
| 361 | return maxl == 0 && init3(); |
| 362 | } |
| 363 | for (int m=0; m<23; m++) { |
| 364 | if (ckmv2[lm][m]) { |
| 365 | m = skipAxis2[m]; |
| 366 | continue; |
| 367 | } |
| 368 | int ctx = ctmv[ct][m]; |
| 369 | int rlx = rlmv[rl][m]; |
| 370 | |
| 371 | int prun = ctprun[ctx * 70 + rlx]; |
| 372 | if (prun >= maxl) { |
| 373 | if (prun > maxl) { |
| 374 | m = skipAxis2[m]; |
| 375 | } |
| 376 | continue; |
| 377 | } |
| 378 | |
| 379 | move2[depth] = move2std[m]; |
| 380 | if (search2(ctx, rlx, maxl-1, m, depth+1)) { |
| 381 | return true; |
| 382 | } |
| 383 | } |
| 384 | return false; |
| 385 | } |
| 386 | |
| 387 | boolean init3() { |
| 388 | c2.copy(c1); |