|
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.TwistyObject;
|
|
16
|
import org.distorted.objectlib.tablebases.TablebasesPyraminxDuo;
|
|
17
|
|
|
18
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
19
|
|
|
20
|
public class SolverPyraminxDuo extends SolverTablebase
|
|
21
|
{
|
|
22
|
private static final int ERROR_CORNER_GYB_MISSING = -1;
|
|
23
|
private static final int ERROR_CORNER_GYR_MISSING = -2;
|
|
24
|
private static final int ERROR_CORNER_GBR_MISSING = -3;
|
|
25
|
private static final int ERROR_CORNER_YBR_MISSING = -4;
|
|
26
|
|
|
27
|
private static final int ERROR_CENTER_G_MISSING = -5;
|
|
28
|
private static final int ERROR_CENTER_Y_MISSING = -6;
|
|
29
|
private static final int ERROR_CENTER_B_MISSING = -7;
|
|
30
|
private static final int ERROR_CENTER_R_MISSING = -8;
|
|
31
|
|
|
32
|
private static final int ERROR_TWO_CENTERS_SWAP = -9;
|
|
33
|
private static final int ERROR_CORNER_TWISTED = -10;
|
|
34
|
|
|
35
|
private static final int ERROR_CORNERS_CANNOT = -11;
|
|
36
|
|
|
37
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
38
|
|
|
39
|
private boolean cornerEqual(int[] corner, int c1, int c2, int c3)
|
|
40
|
{
|
|
41
|
return ( (corner[0]==c1 && corner[1]==c2 && corner[2]==c3) ||
|
|
42
|
(corner[0]==c1 && corner[2]==c2 && corner[1]==c3) ||
|
|
43
|
(corner[1]==c1 && corner[0]==c2 && corner[2]==c3) ||
|
|
44
|
(corner[1]==c1 && corner[2]==c2 && corner[0]==c3) ||
|
|
45
|
(corner[2]==c1 && corner[1]==c2 && corner[0]==c3) ||
|
|
46
|
(corner[2]==c1 && corner[0]==c2 && corner[1]==c3) );
|
|
47
|
}
|
|
48
|
|
|
49
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
50
|
|
|
51
|
private int checkAllCornersPresent(int[][] corners)
|
|
52
|
{
|
|
53
|
boolean ybr = false;
|
|
54
|
boolean gbr = false;
|
|
55
|
boolean gyr = false;
|
|
56
|
boolean gyb = false;
|
|
57
|
|
|
58
|
for(int i=0; i<4; i++)
|
|
59
|
{
|
|
60
|
if( cornerEqual(corners[i],0,1,2) ) gyb = true;
|
|
61
|
if( cornerEqual(corners[i],0,1,3) ) gyr = true;
|
|
62
|
if( cornerEqual(corners[i],0,2,3) ) gbr = true;
|
|
63
|
if( cornerEqual(corners[i],1,2,3) ) ybr = true;
|
|
64
|
}
|
|
65
|
|
|
66
|
if( !ybr ) return ERROR_CORNER_YBR_MISSING;
|
|
67
|
if( !gbr ) return ERROR_CORNER_GBR_MISSING;
|
|
68
|
if( !gyr ) return ERROR_CORNER_GYR_MISSING;
|
|
69
|
if( !gyb ) return ERROR_CORNER_GYB_MISSING;
|
|
70
|
|
|
71
|
return 0;
|
|
72
|
}
|
|
73
|
|
|
74
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
75
|
|
|
76
|
private int checkAllCentersPresent(int[] centers)
|
|
77
|
{
|
|
78
|
if( centers[0]!=0 && centers[1]!=0 && centers[2]!=0 && centers[3]!=0 ) return ERROR_CENTER_G_MISSING;
|
|
79
|
if( centers[0]!=1 && centers[1]!=1 && centers[2]!=1 && centers[3]!=1 ) return ERROR_CENTER_Y_MISSING;
|
|
80
|
if( centers[0]!=2 && centers[1]!=2 && centers[2]!=2 && centers[3]!=2 ) return ERROR_CENTER_B_MISSING;
|
|
81
|
if( centers[0]!=3 && centers[1]!=3 && centers[2]!=3 && centers[3]!=3 ) return ERROR_CENTER_R_MISSING;
|
|
82
|
|
|
83
|
return 0;
|
|
84
|
}
|
|
85
|
|
|
86
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
87
|
|
|
88
|
private int getFaceOfGreenCenter(int[] centers)
|
|
89
|
{
|
|
90
|
if( centers[0]==0 ) return 0;
|
|
91
|
if( centers[1]==0 ) return 1;
|
|
92
|
if( centers[2]==0 ) return 2;
|
|
93
|
if( centers[3]==0 ) return 3;
|
|
94
|
|
|
95
|
return -1;
|
|
96
|
}
|
|
97
|
|
|
98
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
99
|
|
|
100
|
private int[] computeMissingCornerColor(int[][] corners)
|
|
101
|
{
|
|
102
|
int[] ret = new int[4];
|
|
103
|
|
|
104
|
for(int i=0; i<4; i++)
|
|
105
|
for(int j=0; j<4; j++)
|
|
106
|
if( corners[i][0]!=j && corners[i][1]!=j && corners[i][2]!=j ) ret[i]=j;
|
|
107
|
|
|
108
|
return ret;
|
|
109
|
}
|
|
110
|
|
|
111
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
112
|
|
|
113
|
private int computeCornerTwist(int index, int[] corner, int[] missing)
|
|
114
|
{
|
|
115
|
int twist1=0, twist2=0, twist3=0;
|
|
116
|
|
|
117
|
switch(index)
|
|
118
|
{
|
|
119
|
case 0: if( corner[1]==missing[1] ) twist1=1;
|
|
120
|
if( corner[2]==missing[1] ) twist1=2;
|
|
121
|
if( corner[0]==missing[2] ) twist2=2;
|
|
122
|
if( corner[2]==missing[2] ) twist2=1;
|
|
123
|
if( corner[0]==missing[3] ) twist3=1;
|
|
124
|
if( corner[1]==missing[3] ) twist3=2;
|
|
125
|
break;
|
|
126
|
case 1: if( corner[1]==missing[0] ) twist1=1;
|
|
127
|
if( corner[2]==missing[0] ) twist1=2;
|
|
128
|
if( corner[0]==missing[2] ) twist2=1;
|
|
129
|
if( corner[1]==missing[2] ) twist2=2;
|
|
130
|
if( corner[0]==missing[3] ) twist3=2;
|
|
131
|
if( corner[2]==missing[3] ) twist3=1;
|
|
132
|
break;
|
|
133
|
case 2: if( corner[1]==missing[0] ) twist1=1;
|
|
134
|
if( corner[2]==missing[0] ) twist1=2;
|
|
135
|
if( corner[0]==missing[1] ) twist2=2;
|
|
136
|
if( corner[2]==missing[1] ) twist2=1;
|
|
137
|
if( corner[0]==missing[3] ) twist3=1;
|
|
138
|
if( corner[1]==missing[3] ) twist3=2;
|
|
139
|
break;
|
|
140
|
case 3: if( corner[1]==missing[0] ) twist1=1;
|
|
141
|
if( corner[2]==missing[0] ) twist1=2;
|
|
142
|
if( corner[0]==missing[1] ) twist2=1;
|
|
143
|
if( corner[1]==missing[1] ) twist2=2;
|
|
144
|
if( corner[0]==missing[2] ) twist3=2;
|
|
145
|
if( corner[2]==missing[2] ) twist3=1;
|
|
146
|
break;
|
|
147
|
}
|
|
148
|
|
|
149
|
return ( twist1!=twist2 || twist1!=twist3 ) ? ERROR_CORNERS_CANNOT : twist1;
|
|
150
|
}
|
|
151
|
|
|
152
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
153
|
|
|
154
|
private int computeCenterTwist(int[] centers, int color1, int color2)
|
|
155
|
{
|
|
156
|
if( centers[0]==color1 )
|
|
157
|
{
|
|
158
|
if( centers[1]==color2 ) return 1;
|
|
159
|
if( centers[2]==color2 ) return 2;
|
|
160
|
if( centers[3]==color2 ) return 0;
|
|
161
|
|
|
162
|
return -1;
|
|
163
|
}
|
|
164
|
if( centers[1]==color1 )
|
|
165
|
{
|
|
166
|
if( centers[0]==color2 ) return 1;
|
|
167
|
if( centers[2]==color2 ) return 0;
|
|
168
|
if( centers[3]==color2 ) return 2;
|
|
169
|
|
|
170
|
return -1;
|
|
171
|
}
|
|
172
|
if( centers[2]==color1 )
|
|
173
|
{
|
|
174
|
if( centers[0]==color2 ) return 2;
|
|
175
|
if( centers[1]==color2 ) return 0;
|
|
176
|
if( centers[3]==color2 ) return 1;
|
|
177
|
|
|
178
|
return -1;
|
|
179
|
}
|
|
180
|
if( centers[3]==color1 )
|
|
181
|
{
|
|
182
|
if( centers[0]==color2 ) return 0;
|
|
183
|
if( centers[1]==color2 ) return 2;
|
|
184
|
if( centers[2]==color2 ) return 1;
|
|
185
|
|
|
186
|
return -1;
|
|
187
|
}
|
|
188
|
|
|
189
|
return -2;
|
|
190
|
}
|
|
191
|
|
|
192
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
193
|
|
|
194
|
public SolverPyraminxDuo(Resources res, TwistyObject object)
|
|
195
|
{
|
|
196
|
super(res,object);
|
|
197
|
}
|
|
198
|
|
|
199
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
200
|
|
|
201
|
public int tablebaseIndex(TwistyObject object)
|
|
202
|
{
|
|
203
|
int[][] corners = new int[4][3];
|
|
204
|
int[] centers = new int[4];
|
|
205
|
int[] corner_twist = new int[4];
|
|
206
|
|
|
207
|
for(int i=0; i<4; i++)
|
|
208
|
{
|
|
209
|
centers[i] = object.getCubitFaceStickerIndex(i+4,0) - 4;
|
|
210
|
|
|
211
|
for(int j=0; j<3; j++)
|
|
212
|
corners[i][j] = object.getCubitFaceStickerIndex(i,j);
|
|
213
|
}
|
|
214
|
|
|
215
|
int result1 = checkAllCornersPresent(corners);
|
|
216
|
if( result1<0 ) return result1;
|
|
217
|
|
|
218
|
int result2 = checkAllCentersPresent(centers);
|
|
219
|
if( result2<0 ) return result2;
|
|
220
|
|
|
221
|
int twist_gr = computeCenterTwist(centers,0,3);
|
|
222
|
int twist_ry = computeCenterTwist(centers,3,1);
|
|
223
|
|
|
224
|
if( (twist_ry-twist_gr+1)%3 != 0 ) return ERROR_TWO_CENTERS_SWAP;
|
|
225
|
|
|
226
|
int total_twist=0;
|
|
227
|
int[] missing = computeMissingCornerColor(corners);
|
|
228
|
|
|
229
|
for(int i=0; i<4; i++)
|
|
230
|
{
|
|
231
|
corner_twist[i] = computeCornerTwist(i,corners[i],missing);
|
|
232
|
if( corner_twist[i]<0 ) return corner_twist[i];
|
|
233
|
total_twist += corner_twist[i];
|
|
234
|
}
|
|
235
|
|
|
236
|
if( (total_twist-twist_gr)%3 !=0 ) return ERROR_CORNER_TWISTED;
|
|
237
|
|
|
238
|
int green_face = getFaceOfGreenCenter(centers);
|
|
239
|
|
|
240
|
return green_face + 4*(corner_twist[3] + 3*(corner_twist[2] + 3*(corner_twist[1] + 3*corner_twist[0])));
|
|
241
|
}
|
|
242
|
|
|
243
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
244
|
|
|
245
|
public String error(int index, Resources res)
|
|
246
|
{
|
|
247
|
switch(index)
|
|
248
|
{
|
|
249
|
case ERROR_CORNER_YBR_MISSING: String c01 = res.getString(R.string.color_yellow3);
|
|
250
|
String c02 = res.getString(R.string.color_blue3);
|
|
251
|
String c03 = res.getString(R.string.color_red4);
|
|
252
|
return res.getString(R.string.solver_generic_missing_corner,c01,c02,c03);
|
|
253
|
case ERROR_CORNER_GBR_MISSING: String c11 = res.getString(R.string.color_green3);
|
|
254
|
String c12 = res.getString(R.string.color_blue3);
|
|
255
|
String c13 = res.getString(R.string.color_red4);
|
|
256
|
return res.getString(R.string.solver_generic_missing_corner,c11,c12,c13);
|
|
257
|
case ERROR_CORNER_GYR_MISSING: String c21 = res.getString(R.string.color_green3);
|
|
258
|
String c22 = res.getString(R.string.color_yellow3);
|
|
259
|
String c23 = res.getString(R.string.color_red4);
|
|
260
|
return res.getString(R.string.solver_generic_missing_corner,c21,c22,c23);
|
|
261
|
case ERROR_CORNER_GYB_MISSING: String c31 = res.getString(R.string.color_green3);
|
|
262
|
String c32 = res.getString(R.string.color_yellow3);
|
|
263
|
String c33 = res.getString(R.string.color_blue4);
|
|
264
|
return res.getString(R.string.solver_generic_missing_corner,c31,c32,c33);
|
|
265
|
case ERROR_CENTER_G_MISSING : String colorG = res.getString(R.string.color_green2);
|
|
266
|
return res.getString(R.string.solver_generic_missing_center,colorG);
|
|
267
|
case ERROR_CENTER_Y_MISSING : String colorY = res.getString(R.string.color_yellow2);
|
|
268
|
return res.getString(R.string.solver_generic_missing_center,colorY);
|
|
269
|
case ERROR_CENTER_B_MISSING : String colorB = res.getString(R.string.color_blue2);
|
|
270
|
return res.getString(R.string.solver_generic_missing_center,colorB);
|
|
271
|
case ERROR_CENTER_R_MISSING : String colorR = res.getString(R.string.color_red2);
|
|
272
|
return res.getString(R.string.solver_generic_missing_center,colorR);
|
|
273
|
case ERROR_TWO_CENTERS_SWAP : return res.getString(R.string.solver_generic_two_centers);
|
|
274
|
case ERROR_CORNER_TWISTED : return res.getString(R.string.solver_generic_corner_twist);
|
|
275
|
case ERROR_CORNERS_CANNOT : return res.getString(R.string.solver_generic_corners_cannot);
|
|
276
|
}
|
|
277
|
|
|
278
|
return null;
|
|
279
|
}
|
|
280
|
|
|
281
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
282
|
|
|
283
|
public int[][] solution(int index, Resources res)
|
|
284
|
{
|
|
285
|
TablebasesPyraminxDuo tb = new TablebasesPyraminxDuo();
|
|
286
|
tb.createTablebase();
|
|
287
|
return tb.solution(index);
|
|
288
|
}
|
|
289
|
}
|
|
290
|
|