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.screens.RubikScreenSolver;
|
17
|
import org.distorted.solvers.cube3.SolverSearch;
|
18
|
|
19
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
20
|
|
21
|
public class SolverCube3
|
22
|
{
|
23
|
private final Resources mRes;
|
24
|
private final TwistyObject mObject;
|
25
|
private int mColorID;
|
26
|
|
27
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
28
|
|
29
|
private int mapCubitToFace(int cubit, int face)
|
30
|
{
|
31
|
if( cubit<8 )
|
32
|
{
|
33
|
switch(face)
|
34
|
{
|
35
|
case 0: return 1;
|
36
|
case 1: if( cubit==2 ) return 5;
|
37
|
if( cubit==1 ) return 3;
|
38
|
return 1;
|
39
|
case 2: return cubit==7 ? 5 : 3;
|
40
|
case 3: if( cubit==1 ) return 1;
|
41
|
return cubit==4 ? 5 : 3;
|
42
|
case 4: return cubit==7 ? 3 : 5;
|
43
|
case 5: if( cubit==2 ) return 1;
|
44
|
if( cubit==4 ) return 3;
|
45
|
return 5;
|
46
|
}
|
47
|
}
|
48
|
|
49
|
if( cubit>19 ) return 4;
|
50
|
|
51
|
switch(face)
|
52
|
{
|
53
|
case 0: return cubit==15 || cubit==18 ? 3 : 5;
|
54
|
case 1: return cubit==13 || cubit==16 ? 3 : 5;
|
55
|
case 2: return cubit==10 ? 5 : 3;
|
56
|
case 3: return cubit== 8 ? 3 : 5;
|
57
|
case 4: return cubit== 9 ? 3 : 5;
|
58
|
case 5: return cubit== 8 ? 5 : 3;
|
59
|
}
|
60
|
|
61
|
return -1;
|
62
|
}
|
63
|
|
64
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
65
|
|
66
|
private int checkPosition(String position)
|
67
|
{
|
68
|
int[] numColors = new int[6];
|
69
|
int len = position.length();
|
70
|
|
71
|
for(int i=0; i<len; i++)
|
72
|
{
|
73
|
char ch = position.charAt(i);
|
74
|
|
75
|
switch(ch)
|
76
|
{
|
77
|
case 'R': numColors[0]++; break;
|
78
|
case 'L': numColors[1]++; break;
|
79
|
case 'U': numColors[2]++; break;
|
80
|
case 'D': numColors[3]++; break;
|
81
|
case 'F': numColors[4]++; break;
|
82
|
case 'B': numColors[5]++; break;
|
83
|
}
|
84
|
}
|
85
|
|
86
|
if( numColors[0]<9 ) { mColorID = R.string.color_yellow1; return numColors[0]; }
|
87
|
if( numColors[1]<9 ) { mColorID = R.string.color_white1 ; return numColors[1]; }
|
88
|
if( numColors[2]<9 ) { mColorID = R.string.color_blue1 ; return numColors[2]; }
|
89
|
if( numColors[3]<9 ) { mColorID = R.string.color_green1 ; return numColors[3]; }
|
90
|
if( numColors[4]<9 ) { mColorID = R.string.color_red1 ; return numColors[4]; }
|
91
|
if( numColors[5]<9 ) { mColorID = R.string.color_orange1; return numColors[5]; }
|
92
|
|
93
|
return -1;
|
94
|
}
|
95
|
|
96
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
97
|
// order: Up --> Right --> Front --> Down --> Left --> Back
|
98
|
// (because the first implemented Solver - the two-phase Cube3 one - expects such order)
|
99
|
//
|
100
|
// Solved 3x3x3 Cube maps to "UUUUUUUUURRRRRRRRRFFFFFFFFFDDDDDDDDDLLLLLLLLLBBBBBBBBB"
|
101
|
|
102
|
private String preparePosition()
|
103
|
{
|
104
|
StringBuilder objectString = new StringBuilder();
|
105
|
|
106
|
final int R = 0;
|
107
|
final int L = 1;
|
108
|
final int U = 2;
|
109
|
final int D = 3;
|
110
|
final int F = 4;
|
111
|
final int B = 5;
|
112
|
|
113
|
// 'I' - interior, theoretically can happen
|
114
|
final char[] FACE_NAMES = { 'R', 'L', 'U', 'D', 'F', 'B', 'I'};
|
115
|
|
116
|
final int[] U_INDEX = { 2,10, 6,17,22,19, 3,11, 7};
|
117
|
final int[] R_INDEX = { 7,19, 6,15,20,14, 5,18, 4};
|
118
|
final int[] F_INDEX = { 3,11, 7,13,24,15, 1, 9, 5};
|
119
|
final int[] D_INDEX = { 1, 9, 5,16,23,18, 0, 8, 4};
|
120
|
final int[] L_INDEX = { 2,17, 3,12,21,13, 0,16, 1};
|
121
|
final int[] B_INDEX = { 6,10, 2,14,25,12, 4, 8, 0};
|
122
|
|
123
|
for(int i=0; i<9; i++)
|
124
|
{
|
125
|
int face = mapCubitToFace(U_INDEX[i],U);
|
126
|
int color = mObject.getCubitFaceStickerIndex(U_INDEX[i], face);
|
127
|
objectString.append(FACE_NAMES[color]);
|
128
|
}
|
129
|
for(int i=0; i<9; i++)
|
130
|
{
|
131
|
int face = mapCubitToFace(R_INDEX[i],R);
|
132
|
int color = mObject.getCubitFaceStickerIndex(R_INDEX[i], face);
|
133
|
objectString.append(FACE_NAMES[color]);
|
134
|
}
|
135
|
for(int i=0; i<9; i++)
|
136
|
{
|
137
|
int face = mapCubitToFace(F_INDEX[i],F);
|
138
|
int color = mObject.getCubitFaceStickerIndex(F_INDEX[i], face);
|
139
|
objectString.append(FACE_NAMES[color]);
|
140
|
}
|
141
|
for(int i=0; i<9; i++)
|
142
|
{
|
143
|
int face = mapCubitToFace(D_INDEX[i],D);
|
144
|
int color = mObject.getCubitFaceStickerIndex(D_INDEX[i], face);
|
145
|
objectString.append(FACE_NAMES[color]);
|
146
|
}
|
147
|
for(int i=0; i<9; i++)
|
148
|
{
|
149
|
int face = mapCubitToFace(L_INDEX[i],L);
|
150
|
int color = mObject.getCubitFaceStickerIndex(L_INDEX[i], face);
|
151
|
objectString.append(FACE_NAMES[color]);
|
152
|
}
|
153
|
for(int i=0; i<9; i++)
|
154
|
{
|
155
|
int face = mapCubitToFace(B_INDEX[i],B);
|
156
|
int color = mObject.getCubitFaceStickerIndex(B_INDEX[i], face);
|
157
|
objectString.append(FACE_NAMES[color]);
|
158
|
}
|
159
|
|
160
|
return objectString.toString();
|
161
|
}
|
162
|
|
163
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
164
|
// PUBLIC API
|
165
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
166
|
|
167
|
public SolverCube3(Resources res, TwistyObject object)
|
168
|
{
|
169
|
mRes = res;
|
170
|
mObject= object;
|
171
|
}
|
172
|
|
173
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
174
|
|
175
|
public void solve(RubikScreenSolver solver)
|
176
|
{
|
177
|
String result;
|
178
|
|
179
|
SolverSearch.prepare(mRes);
|
180
|
String objectPosition = preparePosition();
|
181
|
int check = checkPosition(objectPosition);
|
182
|
|
183
|
if( check<0 )
|
184
|
{
|
185
|
result = SolverSearch.solution(objectPosition, 24, 20);
|
186
|
|
187
|
if (result.contains("Error"))
|
188
|
{
|
189
|
switch (result.charAt(result.length() - 1))
|
190
|
{
|
191
|
case '1': result = mRes.getString(R.string.solver_cube3_error1); break;
|
192
|
case '2': result = mRes.getString(R.string.solver_cube3_error2); break;
|
193
|
case '3': result = mRes.getString(R.string.solver_cube3_error3); break;
|
194
|
case '4': result = mRes.getString(R.string.solver_cube3_error4); break;
|
195
|
case '5': result = mRes.getString(R.string.solver_generic_corner_twist); break;
|
196
|
case '6': result = mRes.getString(R.string.solver_cube3_error6); break;
|
197
|
case '7': result = mRes.getString(R.string.solver_cube3_error7); break;
|
198
|
case '8': result = mRes.getString(R.string.solver_cube3_error8); break;
|
199
|
case '9': result = mRes.getString(R.string.solver_cube3_error9); break;
|
200
|
}
|
201
|
|
202
|
solver.displayErrorDialog(result);
|
203
|
}
|
204
|
else
|
205
|
{
|
206
|
solver.setSolved(result);
|
207
|
}
|
208
|
}
|
209
|
else
|
210
|
{
|
211
|
String color = mRes.getString(mColorID);
|
212
|
result = mRes.getString(R.string.solver_cube3_error1,check,color);
|
213
|
solver.displayErrorDialog(result);
|
214
|
}
|
215
|
}
|
216
|
}
|
217
|
|