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

gendata_cocsep_tests.c (500B)

      1 #include "../test.h"
      2 
      3 #define COCSEP_CLASSES 3393
      4 
      5 size_t gendata_cocsep(void *, uint64_t *, cube_t *);
      6 
      7 void run(void) {
      8 	uint32_t buf[300000], i;
      9 	uint64_t selfsim[COCSEP_CLASSES];
     10 	cube_t rep[COCSEP_CLASSES];
     11 	size_t result;
     12 
     13 	result = gendata_cocsep(buf, selfsim, rep);
     14 
     15 	printf("%zu\n", result);
     16 	printf("Classes: %" PRIu32 "\n", buf[result/4-12]);
     17 	printf("Max value: %" PRIu32 "\n", buf[result/4-11]);
     18 	for (i = 0; i < 10; i++)
     19 		printf("%" PRIu32 ": %" PRIu32 "\n", i, buf[result/4-10+i]);
     20 }