Revision d8003f3a
Added by Leszek Koltunski about 1 year ago
src/main/java/org/distorted/objectlib/tablebases/TablebasesPyraminx.java | ||
---|---|---|
21 | 21 |
|
22 | 22 |
public class TablebasesPyraminx extends TablebasesAbstract |
23 | 23 |
{ |
24 |
public static final int[][] EDGE_QUATS = new int[][] |
|
25 |
{ |
|
26 |
{ 0,10}, // even-odd quat (i.e. even-odd twist of the relevant edge piece) |
|
27 |
{ 1, 7}, |
|
28 |
{ 4, 8}, |
|
29 |
{ 2, 6}, |
|
30 |
{ 3, 5}, |
|
31 |
{ 9,11} |
|
32 |
}; |
|
33 |
|
|
24 | 34 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
25 | 35 |
|
26 | 36 |
public TablebasesPyraminx() |
... | ... | |
62 | 72 |
{ 0.5f, SQ2/4, 0.0f}, |
63 | 73 |
|
64 | 74 |
{ 0.0f,-SQ2/2, 0.0f}, |
65 |
{-0.5f, 0.0f, 0.5f}, |
|
66 |
{-0.5f, 0.0f,-0.5f}, |
|
67 |
{ 0.5f, 0.0f, 0.5f}, |
|
68 | 75 |
{ 0.5f, 0.0f,-0.5f}, |
76 |
{ 0.5f, 0.0f, 0.5f}, |
|
77 |
{-0.5f, 0.0f,-0.5f}, |
|
78 |
{-0.5f, 0.0f, 0.5f}, |
|
69 | 79 |
{ 0.0f, SQ2/2, 0.0f}, |
70 | 80 |
}; |
71 | 81 |
} |
... | ... | |
97 | 107 |
|
98 | 108 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
99 | 109 |
|
100 |
public static void getEdgePermutation(int[] output, int[] quats) |
|
110 |
public static void getEdgePermutation(int[] output, int[] quats, int index) |
|
111 |
{ |
|
112 |
for(int i=0; i<6; i++ ) |
|
113 |
{ |
|
114 |
int quat = quats[i+index]; |
|
115 |
|
|
116 |
for(int j=0; j<6; j++) |
|
117 |
{ |
|
118 |
int[] edge = EDGE_QUATS[j]; |
|
119 |
if( quat==edge[0] || quat==edge[1] ) { output[i]=j; break; } |
|
120 |
} |
|
121 |
} |
|
122 |
} |
|
123 |
|
|
124 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
125 |
|
|
126 |
public static void getEdgeTwist(int[] output, int[] quats, int index) |
|
101 | 127 |
{ |
128 |
for(int i=0; i<6; i++) |
|
129 |
{ |
|
130 |
int quat = quats[i+index]; |
|
131 |
|
|
132 |
for(int j=0; j<6; j++) |
|
133 |
{ |
|
134 |
int[] edge = EDGE_QUATS[j]; |
|
135 |
if( quat==edge[0] ) { output[i]=0; break; } |
|
136 |
if( quat==edge[1] ) { output[i]=1; break; } |
|
137 |
} |
|
138 |
} |
|
139 |
} |
|
140 |
|
|
141 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
102 | 142 |
|
143 |
private void getEdgeQuats(int twist, int[] perm, int[] output) |
|
144 |
{ |
|
145 |
for(int i=0; i<6; i++) |
|
146 |
{ |
|
147 |
int p = perm[i]; |
|
148 |
int t = twist%2; |
|
149 |
twist/=2; |
|
150 |
output[i] = EDGE_QUATS[p][t]; |
|
151 |
} |
|
152 |
} |
|
153 |
|
|
154 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
155 |
|
|
156 |
private int getVertexTwist(int[] quats) |
|
157 |
{ |
|
158 |
int twist = 0; |
|
159 |
|
|
160 |
if( quats[3]==5 ) twist += 1; |
|
161 |
if( quats[3]==6 ) twist += 2; |
|
162 |
twist *= 3; |
|
163 |
if( quats[2]==7 ) twist += 1; |
|
164 |
if( quats[2]==8 ) twist += 2; |
|
165 |
twist *= 3; |
|
166 |
if( quats[1]==1 ) twist += 1; |
|
167 |
if( quats[1]==2 ) twist += 2; |
|
168 |
twist *= 3; |
|
169 |
if( quats[0]==3 ) twist += 1; |
|
170 |
if( quats[0]==4 ) twist += 2; |
|
171 |
|
|
172 |
return twist; |
|
173 |
} |
|
174 |
|
|
175 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
176 |
|
|
177 |
private void getVertexQuats(int twist, int[] output) |
|
178 |
{ |
|
179 |
switch(twist%3) |
|
180 |
{ |
|
181 |
case 0: output[0]=0; break; |
|
182 |
case 1: output[0]=3; break; |
|
183 |
case 2: output[0]=4; break; |
|
184 |
} |
|
185 |
twist /= 3; |
|
186 |
|
|
187 |
switch(twist%3) |
|
188 |
{ |
|
189 |
case 0: output[1]=0; break; |
|
190 |
case 1: output[1]=1; break; |
|
191 |
case 2: output[1]=2; break; |
|
192 |
} |
|
193 |
twist /= 3; |
|
194 |
|
|
195 |
switch(twist%3) |
|
196 |
{ |
|
197 |
case 0: output[2]=0; break; |
|
198 |
case 1: output[2]=7; break; |
|
199 |
case 2: output[2]=8; break; |
|
200 |
} |
|
201 |
twist /= 3; |
|
202 |
|
|
203 |
switch(twist%3) |
|
204 |
{ |
|
205 |
case 0: output[3]=0; break; |
|
206 |
case 1: output[3]=5; break; |
|
207 |
case 2: output[3]=6; break; |
|
208 |
} |
|
103 | 209 |
} |
104 | 210 |
|
105 | 211 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
106 | 212 |
|
107 | 213 |
int[] getQuats(int index) |
108 | 214 |
{ |
109 |
return new int[] {0,0,0,0, 0,0,0,0,0,0}; |
|
215 |
int vertexTwist = (index%81); |
|
216 |
index /= 81; |
|
217 |
int edgeTwist = (index%32); |
|
218 |
int perm_num = index/32; |
|
219 |
|
|
220 |
int[] quats = new int[10]; |
|
221 |
|
|
222 |
getVertexQuats(vertexTwist,quats); |
|
223 |
int[] permutation = new int[6]; |
|
224 |
TablebaseHelpers.getPermutationFromNum(permutation,6,perm_num); |
|
225 |
getEdgeQuats(edgeTwist,permutation,quats); |
|
226 |
|
|
227 |
return quats; |
|
110 | 228 |
} |
111 | 229 |
|
112 | 230 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
113 | 231 |
|
114 | 232 |
int getIndex(int[] quats) |
115 | 233 |
{ |
116 |
return 0; |
|
234 |
int vertexTwist = getVertexTwist(quats); |
|
235 |
int[] permutation = new int[6]; |
|
236 |
getEdgePermutation(permutation,quats,4); |
|
237 |
int[] twist = new int[6]; |
|
238 |
getEdgeTwist(twist,quats,4); |
|
239 |
|
|
240 |
int edgeTwist = twist[0]+ 2*(twist[1]+ 2*(twist[2]+ 2*(twist[3]+ 2*twist[4]))); |
|
241 |
int perm_num = TablebaseHelpers.computeEvenPermutationNum(permutation); |
|
242 |
|
|
243 |
return vertexTwist + 81*(edgeTwist + 32*perm_num); |
|
117 | 244 |
} |
118 | 245 |
} |
119 | 246 |
|
Also available in: Unified diff
Pyraminx solver: progress