|
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.solvers;
|
|
11
|
|
|
12
|
import android.content.res.Resources;
|
|
13
|
|
|
14
|
import org.distorted.main.R;
|
|
15
|
import org.distorted.objectlib.main.ObjectType;
|
|
16
|
import org.distorted.objectlib.main.TwistyObject;
|
|
17
|
import org.distorted.objectlib.tablebases.ImplementedTablebasesList;
|
|
18
|
import org.distorted.objectlib.tablebases.TablebasesAbstract;
|
|
19
|
|
|
20
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
21
|
|
|
22
|
public class SolverPyraminx extends SolverTablebase
|
|
23
|
{
|
|
24
|
private static final int ERROR_CORNER_GYB_MISSING = -1;
|
|
25
|
private static final int ERROR_CORNER_GYR_MISSING = -2;
|
|
26
|
private static final int ERROR_CORNER_GBR_MISSING = -3;
|
|
27
|
private static final int ERROR_CORNER_YBR_MISSING = -4;
|
|
28
|
|
|
29
|
private static final int ERROR_VERTEX_GYB_MISSING = -5;
|
|
30
|
private static final int ERROR_VERTEX_GYR_MISSING = -6;
|
|
31
|
private static final int ERROR_VERTEX_GBR_MISSING = -7;
|
|
32
|
private static final int ERROR_VERTEX_YBR_MISSING = -8;
|
|
33
|
|
|
34
|
private static final int ERROR_EDGE_RB_MISSING = -9;
|
|
35
|
private static final int ERROR_EDGE_RY_MISSING = -10;
|
|
36
|
private static final int ERROR_EDGE_RG_MISSING = -11;
|
|
37
|
private static final int ERROR_EDGE_YB_MISSING = -12;
|
|
38
|
private static final int ERROR_EDGE_GB_MISSING = -13;
|
|
39
|
private static final int ERROR_EDGE_GY_MISSING = -14;
|
|
40
|
|
|
41
|
private static final int ERROR_CORNERS_CANNOT = -15;
|
|
42
|
private static final int ERROR_VERTICES_CANNOT = -16;
|
|
43
|
private static final int ERROR_CORNER_TWISTED = -17;
|
|
44
|
private static final int ERROR_EDGE_TWISTED = -18;
|
|
45
|
private static final int ERROR_C_V_DONT_MATCH = -19;
|
|
46
|
|
|
47
|
TablebasesAbstract mSolver;
|
|
48
|
|
|
49
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
50
|
|
|
51
|
private boolean pieceEqual3(int[] piece, int c1, int c2, int c3)
|
|
52
|
{
|
|
53
|
return ( (piece[0]==c1 && piece[1]==c2 && piece[2]==c3) ||
|
|
54
|
(piece[0]==c1 && piece[2]==c2 && piece[1]==c3) ||
|
|
55
|
(piece[1]==c1 && piece[0]==c2 && piece[2]==c3) ||
|
|
56
|
(piece[1]==c1 && piece[2]==c2 && piece[0]==c3) ||
|
|
57
|
(piece[2]==c1 && piece[1]==c2 && piece[0]==c3) ||
|
|
58
|
(piece[2]==c1 && piece[0]==c2 && piece[1]==c3) );
|
|
59
|
}
|
|
60
|
|
|
61
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
62
|
|
|
63
|
private boolean pieceEqual2(int[] piece, int c1, int c2)
|
|
64
|
{
|
|
65
|
return ( (piece[0]==c1 && piece[1]==c2) ||
|
|
66
|
(piece[0]==c2 && piece[1]==c1) );
|
|
67
|
}
|
|
68
|
|
|
69
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
70
|
|
|
71
|
private int checkAllCornersPresent(int[][] corners)
|
|
72
|
{
|
|
73
|
boolean ybr = false;
|
|
74
|
boolean gbr = false;
|
|
75
|
boolean gyr = false;
|
|
76
|
boolean gyb = false;
|
|
77
|
|
|
78
|
for(int i=0; i<4; i++)
|
|
79
|
{
|
|
80
|
if( pieceEqual3(corners[i],0,1,2) ) gyb = true;
|
|
81
|
if( pieceEqual3(corners[i],0,1,3) ) gyr = true;
|
|
82
|
if( pieceEqual3(corners[i],0,2,3) ) gbr = true;
|
|
83
|
if( pieceEqual3(corners[i],1,2,3) ) ybr = true;
|
|
84
|
}
|
|
85
|
|
|
86
|
if( !ybr ) return ERROR_CORNER_YBR_MISSING;
|
|
87
|
if( !gbr ) return ERROR_CORNER_GBR_MISSING;
|
|
88
|
if( !gyr ) return ERROR_CORNER_GYR_MISSING;
|
|
89
|
if( !gyb ) return ERROR_CORNER_GYB_MISSING;
|
|
90
|
|
|
91
|
return 0;
|
|
92
|
}
|
|
93
|
|
|
94
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
95
|
|
|
96
|
private int checkAllVerticesPresent(int[][] vertex)
|
|
97
|
{
|
|
98
|
boolean ybr = false;
|
|
99
|
boolean gbr = false;
|
|
100
|
boolean gyr = false;
|
|
101
|
boolean gyb = false;
|
|
102
|
|
|
103
|
for(int i=0; i<4; i++)
|
|
104
|
{
|
|
105
|
if( pieceEqual3(vertex[i],0,1,2) ) gyb = true;
|
|
106
|
if( pieceEqual3(vertex[i],0,1,3) ) gyr = true;
|
|
107
|
if( pieceEqual3(vertex[i],0,2,3) ) gbr = true;
|
|
108
|
if( pieceEqual3(vertex[i],1,2,3) ) ybr = true;
|
|
109
|
}
|
|
110
|
|
|
111
|
if( !ybr ) return ERROR_VERTEX_YBR_MISSING;
|
|
112
|
if( !gbr ) return ERROR_VERTEX_GBR_MISSING;
|
|
113
|
if( !gyr ) return ERROR_VERTEX_GYR_MISSING;
|
|
114
|
if( !gyb ) return ERROR_VERTEX_GYB_MISSING;
|
|
115
|
|
|
116
|
return 0;
|
|
117
|
}
|
|
118
|
|
|
119
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
120
|
|
|
121
|
private int checkAllEdgesPresent(int[][] edges)
|
|
122
|
{
|
|
123
|
boolean rb = false;
|
|
124
|
boolean ry = false;
|
|
125
|
boolean rg = false;
|
|
126
|
boolean yb = false;
|
|
127
|
boolean gb = false;
|
|
128
|
boolean gy = false;
|
|
129
|
|
|
130
|
for(int i=0; i<6; i++)
|
|
131
|
{
|
|
132
|
if( pieceEqual2(edges[i],3,2) ) rb = true;
|
|
133
|
if( pieceEqual2(edges[i],3,1) ) ry = true;
|
|
134
|
if( pieceEqual2(edges[i],3,0) ) rg = true;
|
|
135
|
if( pieceEqual2(edges[i],2,1) ) yb = true;
|
|
136
|
if( pieceEqual2(edges[i],2,0) ) gb = true;
|
|
137
|
if( pieceEqual2(edges[i],1,0) ) gy = true;
|
|
138
|
}
|
|
139
|
|
|
140
|
if( !rb ) return ERROR_EDGE_RB_MISSING;
|
|
141
|
if( !ry ) return ERROR_EDGE_RY_MISSING;
|
|
142
|
if( !rg ) return ERROR_EDGE_RG_MISSING;
|
|
143
|
if( !yb ) return ERROR_EDGE_YB_MISSING;
|
|
144
|
if( !gb ) return ERROR_EDGE_GB_MISSING;
|
|
145
|
if( !gy ) return ERROR_EDGE_GY_MISSING;
|
|
146
|
|
|
147
|
return 0;
|
|
148
|
}
|
|
149
|
|
|
150
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
151
|
|
|
152
|
private int[] computeFaceColors(int[][] corners)
|
|
153
|
{
|
|
154
|
int[] ret = new int[4];
|
|
155
|
|
|
156
|
for(int i=0; i<4; i++)
|
|
157
|
for(int j=0; j<4; j++)
|
|
158
|
if( corners[i][0]!=j && corners[i][1]!=j && corners[i][2]!=j ) ret[i]=j;
|
|
159
|
|
|
160
|
return ret;
|
|
161
|
}
|
|
162
|
|
|
163
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
164
|
|
|
165
|
private int checkAgreement(int[] faces1, int[] faces2)
|
|
166
|
{
|
|
167
|
for(int i=0; i<4; i++)
|
|
168
|
if( faces1[i]!=faces2[i] ) return ERROR_C_V_DONT_MATCH;
|
|
169
|
|
|
170
|
return 0;
|
|
171
|
}
|
|
172
|
|
|
173
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
174
|
|
|
175
|
private int computePieceTwist(int index, int[] corner, int[] faceColor)
|
|
176
|
{
|
|
177
|
int twist1=0, twist2=0, twist3=0;
|
|
178
|
|
|
179
|
switch(index)
|
|
180
|
{
|
|
181
|
case 0: if( corner[1]==faceColor[1] ) twist1=1;
|
|
182
|
if( corner[2]==faceColor[1] ) twist1=2;
|
|
183
|
if( corner[0]==faceColor[2] ) twist2=2;
|
|
184
|
if( corner[2]==faceColor[2] ) twist2=1;
|
|
185
|
if( corner[0]==faceColor[3] ) twist3=1;
|
|
186
|
if( corner[1]==faceColor[3] ) twist3=2;
|
|
187
|
break;
|
|
188
|
case 1: if( corner[1]==faceColor[0] ) twist1=1;
|
|
189
|
if( corner[2]==faceColor[0] ) twist1=2;
|
|
190
|
if( corner[0]==faceColor[2] ) twist2=1;
|
|
191
|
if( corner[1]==faceColor[2] ) twist2=2;
|
|
192
|
if( corner[0]==faceColor[3] ) twist3=2;
|
|
193
|
if( corner[2]==faceColor[3] ) twist3=1;
|
|
194
|
break;
|
|
195
|
case 2: if( corner[1]==faceColor[0] ) twist1=1;
|
|
196
|
if( corner[2]==faceColor[0] ) twist1=2;
|
|
197
|
if( corner[0]==faceColor[1] ) twist2=2;
|
|
198
|
if( corner[2]==faceColor[1] ) twist2=1;
|
|
199
|
if( corner[0]==faceColor[3] ) twist3=1;
|
|
200
|
if( corner[1]==faceColor[3] ) twist3=2;
|
|
201
|
break;
|
|
202
|
case 3: if( corner[1]==faceColor[0] ) twist1=1;
|
|
203
|
if( corner[2]==faceColor[0] ) twist1=2;
|
|
204
|
if( corner[0]==faceColor[1] ) twist2=1;
|
|
205
|
if( corner[1]==faceColor[1] ) twist2=2;
|
|
206
|
if( corner[0]==faceColor[2] ) twist3=2;
|
|
207
|
if( corner[2]==faceColor[2] ) twist3=1;
|
|
208
|
break;
|
|
209
|
}
|
|
210
|
|
|
211
|
return ( twist1!=twist2 || twist1!=twist3 ) ? -1 : twist1;
|
|
212
|
}
|
|
213
|
|
|
214
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
215
|
|
|
216
|
public SolverPyraminx(Resources res, TwistyObject object)
|
|
217
|
{
|
|
218
|
super(res,object);
|
|
219
|
}
|
|
220
|
|
|
221
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
222
|
|
|
223
|
private void getCorners(TwistyObject object, int[][] corners)
|
|
224
|
{
|
|
225
|
corners[0][0] = object.getCubitFaceStickerIndex(6,3); // R
|
|
226
|
corners[0][1] = object.getCubitFaceStickerIndex(6,2); // B
|
|
227
|
corners[0][2] = object.getCubitFaceStickerIndex(6,1); // Y
|
|
228
|
|
|
229
|
corners[1][0] = object.getCubitFaceStickerIndex(4,3); // R
|
|
230
|
corners[1][1] = object.getCubitFaceStickerIndex(4,0); // G
|
|
231
|
corners[1][2] = object.getCubitFaceStickerIndex(4,2); // B
|
|
232
|
|
|
233
|
corners[2][0] = object.getCubitFaceStickerIndex(13,3); // R
|
|
234
|
corners[2][1] = object.getCubitFaceStickerIndex(13,1); // Y
|
|
235
|
corners[2][2] = object.getCubitFaceStickerIndex(13,0); // G
|
|
236
|
|
|
237
|
corners[3][0] = object.getCubitFaceStickerIndex(11,0); // G
|
|
238
|
corners[3][1] = object.getCubitFaceStickerIndex(11,1); // Y
|
|
239
|
corners[3][2] = object.getCubitFaceStickerIndex(11,2); // B
|
|
240
|
}
|
|
241
|
|
|
242
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
243
|
|
|
244
|
private void getVertices(TwistyObject object, int[][] vertex)
|
|
245
|
{
|
|
246
|
vertex[0][0] = object.getCubitFaceStickerIndex(1,5); // R
|
|
247
|
vertex[0][1] = object.getCubitFaceStickerIndex(1,7); // B
|
|
248
|
vertex[0][2] = object.getCubitFaceStickerIndex(1,2); // Y
|
|
249
|
|
|
250
|
vertex[1][0] = object.getCubitFaceStickerIndex(0,5); // R
|
|
251
|
vertex[1][1] = object.getCubitFaceStickerIndex(0,0); // G
|
|
252
|
vertex[1][2] = object.getCubitFaceStickerIndex(0,7); // B
|
|
253
|
|
|
254
|
vertex[2][0] = object.getCubitFaceStickerIndex(3,5); // R
|
|
255
|
vertex[2][1] = object.getCubitFaceStickerIndex(3,2); // Y
|
|
256
|
vertex[2][2] = object.getCubitFaceStickerIndex(3,0); // G
|
|
257
|
|
|
258
|
vertex[3][0] = object.getCubitFaceStickerIndex(2,0); // G
|
|
259
|
vertex[3][1] = object.getCubitFaceStickerIndex(2,2); // Y
|
|
260
|
vertex[3][2] = object.getCubitFaceStickerIndex(2,7); // B
|
|
261
|
}
|
|
262
|
|
|
263
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
264
|
|
|
265
|
private void getEdges(TwistyObject object, int[][] edges)
|
|
266
|
{
|
|
267
|
edges[0][0] = object.getCubitFaceStickerIndex(5,3); // R
|
|
268
|
edges[0][1] = object.getCubitFaceStickerIndex(5,2); // B
|
|
269
|
|
|
270
|
edges[1][0] = object.getCubitFaceStickerIndex(10,3); // R
|
|
271
|
edges[1][1] = object.getCubitFaceStickerIndex(10,1); // Y
|
|
272
|
|
|
273
|
edges[2][0] = object.getCubitFaceStickerIndex(9,3); // R
|
|
274
|
edges[2][1] = object.getCubitFaceStickerIndex(9,0); // G
|
|
275
|
|
|
276
|
edges[3][0] = object.getCubitFaceStickerIndex(8,1); // Y
|
|
277
|
edges[3][1] = object.getCubitFaceStickerIndex(8,2); // B
|
|
278
|
|
|
279
|
edges[4][0] = object.getCubitFaceStickerIndex(7,0); // G
|
|
280
|
edges[4][1] = object.getCubitFaceStickerIndex(7,2); // B
|
|
281
|
|
|
282
|
edges[5][0] = object.getCubitFaceStickerIndex(12,0); // G
|
|
283
|
edges[5][1] = object.getCubitFaceStickerIndex(12,1); // Y
|
|
284
|
}
|
|
285
|
|
|
286
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
287
|
|
|
288
|
public int tablebaseIndex(TwistyObject object)
|
|
289
|
{
|
|
290
|
int[][] corners = new int[4][3];
|
|
291
|
int[][] edges = new int[6][2];
|
|
292
|
int[][] vertices= new int[4][3];
|
|
293
|
int[] corner_twist = new int[4];
|
|
294
|
int[] vertex_twist = new int[4];
|
|
295
|
|
|
296
|
getCorners(object,corners);
|
|
297
|
getVertices(object,vertices);
|
|
298
|
getEdges(object,edges);
|
|
299
|
|
|
300
|
int result1 = checkAllCornersPresent(corners);
|
|
301
|
if( result1<0 ) return result1;
|
|
302
|
|
|
303
|
int result2 = checkAllVerticesPresent(vertices);
|
|
304
|
if( result2<0 ) return result2;
|
|
305
|
|
|
306
|
int result3 = checkAllEdgesPresent(edges);
|
|
307
|
if( result3<0 ) return result3;
|
|
308
|
|
|
309
|
int[] faces1 = computeFaceColors(corners);
|
|
310
|
int[] faces2 = computeFaceColors(vertices);
|
|
311
|
|
|
312
|
int result4 = checkAgreement(faces1,faces2);
|
|
313
|
if( result4<0 ) return result4;
|
|
314
|
|
|
315
|
for(int i=0; i<4; i++)
|
|
316
|
{
|
|
317
|
corner_twist[i] = computePieceTwist(i,corners[i],faces1);
|
|
318
|
if( corner_twist[i]<0 ) return ERROR_CORNERS_CANNOT;
|
|
319
|
}
|
|
320
|
|
|
321
|
for(int i=0; i<4; i++)
|
|
322
|
{
|
|
323
|
vertex_twist[i] = computePieceTwist(i,vertices[i],faces1);
|
|
324
|
if( vertex_twist[i]<0 ) return ERROR_VERTICES_CANNOT;
|
|
325
|
}
|
|
326
|
|
|
327
|
return 0;
|
|
328
|
}
|
|
329
|
|
|
330
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
331
|
|
|
332
|
private int getColorIndex3(int color)
|
|
333
|
{
|
|
334
|
switch(color)
|
|
335
|
{
|
|
336
|
case 0: return R.string.color_green3;
|
|
337
|
case 1: return R.string.color_yellow3;
|
|
338
|
case 2: return R.string.color_blue3;
|
|
339
|
case 3: return R.string.color_red3;
|
|
340
|
}
|
|
341
|
|
|
342
|
return -1;
|
|
343
|
}
|
|
344
|
|
|
345
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
346
|
|
|
347
|
private int getColorIndex4(int color)
|
|
348
|
{
|
|
349
|
switch(color)
|
|
350
|
{
|
|
351
|
case 0: return R.string.color_green4;
|
|
352
|
case 1: return R.string.color_yellow4;
|
|
353
|
case 2: return R.string.color_blue4;
|
|
354
|
case 3: return R.string.color_red4;
|
|
355
|
}
|
|
356
|
|
|
357
|
return -1;
|
|
358
|
}
|
|
359
|
|
|
360
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
361
|
|
|
362
|
private int getColorIndex6(int color)
|
|
363
|
{
|
|
364
|
switch(color)
|
|
365
|
{
|
|
366
|
case 0: return R.string.color_green6;
|
|
367
|
case 1: return R.string.color_yellow6;
|
|
368
|
case 2: return R.string.color_blue6;
|
|
369
|
case 3: return R.string.color_red6;
|
|
370
|
}
|
|
371
|
|
|
372
|
return -1;
|
|
373
|
}
|
|
374
|
|
|
375
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
376
|
|
|
377
|
private String cornerError(Resources res, int color0, int color1, int color2)
|
|
378
|
{
|
|
379
|
int j0 = getColorIndex3(color0);
|
|
380
|
int j1 = getColorIndex3(color1);
|
|
381
|
int j2 = getColorIndex4(color2);
|
|
382
|
|
|
383
|
String c0 = res.getString(j0);
|
|
384
|
String c1 = res.getString(j1);
|
|
385
|
String c2 = res.getString(j2);
|
|
386
|
|
|
387
|
return res.getString(R.string.solver_generic_missing_corner,c0,c1,c2);
|
|
388
|
}
|
|
389
|
|
|
390
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
391
|
|
|
392
|
private String vertexError(Resources res, int color0, int color1, int color2)
|
|
393
|
{
|
|
394
|
int j0 = getColorIndex3(color0);
|
|
395
|
int j1 = getColorIndex3(color1);
|
|
396
|
int j2 = getColorIndex4(color2);
|
|
397
|
|
|
398
|
String c0 = res.getString(j0);
|
|
399
|
String c1 = res.getString(j1);
|
|
400
|
String c2 = res.getString(j2);
|
|
401
|
|
|
402
|
return res.getString(R.string.solver_generic_missing_vertex,c0,c1,c2);
|
|
403
|
}
|
|
404
|
|
|
405
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
406
|
|
|
407
|
private String edgeError(Resources res, int color0, int color1)
|
|
408
|
{
|
|
409
|
int j0 = getColorIndex3(color0);
|
|
410
|
int j1 = getColorIndex6(color1);
|
|
411
|
|
|
412
|
String c0 = res.getString(j0);
|
|
413
|
String c1 = res.getString(j1);
|
|
414
|
|
|
415
|
return res.getString(R.string.solver_generic_missing_edge,c0,c1);
|
|
416
|
}
|
|
417
|
|
|
418
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
419
|
|
|
420
|
public String error(int index, Resources res)
|
|
421
|
{
|
|
422
|
switch(index)
|
|
423
|
{
|
|
424
|
case ERROR_CORNER_YBR_MISSING: return cornerError(res,3,2,1);
|
|
425
|
case ERROR_CORNER_GBR_MISSING: return cornerError(res,3,2,0);
|
|
426
|
case ERROR_CORNER_GYR_MISSING: return cornerError(res,3,1,0);
|
|
427
|
case ERROR_CORNER_GYB_MISSING: return cornerError(res,2,1,0);
|
|
428
|
case ERROR_VERTEX_YBR_MISSING: return vertexError(res,3,2,1);
|
|
429
|
case ERROR_VERTEX_GBR_MISSING: return vertexError(res,3,2,0);
|
|
430
|
case ERROR_VERTEX_GYR_MISSING: return vertexError(res,3,1,0);
|
|
431
|
case ERROR_VERTEX_GYB_MISSING: return vertexError(res,2,1,0);
|
|
432
|
case ERROR_EDGE_RB_MISSING : return edgeError(res,3,2);
|
|
433
|
case ERROR_EDGE_RY_MISSING : return edgeError(res,3,1);
|
|
434
|
case ERROR_EDGE_RG_MISSING : return edgeError(res,3,0);
|
|
435
|
case ERROR_EDGE_YB_MISSING : return edgeError(res,2,1);
|
|
436
|
case ERROR_EDGE_GB_MISSING : return edgeError(res,2,0);
|
|
437
|
case ERROR_EDGE_GY_MISSING : return edgeError(res,1,0);
|
|
438
|
case ERROR_CORNER_TWISTED : return res.getString(R.string.solver_generic_corner_twist);
|
|
439
|
case ERROR_EDGE_TWISTED : return res.getString(R.string.solver_generic_edge_twist);
|
|
440
|
case ERROR_CORNERS_CANNOT : return res.getString(R.string.solver_generic_corners_cannot);
|
|
441
|
case ERROR_VERTICES_CANNOT : return res.getString(R.string.solver_generic_vertices_cannot);
|
|
442
|
case ERROR_C_V_DONT_MATCH : return res.getString(R.string.solver_generic_c_v_dont_match);
|
|
443
|
|
|
444
|
}
|
|
445
|
|
|
446
|
return null;
|
|
447
|
}
|
|
448
|
|
|
449
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
450
|
|
|
451
|
public int[][] solution(int index, Resources res)
|
|
452
|
{
|
|
453
|
if( mSolver==null )
|
|
454
|
{
|
|
455
|
//mSolver = ImplementedTablebasesList.createPacked(res,ObjectType.PYRA_3);
|
|
456
|
mSolver = ImplementedTablebasesList.createUnpacked(ObjectType.PYRA_3);
|
|
457
|
if( mSolver!=null ) mSolver.createTablebase();
|
|
458
|
}
|
|
459
|
|
|
460
|
return mSolver!=null ? mSolver.solution(index) : null;
|
|
461
|
}
|
|
462
|
}
|
|
463
|
|