Method solve

app/src/main/java/solver/Cube222.java:206–222

(int p, int o)

    }

    private static String solve(int p, int o) {
        int[] seq = new int[12];
        for (int l = 0; l < 12; l++) {
            if (search(p, o, l, -1, seq))  {
                if (l < 2) return "error";
                if (l < 5) {
                    //sol = new StringBuilder();
                    continue;
                }
                StringBuilder sol = new StringBuilder();
                for (int i = 1; i <= l; i++)
                    sol.append(turn[seq[i] / 3]).append(suffInv[seq[i] % 3]).append(" ");
                return sol.toString();
            }
        }
        return "error";
    }

    private static boolean checkNobar(int[] perm, int[] ori) {
        char[] ts = {1, 2, 4, 8, 16, 32};