Revision a76bb8f6
Added by Leszek Koltunski about 1 year ago
src/main/java/org/distorted/objectlib/tablebases/TBDino6.java | ||
---|---|---|
9 | 9 |
|
10 | 10 |
package org.distorted.objectlib.tablebases; |
11 | 11 |
|
12 |
import static org.distorted.objectlib.main.TwistyObject.SQ3; |
|
13 |
|
|
14 | 12 |
import android.content.res.Resources; |
15 | 13 |
|
16 |
import org.distorted.library.type.Static3D; |
|
17 | 14 |
import org.distorted.objectlib.R; |
18 | 15 |
|
19 | 16 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
20 | 17 |
|
21 |
public class TBDino6 extends TablebasesPruning
|
|
18 |
public class TBDino6 extends TBDino
|
|
22 | 19 |
{ |
23 |
private static final int INDEX_INVERTED = 13379863; // quats (0,10,0,10, 11,11,11,11, 0,10,0,10) |
|
24 |
|
|
25 |
private static final int[][] QUATS = |
|
26 |
{ |
|
27 |
{0,2,10,8, 1,3,5,7, 11,6,9,4}, |
|
28 |
{1,0,5,10, 2,6,8,4, 7,9,3,11}, |
|
29 |
{10,6,0,4, 7,5,3,1, 9,2,11,8}, |
|
30 |
{7,10,3,0, 6,2,4,8, 1,11,5,9}, |
|
31 |
{2,1,8,5, 0,9,10,11, 4,3,6,7 }, |
|
32 |
{4,5,6,1, 9,0,11,10, 2,7,8,3 }, |
|
33 |
{6,7,4,3, 10,11,0,9, 8,5,2,1 }, |
|
34 |
{8,3,2,7, 11,10,9,0, 6,1,4,5 }, |
|
35 |
{11,8,9,2, 3,1,7,5, 0,4,10,6}, |
|
36 |
{5,9,1,11, 4,8,6,2, 3,0,7,10}, |
|
37 |
{9,4,11,6, 5,7,1,3, 10,8,0,2}, |
|
38 |
{3,11,7,9, 8,4,2,6, 5,10,1,0} |
|
39 |
}; |
|
40 |
|
|
41 |
private int[][] mAngles; |
|
20 |
private static final int SOLVED1 = 0; |
|
21 |
private static final int SOLVED2 = 13379863; // quats (0,10,0,10, 11,11,11,11, 0,10,0,10) |
|
42 | 22 |
|
43 | 23 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
44 | 24 |
|
... | ... | |
54 | 34 |
super(res,new int[] {R.raw.dino_3_pruning3,R.raw.dino_3_pruning4},new int[] {R.raw.dino_3_pruning10}); |
55 | 35 |
} |
56 | 36 |
|
57 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
58 |
|
|
59 |
int[][] getBasicAngles() |
|
60 |
{ |
|
61 |
if( mAngles==null ) |
|
62 |
{ |
|
63 |
int[] tmp = {3,3,3}; |
|
64 |
mAngles = new int[][] { tmp,tmp,tmp,tmp }; |
|
65 |
} |
|
66 |
|
|
67 |
return mAngles; |
|
68 |
} |
|
69 |
|
|
70 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
71 |
|
|
72 |
Static3D[] getRotationAxis() |
|
73 |
{ |
|
74 |
return new Static3D[] |
|
75 |
{ |
|
76 |
new Static3D( SQ3/3, SQ3/3, SQ3/3), |
|
77 |
new Static3D(-SQ3/3,-SQ3/3, SQ3/3), |
|
78 |
new Static3D(-SQ3/3, SQ3/3,-SQ3/3), |
|
79 |
new Static3D( SQ3/3,-SQ3/3,-SQ3/3), |
|
80 |
}; |
|
81 |
} |
|
82 |
|
|
83 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
84 |
|
|
85 |
float[][] getPosition() |
|
86 |
{ |
|
87 |
return new float[][] |
|
88 |
{ |
|
89 |
{ 0.0f, 1.5f, 1.5f }, |
|
90 |
{ 1.5f, 0.0f, 1.5f }, |
|
91 |
{ 0.0f,-1.5f, 1.5f }, |
|
92 |
{-1.5f, 0.0f, 1.5f }, |
|
93 |
{ 1.5f, 1.5f, 0.0f }, |
|
94 |
{ 1.5f,-1.5f, 0.0f }, |
|
95 |
{-1.5f,-1.5f, 0.0f }, |
|
96 |
{-1.5f, 1.5f, 0.0f }, |
|
97 |
{ 0.0f, 1.5f,-1.5f }, |
|
98 |
{ 1.5f, 0.0f,-1.5f }, |
|
99 |
{ 0.0f,-1.5f,-1.5f }, |
|
100 |
{-1.5f, 0.0f,-1.5f } |
|
101 |
}; |
|
102 |
} |
|
103 |
|
|
104 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
105 |
|
|
106 |
float[][] getCuts() |
|
107 |
{ |
|
108 |
float[] cut = new float[] { -SQ3/3, SQ3/3 }; |
|
109 |
return new float[][] { cut,cut,cut,cut }; |
|
110 |
} |
|
111 |
|
|
112 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
113 |
// exclude the middle layer |
|
114 |
|
|
115 |
boolean[][] getRotatable() |
|
116 |
{ |
|
117 |
boolean[] tmp = {true,false,true}; |
|
118 |
return new boolean[][] { tmp,tmp,tmp,tmp }; |
|
119 |
} |
|
120 |
|
|
121 | 37 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
122 | 38 |
// specifically for the tablebase |
123 | 39 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
... | ... | |
126 | 42 |
@Override |
127 | 43 |
int[] getSolvedIndices() |
128 | 44 |
{ |
129 |
return new int[] {0,INDEX_INVERTED};
|
|
45 |
return new int[] {SOLVED1,SOLVED2};
|
|
130 | 46 |
} |
131 | 47 |
|
132 | 48 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
... | ... | |
135 | 51 |
@Override |
136 | 52 |
boolean isSolved(int index) |
137 | 53 |
{ |
138 |
return index==0 || index==INDEX_INVERTED; |
|
139 |
} |
|
140 |
|
|
141 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
142 |
// we can never really move the top-front edge, because if we do so, we would also rotate the |
|
143 |
// rotation axis themselves! (see getIndex() where the cubit quats are normalized so that quat[0] |
|
144 |
// - i.e. the front-top edge - is always 0). |
|
145 |
// That's why map the moves (0,2,X) to (0,0&1,-X) and (3,0,X) to (3,1&2,-X) |
|
146 |
|
|
147 |
@Override |
|
148 |
int[] newMove(int axis, int layer, int angle) |
|
149 |
{ |
|
150 |
if( axis==0 && layer==2 ) return new int[] { axis, 3, angle==1 ? 1:-1}; |
|
151 |
if( axis==3 && layer==0 ) return new int[] { axis, 6, angle==1 ? 1:-1}; |
|
152 |
|
|
153 |
int maxAngle = mAngles[axis][layer]; |
|
154 |
angle = maxAngle-angle; |
|
155 |
if( angle> 0.5f*maxAngle ) angle -= maxAngle; |
|
156 |
return new int[] { axis, (1<<layer), angle }; |
|
157 |
} |
|
158 |
|
|
159 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
160 |
// here we change back the mapping introduced by 'newMove()' |
|
161 |
|
|
162 |
@Override |
|
163 |
void convertMoves(int[][] moves) |
|
164 |
{ |
|
165 |
for(int[] move : moves ) |
|
166 |
{ |
|
167 |
int[] newMove = newMove(move[0],move[1],move[2]); |
|
168 |
|
|
169 |
move[0] = newMove[0]; |
|
170 |
move[1] = newMove[1]; |
|
171 |
move[2] = newMove[2]; |
|
172 |
} |
|
173 |
/* |
|
174 |
int len = moves.length; |
|
175 |
|
|
176 |
for(int i=0; i<len; i++) |
|
177 |
{ |
|
178 |
int[] move = moves[i]; |
|
179 |
if( move[1]==3 || move[1]==6 ) unrollMoves(moves,i); |
|
180 |
} |
|
181 |
*/ |
|
182 |
} |
|
183 |
|
|
184 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
185 |
|
|
186 |
private void unrollMoves(int[][] moves, int index) |
|
187 |
{ |
|
188 |
int[] move = moves[index]; |
|
189 |
int len = moves.length; |
|
190 |
|
|
191 |
if( move[0]==0 && move[1]==3 ) |
|
192 |
{ |
|
193 |
move[1] = 4; |
|
194 |
move[2] = -move[2]; |
|
195 |
for(int i=index+1; i<len; i++) unrollMove(moves[i],move[2]>0 ? 0:1); |
|
196 |
} |
|
197 |
else if( move[0]==3 && move[1]==6 ) |
|
198 |
{ |
|
199 |
move[1] = 1; |
|
200 |
move[2] = -move[2]; |
|
201 |
for(int i=index+1; i<len; i++) unrollMove(moves[i],move[2]>0 ? 0:1); |
|
202 |
} |
|
203 |
} |
|
204 |
|
|
205 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
206 |
|
|
207 |
private void printMoves(String s, int[][] moves) |
|
208 |
{ |
|
209 |
StringBuilder sb = new StringBuilder(); |
|
210 |
|
|
211 |
for(int[] move: moves) |
|
212 |
{ |
|
213 |
sb.append('('); |
|
214 |
sb.append(move[0]); |
|
215 |
sb.append(' '); |
|
216 |
sb.append(move[1]); |
|
217 |
sb.append(' '); |
|
218 |
sb.append(move[2]); |
|
219 |
sb.append(')'); |
|
220 |
} |
|
221 |
|
|
222 |
android.util.Log.e("D", s+" : "+sb); |
|
223 |
} |
|
224 |
|
|
225 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
226 |
|
|
227 |
private void unrollMove(int[] move, int caseUnroll) |
|
228 |
{ |
|
229 |
int ax = move[0]; |
|
230 |
int la = move[1]; |
|
231 |
|
|
232 |
switch(caseUnroll) |
|
233 |
{ |
|
234 |
case 0: android.util.Log.e("D", "case 0 ax "+ax); |
|
235 |
switch(ax) |
|
236 |
{ |
|
237 |
case 0: break; |
|
238 |
case 1: move[0]=3; move[1]=negate(la); move[2] = -move[2]; break; |
|
239 |
case 2: move[0]=1; break; |
|
240 |
case 3: move[0]=2; move[1]=negate(la); move[2] = -move[2]; break; |
|
241 |
} |
|
242 |
break; |
|
243 |
case 1: android.util.Log.e("D", "case 1 ax "+ax); |
|
244 |
switch(ax) |
|
245 |
{ |
|
246 |
case 0: break; |
|
247 |
case 1: move[0]=2; break; |
|
248 |
case 2: move[0]=3; move[1]=negate(la); move[2] = -move[2]; break; |
|
249 |
case 3: move[0]=1; move[1]=negate(la); move[2] = -move[2]; break; |
|
250 |
} |
|
251 |
break; |
|
252 |
case 2: android.util.Log.e("D", "case 2 ax "+ax); |
|
253 |
switch(ax) |
|
254 |
{ |
|
255 |
case 0: move[0]=1; move[1]=negate(la); move[2] = -move[2]; break; |
|
256 |
case 1: move[0]=2; break; |
|
257 |
case 2: move[0]=0; move[1]=negate(la); move[2] = -move[2]; break; |
|
258 |
case 3: break; |
|
259 |
} |
|
260 |
break; |
|
261 |
case 3: android.util.Log.e("D", "case 3 ax "+ax); |
|
262 |
switch(ax) |
|
263 |
{ |
|
264 |
case 0: move[0]=2; move[1]=negate(la); move[2] = -move[2]; break; |
|
265 |
case 1: move[0]=0; move[1]=negate(la); move[2] = -move[2]; break; |
|
266 |
case 2: move[0]=1; break; |
|
267 |
case 3: break; |
|
268 |
} |
|
269 |
break; |
|
270 |
} |
|
271 |
} |
|
272 |
|
|
273 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
274 |
|
|
275 |
private int negate(int layer) |
|
276 |
{ |
|
277 |
switch(layer) |
|
278 |
{ |
|
279 |
case 1: return 4; |
|
280 |
case 3: return 6; |
|
281 |
case 4: return 1; |
|
282 |
case 6: return 3; |
|
283 |
} |
|
284 |
return layer; |
|
54 |
return index==SOLVED1 || index==SOLVED2; |
|
285 | 55 |
} |
286 | 56 |
|
287 | 57 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
... | ... | |
319 | 89 |
return 10; |
320 | 90 |
} |
321 | 91 |
|
322 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
323 |
|
|
324 |
boolean moveCanProceed(int lastA, int lastR, int currA, int currR) |
|
325 |
{ |
|
326 |
return (lastA!=currA) || (lastR!=currR); |
|
327 |
} |
|
328 |
|
|
329 | 92 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
330 | 93 |
|
331 | 94 |
public static int getIndexFromPerm(int[] perm) |
... | ... | |
335 | 98 |
return TablebaseHelpers.computeEvenPermutationNum(perm11); |
336 | 99 |
} |
337 | 100 |
|
338 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
339 |
// in-place! |
|
340 |
|
|
341 |
public static int[] getPermFromQuats(int[] quats) |
|
342 |
{ |
|
343 |
for(int i=0; i<12; i++) |
|
344 |
{ |
|
345 |
int[] Q = QUATS[i]; |
|
346 |
int quat = quats[i]; |
|
347 |
|
|
348 |
for(int j=0; j<12; j++) |
|
349 |
if( Q[j]==quat ) |
|
350 |
{ |
|
351 |
quats[i] = j; |
|
352 |
break; |
|
353 |
} |
|
354 |
} |
|
355 |
|
|
356 |
return quats; |
|
357 |
} |
|
358 |
|
|
359 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
360 |
// in-place! |
|
361 |
|
|
362 |
public static int[] getQuatsFromPerm(int[] perm) |
|
363 |
{ |
|
364 |
for(int i=0; i<12; i++) |
|
365 |
{ |
|
366 |
int p = perm[i]; |
|
367 |
perm[i] = QUATS[i][p]; |
|
368 |
} |
|
369 |
|
|
370 |
return perm; |
|
371 |
} |
|
372 |
|
|
373 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
374 |
// we rotate the whole thing so that quat[0] is always 0. |
|
375 |
|
|
376 |
private void normalizeQuats(int[] quats) |
|
377 |
{ |
|
378 |
if( quats[0]!=0 ) |
|
379 |
{ |
|
380 |
int inverted = getInvertedQuat(quats[0]); |
|
381 |
quats[0] = 0; |
|
382 |
|
|
383 |
for(int i=1; i<12; i++) |
|
384 |
{ |
|
385 |
int index = quats[i]; |
|
386 |
quats[i] = getMultQuat(inverted,index); |
|
387 |
} |
|
388 |
} |
|
389 |
} |
|
390 |
|
|
391 | 101 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
392 | 102 |
|
393 | 103 |
int[] getQuats(int index) |
Also available in: Unified diff
Dino solvers: unroll moves!