1
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
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 org.distorted.objectlib.helpers.OperatingSystemInterface;
|
13
|
|
14
|
import java.io.ByteArrayOutputStream;
|
15
|
import java.io.IOException;
|
16
|
import java.io.InputStream;
|
17
|
|
18
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
19
|
|
20
|
public abstract class TablebasesPruning extends TablebasesAbstract
|
21
|
{
|
22
|
private final int mGodsNumber;
|
23
|
|
24
|
private PruningTable[] mHighTables;
|
25
|
private PruningTable[] mMidTables;
|
26
|
private int mLowestHigh, mHighestMid, mLowestMid;
|
27
|
|
28
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
29
|
|
30
|
abstract int[] getMidPruningLevels();
|
31
|
abstract int[] getHighPruningLevels();
|
32
|
abstract int getGodsNumber();
|
33
|
abstract boolean moveCanProceed(int lastA, int lastL, int currA, int currL);
|
34
|
|
35
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
36
|
|
37
|
private PruningTable createPruningTable(OperatingSystemInterface os, int id)
|
38
|
{
|
39
|
InputStream stream = os.openLocalFile(id);
|
40
|
ByteArrayOutputStream buffer = new ByteArrayOutputStream();
|
41
|
|
42
|
int nRead;
|
43
|
byte[] tmp = new byte[16384];
|
44
|
|
45
|
try
|
46
|
{
|
47
|
while ((nRead = stream.read(tmp, 0, tmp.length)) != -1)
|
48
|
{
|
49
|
buffer.write(tmp, 0, nRead);
|
50
|
}
|
51
|
stream.close();
|
52
|
byte[] data = buffer.toByteArray();
|
53
|
buffer.close();
|
54
|
return new PruningTable(data);
|
55
|
}
|
56
|
catch(IOException ex)
|
57
|
{
|
58
|
mInitialized = false;
|
59
|
return null;
|
60
|
}
|
61
|
}
|
62
|
|
63
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
64
|
|
65
|
public TablebasesPruning()
|
66
|
{
|
67
|
super();
|
68
|
mGodsNumber = getGodsNumber();
|
69
|
mInitialized = false;
|
70
|
}
|
71
|
|
72
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
73
|
|
74
|
public TablebasesPruning(OperatingSystemInterface os, int[] midIDs, int[] highIDs)
|
75
|
{
|
76
|
super();
|
77
|
|
78
|
int mid = midIDs !=null ? midIDs.length : 0;
|
79
|
int high= highIDs!=null ? highIDs.length : 0;
|
80
|
|
81
|
mMidTables = mid >0 ? new PruningTable[mid] : null;
|
82
|
mHighTables= high>0 ? new PruningTable[high]: null;
|
83
|
mGodsNumber = getGodsNumber();
|
84
|
mInitialized = true;
|
85
|
|
86
|
for(int i=0; i<mid ; i++) mMidTables[i] = createPruningTable(os,midIDs[i] );
|
87
|
for(int i=0; i<high; i++) mHighTables[i]= createPruningTable(os,highIDs[i]);
|
88
|
|
89
|
computeLowHigh();
|
90
|
}
|
91
|
|
92
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
93
|
|
94
|
public byte[][] getPacked()
|
95
|
{
|
96
|
if( !mInitialized )
|
97
|
{
|
98
|
int[] midLevels = getMidPruningLevels();
|
99
|
int numMidLevels= midLevels!=null ? midLevels.length : 0;
|
100
|
int[] highLevels = getHighPruningLevels();
|
101
|
int numHighLevels= highLevels!=null ? highLevels.length : 0;
|
102
|
int maxLevel = 0;
|
103
|
|
104
|
if( highLevels!=null )
|
105
|
{
|
106
|
for( int l : highLevels )
|
107
|
if( l>maxLevel ) maxLevel = l;
|
108
|
}
|
109
|
else
|
110
|
{
|
111
|
if( midLevels!=null )
|
112
|
for( int l : midLevels )
|
113
|
if( l>maxLevel ) maxLevel = l;
|
114
|
}
|
115
|
|
116
|
createTablebase(maxLevel);
|
117
|
mMidTables = numMidLevels >0 ? new PruningTable[numMidLevels ] : null;
|
118
|
mHighTables= numHighLevels>0 ? new PruningTable[numHighLevels] : null;
|
119
|
|
120
|
for(int i=0; i<numMidLevels; i++)
|
121
|
mMidTables[i] = new PruningTable(mTablebase,midLevels[i]);
|
122
|
for(int i=0; i<numHighLevels; i++)
|
123
|
mHighTables[i] = new PruningTable(mTablebase,highLevels[i]);
|
124
|
|
125
|
computeLowHigh();
|
126
|
|
127
|
mInitialized = true;
|
128
|
}
|
129
|
|
130
|
int midNum = mMidTables !=null ? mMidTables.length : 0;
|
131
|
int highNum = mHighTables!=null ? mHighTables.length : 0;
|
132
|
byte[][] data = new byte[midNum+highNum][];
|
133
|
|
134
|
for(int i=0; i<midNum ; i++) data[i ] = mMidTables[i].getPacked();
|
135
|
for(int i=0; i<highNum; i++) data[i+midNum] = mHighTables[i].getPacked();
|
136
|
|
137
|
return data;
|
138
|
}
|
139
|
|
140
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
141
|
|
142
|
private void computeLowHigh()
|
143
|
{
|
144
|
mLowestHigh = mGodsNumber+1;
|
145
|
int numHigh = mHighTables==null ? 0 : mHighTables.length;
|
146
|
|
147
|
for( int i=0; i<numHigh; i++ )
|
148
|
{
|
149
|
int level = mHighTables[i].getLevel();
|
150
|
if( i==0 || level<mLowestHigh ) mLowestHigh=level;
|
151
|
}
|
152
|
|
153
|
mLowestMid = 0;
|
154
|
mHighestMid= 0;
|
155
|
int numMid = mMidTables==null ? 0 : mMidTables.length;
|
156
|
|
157
|
for( int i=0; i<numMid; i++ )
|
158
|
{
|
159
|
int level = mMidTables[i].getLevel();
|
160
|
if( i==0 || level<mLowestMid ) mLowestMid =level;
|
161
|
if( i==0 || level>mHighestMid ) mHighestMid=level;
|
162
|
}
|
163
|
}
|
164
|
|
165
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
166
|
|
167
|
public int traverseDownTable(int index, PruningTable[] tables, int tableIndex, int lastA, int lastR, int[] move, int[] tmpQuats)
|
168
|
{
|
169
|
int[] quats = getQuats(index);
|
170
|
int numQuats = quats.length;
|
171
|
|
172
|
move[0]=0;
|
173
|
move[1]=0;
|
174
|
move[2]=1;
|
175
|
move[3]=1;
|
176
|
|
177
|
for(int ax=0; ax<mNumAxis; ax++)
|
178
|
for(int cubit=0; cubit<mNumCubits; cubit++)
|
179
|
mRotRow[cubit][ax] = computeRow(mPosition[cubit],quats[cubit],ax);
|
180
|
|
181
|
for(int s=0; s<mScalingFactor; s++)
|
182
|
{
|
183
|
int ax = move[0];
|
184
|
int layer = move[1];
|
185
|
int quat = move[3];
|
186
|
|
187
|
if( mRotatable[ax][layer] && moveCanProceed(lastA,lastR,move[0],move[1]) )
|
188
|
{
|
189
|
int bitLayer = computeBitLayer(ax,layer);
|
190
|
System.arraycopy(quats, 0, tmpQuats, 0, numQuats);
|
191
|
|
192
|
for(int cubit=0; cubit<mNumCubits; cubit++)
|
193
|
if( (mRotRow[cubit][ax] & bitLayer) != 0 )
|
194
|
{
|
195
|
int currQuat = tmpQuats[cubit];
|
196
|
int newQuat = getMultQuat(quat,currQuat);
|
197
|
tmpQuats[cubit] = newQuat;
|
198
|
}
|
199
|
|
200
|
int childIndex = getIndex(tmpQuats);
|
201
|
|
202
|
if( tableIndex>0 )
|
203
|
{
|
204
|
if( tables[tableIndex-1].contains(childIndex) ) return childIndex;
|
205
|
}
|
206
|
else if( !tables[0].contains(childIndex) )
|
207
|
{
|
208
|
if( tables.length<=1 || !tables[1].contains(childIndex) ) return childIndex;
|
209
|
}
|
210
|
}
|
211
|
|
212
|
getNextAxisLayerAngleQuat(move);
|
213
|
}
|
214
|
|
215
|
return -1;
|
216
|
}
|
217
|
|
218
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
219
|
|
220
|
private int traversePruningBlock(int[][] moves, PruningTable[] tables, int tableIndex, int index, int lastA, int lastR)
|
221
|
{
|
222
|
int movesIndex = 1;
|
223
|
int[] move, tmpQuats = new int[mNumCubits];
|
224
|
|
225
|
do
|
226
|
{
|
227
|
move = moves[movesIndex++];
|
228
|
index = traverseDownTable(index,tables,tableIndex,lastA,lastR,move,tmpQuats);
|
229
|
lastA = move[0];
|
230
|
lastR = move[1];
|
231
|
tableIndex--;
|
232
|
}
|
233
|
while( tableIndex>=0 );
|
234
|
|
235
|
return index;
|
236
|
}
|
237
|
|
238
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
239
|
// ret: [0][] --> (new index,new depth,?,?) ; [1...N-1][] --> moves. (or null if index not in High)
|
240
|
|
241
|
private int[][] traverseBlock(int index, PruningTable[] tables, int lastA, int lastR)
|
242
|
{
|
243
|
int num = (tables==null) ? 0 : tables.length;
|
244
|
int tableIndex = -1;
|
245
|
|
246
|
for( int i=0; i<num; i++ )
|
247
|
if( tables[i].contains(index) )
|
248
|
{
|
249
|
tableIndex = i;
|
250
|
break;
|
251
|
}
|
252
|
|
253
|
if( tableIndex<0 ) return null;
|
254
|
|
255
|
int[][] ret = new int[tableIndex+2][4];
|
256
|
ret[0][1] = tables[0].getLevel()-1;
|
257
|
ret[0][0] = traversePruningBlock(ret,tables,tableIndex,index,lastA, lastR);
|
258
|
|
259
|
return ret;
|
260
|
}
|
261
|
|
262
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
263
|
|
264
|
private int midTablesContain(int index)
|
265
|
{
|
266
|
int num = mMidTables.length;
|
267
|
|
268
|
for( int i=0; i<num; i++ )
|
269
|
if( mMidTables[i].contains(index) )
|
270
|
return i;
|
271
|
|
272
|
return -1;
|
273
|
}
|
274
|
|
275
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
276
|
|
277
|
private boolean jumpMidSolvedRecursive(int[] quats, int jump, int depth, int lastA, int lastR, int[][] solution)
|
278
|
{
|
279
|
int numQuats = quats.length;
|
280
|
int[] move = solution[depth];
|
281
|
int[] tmp = new int[mNumCubits];
|
282
|
int[][] rotRow= new int[mNumCubits][mNumAxis];
|
283
|
|
284
|
move[0]=0;
|
285
|
move[1]=0;
|
286
|
move[2]=1;
|
287
|
move[3]=1;
|
288
|
|
289
|
for(int ax=0; ax<mNumAxis; ax++)
|
290
|
for(int cubit=0; cubit<mNumCubits; cubit++)
|
291
|
rotRow[cubit][ax] = computeRow(mPosition[cubit],quats[cubit],ax);
|
292
|
|
293
|
for(int s=0; s<mScalingFactor; s++)
|
294
|
{
|
295
|
int ax = move[0];
|
296
|
int layer = move[1];
|
297
|
int quat = move[3];
|
298
|
|
299
|
if( mRotatable[ax][layer] && moveCanProceed(lastA,lastR,ax,layer) )
|
300
|
{
|
301
|
int bitLayer = computeBitLayer(ax,layer);
|
302
|
System.arraycopy(quats, 0, tmp, 0, numQuats);
|
303
|
|
304
|
for(int cubit=0; cubit<mNumCubits; cubit++)
|
305
|
if( (rotRow[cubit][ax] & bitLayer) != 0 )
|
306
|
{
|
307
|
int currQuat = tmp[cubit];
|
308
|
int newQuat = getMultQuat(quat,currQuat);
|
309
|
tmp[cubit] = newQuat;
|
310
|
}
|
311
|
|
312
|
int childIndex = getIndex(tmp);
|
313
|
|
314
|
if( isSolved(childIndex) )
|
315
|
{
|
316
|
solution[0][0] = childIndex;
|
317
|
solution[0][1] = 0;
|
318
|
return true;
|
319
|
}
|
320
|
|
321
|
int containingTable = midTablesContain(childIndex);
|
322
|
|
323
|
if( containingTable>=0 )
|
324
|
{
|
325
|
solution[0][0] = childIndex;
|
326
|
solution[0][1] = mMidTables[containingTable].getLevel();
|
327
|
return true;
|
328
|
}
|
329
|
|
330
|
if( jump>1 && jumpMidSolvedRecursive(tmp, jump-1, depth+1, ax, layer, solution) )
|
331
|
{
|
332
|
return true;
|
333
|
}
|
334
|
}
|
335
|
|
336
|
getNextAxisLayerAngleQuat(move);
|
337
|
}
|
338
|
|
339
|
return false;
|
340
|
}
|
341
|
|
342
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
343
|
// ret: [0][] --> (new index,new depth,num moves,?) ; [1...N-1][] --> moves.
|
344
|
|
345
|
private int[][] jumpToMidOrSolved(int index, int maxJump, int lastA, int lastR)
|
346
|
{
|
347
|
if( midTablesContain(index)>=0 ) return null;
|
348
|
|
349
|
int[][] solution = new int[maxJump+1][4];
|
350
|
int[] quats = getQuats(index);
|
351
|
|
352
|
for(int i=1; i<=maxJump; i++)
|
353
|
if( jumpMidSolvedRecursive(quats,i,1,lastA,lastR,solution) )
|
354
|
{
|
355
|
solution[0][2] = i;
|
356
|
return solution;
|
357
|
}
|
358
|
|
359
|
return null;
|
360
|
}
|
361
|
|
362
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
363
|
|
364
|
private boolean jumpToSolvedRecursive(int[] quats, int jump, int depth, int lastA, int lastR, int[][] solution)
|
365
|
{
|
366
|
int numQuats = quats.length;
|
367
|
int[] move = solution[depth];
|
368
|
int[] tmp = new int[mNumCubits];
|
369
|
int[][]rotRow= new int[mNumCubits][mNumAxis];
|
370
|
|
371
|
move[0]=0;
|
372
|
move[1]=0;
|
373
|
move[2]=1;
|
374
|
move[3]=1;
|
375
|
|
376
|
for(int ax=0; ax<mNumAxis; ax++)
|
377
|
for(int cubit=0; cubit<mNumCubits; cubit++)
|
378
|
rotRow[cubit][ax] = computeRow(mPosition[cubit],quats[cubit],ax);
|
379
|
|
380
|
for(int s=0; s<mScalingFactor; s++)
|
381
|
{
|
382
|
int ax = move[0];
|
383
|
int layer = move[1];
|
384
|
int quat = move[3];
|
385
|
|
386
|
if( mRotatable[ax][layer] && moveCanProceed(lastA,lastR,move[0],move[1]) )
|
387
|
{
|
388
|
int bitLayer = computeBitLayer(ax,layer);
|
389
|
System.arraycopy(quats, 0, tmp, 0, numQuats);
|
390
|
|
391
|
for(int cubit=0; cubit<mNumCubits; cubit++)
|
392
|
if( (rotRow[cubit][ax] & bitLayer) != 0 )
|
393
|
{
|
394
|
int currQuat = tmp[cubit];
|
395
|
int newQuat = getMultQuat(quat,currQuat);
|
396
|
tmp[cubit] = newQuat;
|
397
|
}
|
398
|
|
399
|
int childIndex = getIndex(tmp);
|
400
|
if( isSolved(childIndex) ) return true;
|
401
|
if( jump>1 && jumpToSolvedRecursive(tmp, jump-1, depth+1, ax, layer, solution) ) return true;
|
402
|
}
|
403
|
|
404
|
getNextAxisLayerAngleQuat(move);
|
405
|
}
|
406
|
|
407
|
return false;
|
408
|
}
|
409
|
|
410
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
411
|
// ret: [0][] --> (numMoves,old depth,?,?) ; [1...N-1][] --> moves.
|
412
|
|
413
|
private int[][] jumpToSolved(int index, int maxJump, int lastA, int lastR)
|
414
|
{
|
415
|
int[][] solution = new int[maxJump+1][4];
|
416
|
int[] quats = getQuats(index);
|
417
|
|
418
|
for(int i=1; i<=maxJump; i++)
|
419
|
if( jumpToSolvedRecursive(quats,i,1,lastA,lastR,solution) )
|
420
|
{
|
421
|
solution[0][0] = i;
|
422
|
return solution;
|
423
|
}
|
424
|
|
425
|
return null;
|
426
|
}
|
427
|
|
428
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
429
|
|
430
|
private int[][] concatenateMoves(int[][] high, int[][] jump1, int[][] mid, int[][] jump2)
|
431
|
{
|
432
|
int len1 = high ==null ? 0 : high.length-1;
|
433
|
int len2 = jump1==null ? 0 : jump1[0][2];
|
434
|
int len3 = mid ==null ? 0 : mid.length-1;
|
435
|
int len4 = jump2==null ? 0 : jump2[0][0];
|
436
|
|
437
|
int[][] moves = new int[len1+len2+len3+len4][];
|
438
|
int index = 0;
|
439
|
|
440
|
for(int i=0; i<len1; i++) moves[index++] = high[i+1];
|
441
|
for(int i=0; i<len2; i++) moves[index++] = jump1[i+1];
|
442
|
for(int i=0; i<len3; i++) moves[index++] = mid[i+1];
|
443
|
for(int i=0; i<len4; i++) moves[index++] = jump2[i+1];
|
444
|
|
445
|
convertMoves(moves);
|
446
|
|
447
|
return moves;
|
448
|
}
|
449
|
|
450
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
451
|
|
452
|
public int[][] solution(int index, int[] extra, OperatingSystemInterface osi)
|
453
|
{
|
454
|
if( isSolved(index) ) return null;
|
455
|
int lastA=-1, lastR=0;
|
456
|
int[][] highMoves = traverseBlock(index,mHighTables,lastA,lastR);
|
457
|
|
458
|
if( highMoves!=null )
|
459
|
{
|
460
|
index = highMoves[0][0];
|
461
|
int len = highMoves.length;
|
462
|
lastA = highMoves[len-1][0];
|
463
|
lastR = highMoves[len-1][1];
|
464
|
}
|
465
|
|
466
|
int maxJump = Math.max(mLowestHigh-1-mHighestMid,mLowestMid/2);
|
467
|
int[][] jump1Moves = jumpToMidOrSolved(index,maxJump,lastA,lastR);
|
468
|
|
469
|
if( jump1Moves!=null )
|
470
|
{
|
471
|
if( isSolved(jump1Moves[0][0]) )
|
472
|
{
|
473
|
return concatenateMoves(null,jump1Moves,null,null);
|
474
|
}
|
475
|
if( jump1Moves[0][1]==mLowestMid )
|
476
|
{
|
477
|
int[][] jump2Moves = jumpToSolved(index,mLowestMid-1,-1,0);
|
478
|
if( jump2Moves==null )
|
479
|
{
|
480
|
if( osi!=null ) osi.reportError("1 error jumping to Solved: "+index);
|
481
|
return null;
|
482
|
}
|
483
|
return concatenateMoves(null,null,null,jump2Moves);
|
484
|
}
|
485
|
|
486
|
index = jump1Moves[0][0];
|
487
|
int len = jump1Moves[0][2];
|
488
|
lastA = jump1Moves[len][0];
|
489
|
lastR = jump1Moves[len][1];
|
490
|
}
|
491
|
|
492
|
int[][] midMoves = traverseBlock(index,mMidTables,lastA,lastR);
|
493
|
if( midMoves!=null )
|
494
|
{
|
495
|
index = midMoves[0][0];
|
496
|
int len = midMoves.length;
|
497
|
lastA = midMoves[len-1][0];
|
498
|
lastR = midMoves[len-1][1];
|
499
|
}
|
500
|
else
|
501
|
{
|
502
|
if( osi!=null ) osi.reportError("error traversing mid Tables: "+index);
|
503
|
return null;
|
504
|
}
|
505
|
int[][] jump2Moves = jumpToSolved(index,mLowestMid-1,lastA,lastR);
|
506
|
if( jump2Moves==null )
|
507
|
{
|
508
|
if( osi!=null ) osi.reportError("2 error jumping to Solved: "+index);
|
509
|
return null;
|
510
|
}
|
511
|
return concatenateMoves(highMoves,jump1Moves,midMoves,jump2Moves);
|
512
|
}
|
513
|
}
|