Method initSearch

app/src/main/java/cs/min2phase/Search.java:192–230

()

    }

    private void initSearch() {
        conjMask = (TRY_INVERSE ? 0 : 0x38) | (TRY_THREE_AXES ? 0 : 0x36);
        CubieCube pc = new CubieCube();

        for (int i = 0; i < 6; i++) {

            for (int j = 0; j < PRE_IDX_MAX; j++) {
                CubieCube.CornMult(CubieCube.preList[j], cc, pc);
                CubieCube.EdgeMult(CubieCube.preList[j], cc, pc);
                twist[i][j] = pc.getTwistSym();
                flip[i][j] = pc.getFlipSym();
                slice[i][j] = pc.getUDSlice();
                corn0[i][j] = pc.getCPermSym();
                ud8e0[i][j] = pc.getU4Comb() << 16 | pc.getD4Comb();
                prun[i][j] = -1;
            }

            cc.URFConjugate();
            if (i % 3 == 2) {
                cc.invCubieCube();
            }
        }

        for (int i = 0; i < 6; i++) {
            for (int j = 0; j < i; j++) { //If S_i^-1 * C * S_i == C, It's unnecessary to compute it again.
                if (twist[i][0] == twist[j][0] && flip[i][0] == flip[j][0] && slice[i][0] == slice[j][0]
                        && corn0[i][0] == corn0[j][0] && ud8e0[i][0] == ud8e0[j][0]) {
                    conjMask |= 1 << i;
                    break;
                }
            }
            if ((conjMask & (1 << i)) != 0) {
                continue;
            }
            for (int j = 0; j < PRE_IDX_MAX; j++) {
                fillprun(i, j);
            }
        }
    }

    public synchronized String next(long probeMax, long probeMin, int verbose) {
        this.probe = 0;