1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
#include <stdio.h>
#include "cube.h"
int main() {
Alg *algo;
AlgList *sols;
Cube cube;
SolveOptions opts;
char line[1000];
int i, ns = 2, nrand = 100000, sum1, sum2;
Step *stps[20] = {&drud_HTM, &optimal_HTM};
char sss[30][30] = {"DR on U/D", "Optimal solution"};
opts = (SolveOptions) {
.min_moves = 0,
.max_moves = 20,
.optimal_only = true,
.max_solutions = 1,
.can_niss = false,
.feedback = true
};
init();
/*
print_ptable(&pd_drud_HTM);
print_ptable(&pd_ep_HTM);
print_ptable(&pd_corners_HTM);
*/
srand(time(NULL));
sum1 = 0;
sum2 = 0;
for (i = 0; i < nrand; i++) {
sum1 += optimal_HTM.check(random_cube());
sum2 += corners_HTM.check(random_cube());
}
printf("Average optimal pruning: %lf\n", ((double)sum1) / ((double) nrand));
printf("Average corners pruning: %lf\n", ((double)sum2) / ((double) nrand));
printf("Welcome to nissy 2.0! Insert a scramble:\n");
if (fgets(line, 1000, stdin) != NULL) {
algo = new_alg(line);
cube = apply_alg(algo, (Cube){0});
for (i = 0; i < ns; i++) {
if (stps[i]->check == NULL)
fprintf(stderr, "Check function for step %d is null\n", i);
sols = solve(cube, *stps[i], &opts);
printf("%s: %d solutions found:\n", sss[i], sols->len);
print_alglist(sols, true);
free_alglist(sols);
}
free(algo);
}
return 0;
}
|
