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
|
int
array_ep_to_epos(int *ep, int *ss)
{
int epos[12] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int eps[4];
int i, j, is;
for (i = 0, is = 0; i < 12; i++) {
for (j = 0; j < 4; j++) {
if (ep[i] == ss[j]) {
eps[is++] = j;
epos[i] = 1;
}
}
}
for (i = 0; i < 4; i++)
swap(&epos[ss[i]], &epos[i+8]);
return 24 * subset_to_index(epos, 12, 4) + perm_to_index(eps, 4);
}
void
epos_to_compatible_ep(int epos, int *ep, int *ss)
{
int i, j, k, other[8];
bool flag;
for (i = 0; i < 12; i++)
ep[i] = -1;
epos_to_partial_ep(epos, ep, ss);
for (i = 0, j = 0; i < 12; i++) {
flag = false;
for (k = 0; k < 4; k++)
flag = flag || (i == ss[k]);
if (!flag)
other[j++] = i;
}
for (i = 0, j = 0; i < 12; i++)
if (ep[i] == -1)
ep[i] = other[j++];
}
void
epos_to_partial_ep(int epos, int *ep, int *ss)
{
int i, is, eposs[12], eps[4];
index_to_perm(epos % FACTORIAL4, 4, eps);
index_to_subset(epos / FACTORIAL4, 12, 4, eposs);
for (i = 0; i < 4; i++)
swap(&eposs[ss[i]], &eposs[i+8]);
for (i = 0, is = 0; i < 12; i++)
if (eposs[i])
ep[i] = ss[eps[is++]];
}
void
fix_eorleoud(CubeArray *arr)
{
int i;
for (i = 0; i < 12; i++) {
if ((edge_slice(i) == 0 && edge_slice(arr->ep[i]) != 0) ||
(edge_slice(i) != 0 && edge_slice(arr->ep[i]) == 0)) {
arr->eorl[i] = 1 - arr->eofb[i];
} else {
arr->eorl[i] = arr->eofb[i];
}
if ((edge_slice(i) == 2 && edge_slice(arr->ep[i]) != 2) ||
(edge_slice(i) != 2 && edge_slice(arr->ep[i]) == 2)) {
arr->eoud[i] = 1 - arr->eofb[i];
} else {
arr->eoud[i] = arr->eofb[i];
}
}
}
void
fix_cofbcorl(CubeArray *arr)
{
int i;
for (i = 0; i < 8; i++) {
if (i % 2 == arr->cp[i] % 2) {
arr->cofb[i] = arr->coud[i];
arr->corl[i] = arr->coud[i];
} else {
if (arr->cp[i] % 2 == 0) {
arr->cofb[i] = (arr->coud[i]+1)%3;
arr->corl[i] = (arr->coud[i]+2)%3;
} else {
arr->cofb[i] = (arr->coud[i]+2)%3;
arr->corl[i] = (arr->coud[i]+1)%3;
}
}
}
}
Cube
admissible_ep(Cube cube, PieceFilter f)
{
CubeArray *arr = new_cubearray(cube, f);
Cube ret;
bool used[12] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int i, j;
for (i = 0; i < 12; i++)
if (arr->ep[i] != -1)
used[arr->ep[i]] = true;
for (i = 0, j = 0; i < 12; i++) {
for ( ; j < 11 && used[j]; j++);
if (arr->ep[i] == -1)
arr->ep[i] = j++;
}
ret = arrays_to_cube(arr, pf_ep);
free_cubearray(arr, f);
return ret;
}
int
edge_slice(Edge e) {
if (e < 0 || e > 11)
return -1;
if (e == FR || e == FL || e == BL || e == BR)
return 0;
if (e == UR || e == UL || e == DR || e == DL)
return 1;
return 2;
}
int
piece_orientation(Cube cube, int piece, char *orientation)
{
int arr[12], n, b, x;
if (!strcmp(orientation, "eofb")) {
x = cube.eofb;
n = 12;
b = 2;
} else if (!strcmp(orientation, "eorl")) {
x = cube.eorl;
n = 12;
b = 2;
} else if (!strcmp(orientation, "eoud")) {
x = cube.eoud;
n = 12;
b = 2;
} else if (!strcmp(orientation, "coud")) {
x = cube.coud;
n = 8;
b = 3;
} else if (!strcmp(orientation, "corl")) {
x = cube.corl;
n = 8;
b = 3;
} else if (!strcmp(orientation, "cofb")) {
x = cube.cofb;
n = 8;
b = 3;
} else {
return -1;
}
int_to_sum_zero_array(x, b, n, arr);
if (piece < n)
return arr[piece];
return -1;
}
|
