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 e0f9f9929d80d2c21ae1996b437d9209d498956b
parent a846f79462cc9f42ba416b28ad538d2b46542486
Author: Sebastiano Tronto <sebastiano@tronto.net>
Date:   Wed, 18 Sep 2024 07:44:01 +0200

Small improvement

Diffstat:
Msrc/solvers/h48/gendata_h48.h | 2+-
1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/solvers/h48/gendata_h48.h b/src/solvers/h48/gendata_h48.h @@ -448,7 +448,6 @@ gendata_h48k2_runthread(void *arg) pthread_mutex_unlock(dfsarg->shortcubes_mutex); break; } - dfsarg->cube = invcoord_h48(kv.key, dfsarg->crep, 11); (*dfsarg->count)++; if (*dfsarg->count % UINT64_C(1000000) == 0) LOG("Processing %" PRIu64 "th short cube\n", @@ -456,6 +455,7 @@ gendata_h48k2_runthread(void *arg) pthread_mutex_unlock(dfsarg->shortcubes_mutex); + dfsarg->cube = invcoord_h48(kv.key, dfsarg->crep, 11); gendata_h48k2_dfs(dfsarg); }