1 |
76de8309
|
Leszek Koltunski
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
2 |
|
|
// Copyright 2023 Leszek Koltunski //
|
3 |
|
|
// //
|
4 |
|
|
// This file is part of Magic Cube. //
|
5 |
|
|
// //
|
6 |
|
|
// Magic Cube is proprietary software licensed under an EULA which you should have received //
|
7 |
|
|
// along with the code. If not, check https://distorted.org/magic/License-Magic-Cube.html //
|
8 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
9 |
|
|
|
10 |
|
|
package org.distorted.objectlib.tablebases;
|
11 |
|
|
|
12 |
|
|
import static org.distorted.objectlib.main.TwistyObject.SQ3;
|
13 |
|
|
|
14 |
|
|
import android.content.res.Resources;
|
15 |
|
|
|
16 |
|
|
import org.distorted.library.type.Static3D;
|
17 |
5b9f1cec
|
Leszek Koltunski
|
import org.distorted.objectlib.R;
|
18 |
76de8309
|
Leszek Koltunski
|
|
19 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
20 |
|
|
|
21 |
5b9f1cec
|
Leszek Koltunski
|
public class TBDino6 extends TablebasesPruning
|
22 |
76de8309
|
Leszek Koltunski
|
{
|
23 |
5b9f1cec
|
Leszek Koltunski
|
private static final int INDEX_INVERTED = 13379863; // quats (0,10,0,10, 11,11,11,11, 0,10,0,10)
|
24 |
|
|
|
25 |
9e7ff8d2
|
Leszek Koltunski
|
private static final int[][] QUATS =
|
26 |
|
|
{
|
27 |
|
|
{0,2,10,8, 1,4,6,7, 11,5,9,3},
|
28 |
|
|
{1,0,6,10, 2,5,8,3, 7,9,4,11},
|
29 |
|
|
{10,5,0,3, 7,6,4,1, 9,2,11,8},
|
30 |
|
|
{7,10,4,0, 5,2,3,8, 1,11,6,9},
|
31 |
|
|
{2,1,8,6, 0,9,10,11, 3,4,5,7 },
|
32 |
|
|
{3,6,5,1, 9,0,11,10, 2,7,8,4 },
|
33 |
|
|
{5,7,3,4, 10,11,0,9, 8,6,2,1 },
|
34 |
|
|
{8,4,2,7, 11,10,9,0, 5,1,3,6 },
|
35 |
|
|
{11,8,9,2, 4,1,7,6, 0,3,10,5},
|
36 |
|
|
{6,9,1,11, 3,8,5,2, 4,0,7,10},
|
37 |
|
|
{9,3,11,5, 6,7,1,4, 10,8,0,2},
|
38 |
|
|
{4,11,7,9, 8,3,2,5, 6,10,1,0}
|
39 |
|
|
};
|
40 |
|
|
|
41 |
5b9f1cec
|
Leszek Koltunski
|
private int[][] mAngles;
|
42 |
|
|
|
43 |
76de8309
|
Leszek Koltunski
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
44 |
|
|
|
45 |
|
|
public TBDino6()
|
46 |
|
|
{
|
47 |
|
|
super();
|
48 |
|
|
}
|
49 |
|
|
|
50 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
51 |
|
|
|
52 |
|
|
public TBDino6(Resources res)
|
53 |
|
|
{
|
54 |
5b9f1cec
|
Leszek Koltunski
|
super(res,new int[] {R.raw.dino_3_pruning3,R.raw.dino_3_pruning4},new int[] {R.raw.dino_3_pruning10});
|
55 |
76de8309
|
Leszek Koltunski
|
}
|
56 |
|
|
|
57 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
58 |
|
|
|
59 |
|
|
int[][] getBasicAngles()
|
60 |
|
|
{
|
61 |
5b9f1cec
|
Leszek Koltunski
|
if( mAngles==null )
|
62 |
|
|
{
|
63 |
|
|
int[] tmp = {3,3,3};
|
64 |
|
|
mAngles = new int[][] { tmp,tmp,tmp,tmp };
|
65 |
|
|
}
|
66 |
|
|
|
67 |
|
|
return mAngles;
|
68 |
76de8309
|
Leszek Koltunski
|
}
|
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 |
88a4ee05
|
Leszek Koltunski
|
// exclude the middle layer
|
114 |
76de8309
|
Leszek Koltunski
|
|
115 |
|
|
boolean[][] getRotatable()
|
116 |
|
|
{
|
117 |
9e7ff8d2
|
Leszek Koltunski
|
boolean[] tmp = {true,false,true};
|
118 |
76de8309
|
Leszek Koltunski
|
return new boolean[][] { tmp,tmp,tmp,tmp };
|
119 |
|
|
}
|
120 |
|
|
|
121 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
122 |
|
|
// specifically for the tablebase
|
123 |
5b9f1cec
|
Leszek Koltunski
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
124 |
|
|
// two solved positions: original and mirrored (left face swapped with right)
|
125 |
|
|
|
126 |
|
|
@Override
|
127 |
|
|
int[] getSolvedIndices()
|
128 |
|
|
{
|
129 |
|
|
return new int[] {0,INDEX_INVERTED};
|
130 |
|
|
}
|
131 |
|
|
|
132 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
133 |
|
|
// ditto
|
134 |
|
|
|
135 |
|
|
@Override
|
136 |
|
|
boolean isSolved(int index)
|
137 |
|
|
{
|
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 |
1002958d
|
Leszek Koltunski
|
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 |
5b9f1cec
|
Leszek Koltunski
|
|
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 |
76de8309
|
Leszek Koltunski
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
160 |
5b9d6595
|
Leszek Koltunski
|
// 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 |
1002958d
|
Leszek Koltunski
|
if( move[1]==3 || move[1]==6 ) unrollMoves(moves,i);
|
180 |
5b9d6595
|
Leszek Koltunski
|
}
|
181 |
|
|
*/
|
182 |
|
|
}
|
183 |
|
|
|
184 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
185 |
|
|
|
186 |
|
|
private void unrollMoves(int[][] moves, int index)
|
187 |
|
|
{
|
188 |
|
|
int[] move = moves[index];
|
189 |
1002958d
|
Leszek Koltunski
|
int len = moves.length;
|
190 |
5b9d6595
|
Leszek Koltunski
|
|
191 |
1002958d
|
Leszek Koltunski
|
if( move[0]==0 && move[1]==3 )
|
192 |
5b9d6595
|
Leszek Koltunski
|
{
|
193 |
1002958d
|
Leszek Koltunski
|
move[1] = 4;
|
194 |
5b9d6595
|
Leszek Koltunski
|
move[2] = -move[2];
|
195 |
1002958d
|
Leszek Koltunski
|
for(int i=index+1; i<len; i++) unrollMove(moves[i],move[2]>0 ? 0:1);
|
196 |
5b9d6595
|
Leszek Koltunski
|
}
|
197 |
1002958d
|
Leszek Koltunski
|
else if( move[0]==3 && move[1]==6 )
|
198 |
5b9d6595
|
Leszek Koltunski
|
{
|
199 |
1002958d
|
Leszek Koltunski
|
move[1] = 1;
|
200 |
5b9d6595
|
Leszek Koltunski
|
move[2] = -move[2];
|
201 |
1002958d
|
Leszek Koltunski
|
for(int i=index+1; i<len; i++) unrollMove(moves[i],move[2]>0 ? 0:1);
|
202 |
5b9d6595
|
Leszek Koltunski
|
}
|
203 |
1002958d
|
Leszek Koltunski
|
}
|
204 |
5b9d6595
|
Leszek Koltunski
|
|
205 |
1002958d
|
Leszek Koltunski
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
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 |
5b9d6595
|
Leszek Koltunski
|
}
|
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 |
1002958d
|
Leszek Koltunski
|
case 1: move[0]=3; move[1]=negate(la); move[2] = -move[2]; break;
|
239 |
5b9d6595
|
Leszek Koltunski
|
case 2: move[0]=1; break;
|
240 |
1002958d
|
Leszek Koltunski
|
case 3: move[0]=2; move[1]=negate(la); move[2] = -move[2]; break;
|
241 |
5b9d6595
|
Leszek Koltunski
|
}
|
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 |
1002958d
|
Leszek Koltunski
|
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 |
5b9d6595
|
Leszek Koltunski
|
}
|
251 |
|
|
break;
|
252 |
|
|
case 2: android.util.Log.e("D", "case 2 ax "+ax);
|
253 |
|
|
switch(ax)
|
254 |
|
|
{
|
255 |
1002958d
|
Leszek Koltunski
|
case 0: move[0]=1; move[1]=negate(la); move[2] = -move[2]; break;
|
256 |
5b9d6595
|
Leszek Koltunski
|
case 1: move[0]=2; break;
|
257 |
1002958d
|
Leszek Koltunski
|
case 2: move[0]=0; move[1]=negate(la); move[2] = -move[2]; break;
|
258 |
5b9d6595
|
Leszek Koltunski
|
case 3: break;
|
259 |
|
|
}
|
260 |
|
|
break;
|
261 |
|
|
case 3: android.util.Log.e("D", "case 3 ax "+ax);
|
262 |
|
|
switch(ax)
|
263 |
|
|
{
|
264 |
1002958d
|
Leszek Koltunski
|
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 |
5b9d6595
|
Leszek Koltunski
|
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 |
1002958d
|
Leszek Koltunski
|
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;
|
285 |
5b9d6595
|
Leszek Koltunski
|
}
|
286 |
|
|
|
287 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
288 |
76de8309
|
Leszek Koltunski
|
|
289 |
|
|
int getSize()
|
290 |
|
|
{
|
291 |
|
|
return 19958400; // see https://www.jaapsch.net/puzzles/dinocube.htm
|
292 |
|
|
}
|
293 |
|
|
|
294 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
295 |
|
|
|
296 |
|
|
int getMinScramble()
|
297 |
|
|
{
|
298 |
5b9f1cec
|
Leszek Koltunski
|
return 8;
|
299 |
|
|
}
|
300 |
|
|
|
301 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
302 |
|
|
|
303 |
|
|
int[] getMidPruningLevels()
|
304 |
|
|
{
|
305 |
|
|
return new int[] {3,4};
|
306 |
|
|
}
|
307 |
|
|
|
308 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
309 |
|
|
|
310 |
|
|
int[] getHighPruningLevels()
|
311 |
|
|
{
|
312 |
|
|
return new int[] {10};
|
313 |
|
|
}
|
314 |
|
|
|
315 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
316 |
|
|
|
317 |
|
|
int getGodsNumber()
|
318 |
|
|
{
|
319 |
|
|
return 10;
|
320 |
|
|
}
|
321 |
|
|
|
322 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
323 |
|
|
|
324 |
|
|
boolean moveCanProceed(int lastA, int lastR, int currA, int currR)
|
325 |
|
|
{
|
326 |
|
|
return (lastA!=currA) || (lastR!=currR);
|
327 |
76de8309
|
Leszek Koltunski
|
}
|
328 |
|
|
|
329 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
330 |
|
|
|
331 |
|
|
public static int getIndexFromPerm(int[] perm)
|
332 |
|
|
{
|
333 |
ef93065b
|
Leszek Koltunski
|
int[] perm11 = new int[11];
|
334 |
|
|
for(int i=0; i<11; i++) perm11[i] = perm[i+1]-1;
|
335 |
|
|
return TablebaseHelpers.computeEvenPermutationNum(perm11);
|
336 |
|
|
}
|
337 |
|
|
|
338 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
339 |
9e7ff8d2
|
Leszek Koltunski
|
// in-place!
|
340 |
ef93065b
|
Leszek Koltunski
|
|
341 |
|
|
private int[] getPermFromQuats(int[] quats)
|
342 |
|
|
{
|
343 |
9e7ff8d2
|
Leszek Koltunski
|
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 |
ef93065b
|
Leszek Koltunski
|
}
|
358 |
|
|
|
359 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
360 |
9e7ff8d2
|
Leszek Koltunski
|
// in-place!
|
361 |
ef93065b
|
Leszek Koltunski
|
|
362 |
5b9f1cec
|
Leszek Koltunski
|
public static int[] getQuatsFromPerm(int[] perm)
|
363 |
ef93065b
|
Leszek Koltunski
|
{
|
364 |
9e7ff8d2
|
Leszek Koltunski
|
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 |
76de8309
|
Leszek Koltunski
|
}
|
390 |
|
|
|
391 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
392 |
|
|
|
393 |
|
|
int[] getQuats(int index)
|
394 |
|
|
{
|
395 |
ef93065b
|
Leszek Koltunski
|
int[] perm11 = new int[11];
|
396 |
|
|
TablebaseHelpers.getEvenPermutationFromNum(perm11,index);
|
397 |
|
|
int[] perm = new int[12];
|
398 |
|
|
for(int i=1; i<12; i++) perm[i] = perm11[i-1]+1;
|
399 |
|
|
return getQuatsFromPerm(perm);
|
400 |
76de8309
|
Leszek Koltunski
|
}
|
401 |
|
|
|
402 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
403 |
|
|
|
404 |
|
|
int getIndex(int[] quats)
|
405 |
|
|
{
|
406 |
9e7ff8d2
|
Leszek Koltunski
|
normalizeQuats(quats);
|
407 |
ef93065b
|
Leszek Koltunski
|
int[] perm = getPermFromQuats(quats);
|
408 |
0cb18c32
|
Leszek Koltunski
|
return getIndexFromPerm(perm);
|
409 |
76de8309
|
Leszek Koltunski
|
}
|
410 |
|
|
}
|