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
|
#define CUBE_C
#include "cube.h"
static int where_is_piece(int piece, int *arr, int n);
void
compose(Cube *c2, Cube *c1)
{
apply_permutation(c2->ep, c1->ep, 12);
apply_permutation(c2->ep, c1->eo, 12);
sum_arrays_mod(c2->eo, c1->eo, 12, 2);
apply_permutation(c2->cp, c1->cp, 8);
apply_permutation(c2->cp, c1->co, 8);
sum_arrays_mod(c2->co, c1->co, 8, 3);
apply_permutation(c2->xp, c1->xp, 6);
}
void
copy_cube(Cube *src, Cube *dst)
{
memcpy(dst->ep, src->ep, 12 * sizeof(int));
memcpy(dst->eo, src->eo, 12 * sizeof(int));
memcpy(dst->cp, src->cp, 8 * sizeof(int));
memcpy(dst->co, src->co, 8 * sizeof(int));
memcpy(dst->xp, src->xp, 6 * sizeof(int));
}
bool
equal(Cube *c1, Cube *c2)
{
int i;
for (i = 0; i < 12; i++)
if (c1->ep[i] != c2->ep[i] || c1->eo[i] != c2->eo[i])
return false;
for (i = 0; i < 8; i++)
if (c1->cp[i] != c2->cp[i] || c1->co[i] != c2->co[i])
return false;
for (i = 0; i < 6; i++)
if (c1->xp[i] != c2->xp[i])
return false;
return true;
}
void
invert_cube(Cube *cube)
{
Cube aux;
int i;
copy_cube(cube, &aux);
for (i = 0; i < 12; i++) {
cube->ep[aux.ep[i]] = i;
cube->eo[aux.ep[i]] = aux.eo[i];
}
for (i = 0; i < 8; i++) {
cube->cp[aux.cp[i]] = i;
cube->co[aux.cp[i]] = (3 - aux.co[i]) % 3;
}
for (i = 0; i < 6; i++)
cube->xp[aux.xp[i]] = i;
}
bool
is_admissible(Cube *c) {
bool perm;
int sign, i;
int sum_e, sum_c;
perm = is_perm(c->ep, 12) && is_perm(c->cp, 8) && is_perm(c->xp, 6);
sign = perm_sign(c->ep,12) + perm_sign(c->cp,8) + perm_sign(c->xp,6);
for (i = 0, sum_e = 0; i < 12; i++)
if (c->eo[i] > 1)
return false;
else
sum_e += c->eo[i];
for (i = 0, sum_c = 0; i < 8; i++)
if (c->co[i] > 2)
return false;
else
sum_c += c->co[i];
return (perm && sign % 2 == 0 && sum_e % 2 == 0 && sum_c % 2 == 0);
}
bool
is_solved(Cube *cube)
{
Cube solved_cube;
make_solved(&solved_cube);
return equal(cube, &solved_cube);
}
void
make_solved(Cube *cube)
{
static int sorted[12] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11};
memcpy(cube->ep, sorted, 12 * sizeof(int));
memset(cube->eo, 0, 12 * sizeof(int));
memcpy(cube->cp, sorted, 8 * sizeof(int));
memset(cube->co, 0, 8 * sizeof(int));
memcpy(cube->xp, sorted, 6 * sizeof(int));
}
void
print_cube(Cube *cube)
{
static char edge_string[12][7] = {
[UF] = "UF", [UL] = "UL", [UB] = "UB", [UR] = "UR",
[DF] = "DF", [DL] = "DL", [DB] = "DB", [DR] = "DR",
[FR] = "FR", [FL] = "FL", [BL] = "BL", [BR] = "BR"
};
static char corner_string[8][7] = {
[UFR] = "UFR", [UFL] = "UFL", [UBL] = "UBL", [UBR] = "UBR",
[DFR] = "DFR", [DFL] = "DFL", [DBL] = "DBL", [DBR] = "DBR"
};
static char center_string[6][7] = {
[U_center] = "U", [D_center] = "D",
[R_center] = "R", [L_center] = "L",
[F_center] = "F", [B_center] = "B"
};
for (int i = 0; i < 12; i++)
printf(" %s ", edge_string[cube->ep[i]]);
printf("\n");
for (int i = 0; i < 12; i++)
printf(" %" PRIu8 " ", cube->eo[i]);
printf("\n");
for (int i = 0; i < 8; i++)
printf("%s ", corner_string[cube->cp[i]]);
printf("\n");
for (int i = 0; i < 8; i++)
printf(" %" PRIu8 " ", cube->co[i]);
printf("\n");
for (int i = 0; i < 6; i++)
printf(" %s ", center_string[cube->xp[i]]);
printf("\n");
}
int
where_is_center(Center x, Cube *c)
{
return where_is_piece(x, c->xp, 6);
}
int
where_is_corner(Corner k, Cube *c)
{
return where_is_piece(k, c->cp, 8);
}
int
where_is_edge(Edge e, Cube *c)
{
return where_is_piece(e, c->ep, 12);
}
static int
where_is_piece(int piece, int *arr, int n)
{
int i;
for (i = 0; i < n; i++)
if (arr[i] == piece)
return i;
return -1;
}
|
