h48

A prototype for an optimal Rubik's cube solver, work in progress.
git clone https://git.tronto.net/h48
Download | Log | Files | Refs | README | LICENSE

commit ce987d566b8322d0e341a2c9baf0608d1609943b
parent 7e999327af767a9f668ae51f1a102598a2ee12c0
Author: Sebastiano Tronto <sebastiano@tronto.net>
Date:   Sun, 15 Dec 2024 11:06:09 +0100

Actually fix the bug

Diffstat:
Msrc/solvers/h48/solve.h | 8+++++---
1 file changed, 5 insertions(+), 3 deletions(-)

diff --git a/src/solvers/h48/solve.h b/src/solvers/h48/solve.h @@ -117,12 +117,14 @@ solve_h48_appendallsym(dfsarg_solve_h48_t *arg) for (i = 0; i < n; i++) if (all[k][i] != all[j][i]) eq = false; + /* If a solution was already found, we skip it */ - if (eq) - continue; + if (eq) { + j--; + break; + } } - /* If all is good, the solution is accepted */ j++; }