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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
|
/* Typedefs ******************************************************************/
typedef enum center Center;
typedef enum corner Corner;
typedef enum edge Edge;
typedef enum move Move;
typedef enum trans Trans;
typedef struct alg Alg;
typedef struct alglist AlgList;
typedef struct alglistnode AlgListNode;
typedef struct algset AlgSet;
typedef struct block Block;
typedef struct cube Cube;
typedef struct cubearray CubeArray;
typedef struct dfsdata DfsData;
typedef struct piecefilter PieceFilter;
typedef struct prunedata PruneData;
typedef struct solveoptions SolveOptions;
typedef struct step Step;
typedef Cube (*AntiIndexer) (uint64_t);
typedef int (*Checker) (Cube, int);
typedef uint64_t (*Indexer) (Cube);
typedef bool (*Moveset) (Move);
/* Enums *********************************************************************/
enum
center
{
U_center, D_center,
R_center, L_center,
F_center, B_center
};
enum
corner
{
UFR, UFL, UBL, UBR,
DFR, DFL, DBL, DBR
};
enum
edge
{
UF, UL, UB, UR,
DF, DL, DB, DR,
FR, FL, BL, BR
};
enum
move
{
NULLMOVE,
U, U2, U3, D, D2, D3,
R, R2, R3, L, L2, L3,
F, F2, F3, B, B2, B3,
Uw, Uw2, Uw3, Dw, Dw2, Dw3,
Rw, Rw2, Rw3, Lw, Lw2, Lw3,
Fw, Fw2, Fw3, Bw, Bw2, Bw3,
M, M2, M3,
S, S2, S3,
E, E2, E3,
x, x2, x3,
y, y2, y3,
z, z2, z3,
};
enum
trans
{
uf, ur, ub, ul,
df, dr, db, dl,
rf, rd, rb, ru,
lf, ld, lb, lu,
fu, fr, fd, fl,
bu, br, bd, bl,
mirror, /* R|L */
};
/* Structs *******************************************************************/
struct
alg
{
Move * move;
bool * inv;
int len;
int allocated;
};
struct
alglist
{
AlgListNode * first;
AlgListNode * last;
int len;
};
struct
alglistnode
{
Alg * alg;
AlgListNode * next;
};
struct
block
{
bool edge[12];
bool corner[8];
bool center[6];
};
struct
cube
{
uint16_t epose;
uint16_t eposs;
uint16_t eposm;
uint16_t eofb;
uint16_t eorl;
uint16_t eoud;
uint16_t cp;
uint16_t coud;
uint16_t cofb;
uint16_t corl;
uint16_t cpos;
};
struct
cubearray
{
int * ep;
int * eofb;
int * eorl;
int * eoud;
int * cp;
int * coud;
int * corl;
int * cofb;
int * cpos;
};
struct
dfsdata
{
int d;
int m;
int lb;
bool niss;
Move last1;
Move last2;
AlgList * sols;
Alg * current_alg;
Move sorted_moves[NMOVES];
int move_position[NMOVES];
};
struct
piecefilter
{
bool epose;
bool eposs;
bool eposm;
bool eofb;
bool eorl;
bool eoud;
bool cp;
bool coud;
bool cofb;
bool corl;
bool cpos;
};
struct
prunedata
{
char * filename;
uint8_t * ptable;
uint8_t * reached;
bool generated;
uint64_t n;
uint64_t size;
Indexer index;
Moveset moveset;
};
struct
solveoptions
{
int min_moves;
int max_moves;
int max_solutions;
bool optimal_only;
bool can_niss;
bool feedback;
Trans pre_trans;
};
struct
step
{
Checker check;
Checker ready;
Moveset moveset;
};
/* TODO: I put it here because it needs the definition of Step, sort it out */
struct
algset
{
char * filename;
AlgList ** table;
bool generated;
uint64_t size;
Indexer index;
AntiIndexer antindex;
Step step;
SolveOptions opts;
};
|
