Revision ef93065b
Added by Leszek Koltunski about 1 year ago
src/main/java/org/distorted/objectlib/tablebases/TBDino6.java | ||
---|---|---|
111 | 111 |
|
112 | 112 |
public static int getIndexFromPerm(int[] perm) |
113 | 113 |
{ |
114 |
return 0; |
|
114 |
int[] perm11 = new int[11]; |
|
115 |
for(int i=0; i<11; i++) perm11[i] = perm[i+1]-1; |
|
116 |
return TablebaseHelpers.computeEvenPermutationNum(perm11); |
|
117 |
} |
|
118 |
|
|
119 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
120 |
|
|
121 |
private int[] getPermFromQuats(int[] quats) |
|
122 |
{ |
|
123 |
return null; // TODO |
|
124 |
} |
|
125 |
|
|
126 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
|
127 |
|
|
128 |
private int[] getQuatsFromPerm(int[] perm) |
|
129 |
{ |
|
130 |
return null; // TODO |
|
115 | 131 |
} |
116 | 132 |
|
117 | 133 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
118 | 134 |
|
119 | 135 |
int[] getQuats(int index) |
120 | 136 |
{ |
121 |
return null; |
|
137 |
int[] perm11 = new int[11]; |
|
138 |
TablebaseHelpers.getEvenPermutationFromNum(perm11,index); |
|
139 |
int[] perm = new int[12]; |
|
140 |
for(int i=1; i<12; i++) perm[i] = perm11[i-1]+1; |
|
141 |
return getQuatsFromPerm(perm); |
|
122 | 142 |
} |
123 | 143 |
|
124 | 144 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
125 | 145 |
|
126 | 146 |
int getIndex(int[] quats) |
127 | 147 |
{ |
128 |
return 0; |
|
148 |
int[] perm = getPermFromQuats(quats); |
|
149 |
return getIndexFromPerm(perm); |
|
129 | 150 |
} |
130 | 151 |
} |
131 | 152 |
|
Also available in: Unified diff
Dino6 solver: 2 functions missing.