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 eb20084ec94e9043e55a98717128a4ba1e6215cb
parent 470c10c18da2b589e4ba2fe23135ab6ded5f4509
Author: Sebastiano Tronto <sebastiano@tronto.net>
Date:   Fri, 30 Aug 2024 16:39:38 +0200

Added log message for table generation

Diffstat:
Msrc/solvers/h48/gendata_h48.h | 6++++--
1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/src/solvers/h48/gendata_h48.h b/src/solvers/h48/gendata_h48.h @@ -304,7 +304,7 @@ gendata_h48k2(gendata_h48_arg_t *arg) uint8_t t; int64_t j; - uint64_t nshort, i; + uint64_t nshort, i, ii; h48map_t shortcubes; kvpair_t kv; gendata_h48short_arg_t shortarg; @@ -339,13 +339,15 @@ gendata_h48k2(gendata_h48_arg_t *arg) .shortcubes = &shortcubes }; - i = 0; + i = ii = 0; for (kv = h48map_nextkvpair(&shortcubes, &i); i != shortcubes.capacity; kv = h48map_nextkvpair(&shortcubes, &i) ) { dfsarg.cube = invcoord_h48(kv.key, arg->crep, 11); gendata_h48k2_dfs(&dfsarg); + if (++i % UINT64_C(1000000) == 0) + LOG("Processed %" PRIu64 " short cubes\n", ii); } h48map_destroy(&shortcubes);