Revision 15d1f6ad
Added by Leszek Koltunski about 1 year ago
src/main/java/org/distorted/objectlib/tablebases/TablebasesMITM.java | ||
---|---|---|
23 | 23 |
private boolean mInitialized; |
24 | 24 |
private int[] mLevels; |
25 | 25 |
|
26 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
27 |
|
|
28 |
abstract int[] getPruningLevels(); |
|
29 |
|
|
26 | 30 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
27 | 31 |
|
28 | 32 |
private void createPruningTable(Resources res, int id, int index) |
... | ... | |
72 | 76 |
for(int i=0; i<numOfIDs; i++) createPruningTable(res,resourceIDs[i],i); |
73 | 77 |
} |
74 | 78 |
|
79 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
80 |
|
|
81 |
public byte[][] getPacked() |
|
82 |
{ |
|
83 |
int[] levels = getPruningLevels(); |
|
84 |
int numLevels = levels.length; |
|
85 |
int maxLevel = 0; |
|
86 |
|
|
87 |
for( int l : levels ) |
|
88 |
if( l>maxLevel ) maxLevel = l; |
|
89 |
|
|
90 |
createTablebase(maxLevel); |
|
91 |
|
|
92 |
byte[][] data = new byte[numLevels][]; |
|
93 |
|
|
94 |
for(int i=0; i<numLevels; i++) |
|
95 |
{ |
|
96 |
PruningTable table = new PruningTable(mTablebase,levels[i]); |
|
97 |
data[i] = table.getPacked(); |
|
98 |
} |
|
99 |
|
|
100 |
return data; |
|
101 |
} |
|
102 |
|
|
75 | 103 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
76 | 104 |
|
77 | 105 |
public int[][] solution(int index, int[] extra) |
Also available in: Unified diff
creation of PruningTables.