| 1 |
f0336037
|
Leszek Koltunski
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 2 |
|
|
// Copyright 2020 Leszek Koltunski //
|
| 3 |
|
|
// //
|
| 4 |
|
|
// This file is part of Magic Cube. //
|
| 5 |
|
|
// //
|
| 6 |
|
|
// Magic Cube is free software: you can redistribute it and/or modify //
|
| 7 |
|
|
// it under the terms of the GNU General Public License as published by //
|
| 8 |
|
|
// the Free Software Foundation, either version 2 of the License, or //
|
| 9 |
|
|
// (at your option) any later version. //
|
| 10 |
|
|
// //
|
| 11 |
|
|
// Magic Cube is distributed in the hope that it will be useful, //
|
| 12 |
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of //
|
| 13 |
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the //
|
| 14 |
|
|
// GNU General Public License for more details. //
|
| 15 |
|
|
// //
|
| 16 |
|
|
// You should have received a copy of the GNU General Public License //
|
| 17 |
|
|
// along with Magic Cube. If not, see <http://www.gnu.org/licenses/>. //
|
| 18 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 19 |
|
|
|
| 20 |
|
|
package org.distorted.solvers;
|
| 21 |
|
|
|
| 22 |
|
|
import android.content.res.Resources;
|
| 23 |
|
|
|
| 24 |
3f7a4363
|
Leszek Koltunski
|
import org.distorted.objectlib.main.ObjectList;
|
| 25 |
|
|
import org.distorted.objectlib.main.TwistyObject;
|
| 26 |
|
|
|
| 27 |
f0336037
|
Leszek Koltunski
|
import org.distorted.main.R;
|
| 28 |
fcd5b990
|
Leszek Koltunski
|
import org.distorted.screens.ScreenList;
|
| 29 |
|
|
import org.distorted.screens.RubikScreenSolver;
|
| 30 |
f0336037
|
Leszek Koltunski
|
|
| 31 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 32 |
|
|
|
| 33 |
a304ee64
|
Leszek Koltunski
|
public class SolverMain implements Runnable
|
| 34 |
f0336037
|
Leszek Koltunski
|
{
|
| 35 |
c494476f
|
Leszek Koltunski
|
private final Resources mRes;
|
| 36 |
ecf3f149
|
Leszek Koltunski
|
private final TwistyObject mObject;
|
| 37 |
f0336037
|
Leszek Koltunski
|
|
| 38 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 39 |
|
|
|
| 40 |
ecf3f149
|
Leszek Koltunski
|
public SolverMain(Resources res, TwistyObject object)
|
| 41 |
f0336037
|
Leszek Koltunski
|
{
|
| 42 |
ecf3f149
|
Leszek Koltunski
|
mRes = res;
|
| 43 |
|
|
mObject= object;
|
| 44 |
f0336037
|
Leszek Koltunski
|
}
|
| 45 |
|
|
|
| 46 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 47 |
46a961fd
|
Leszek Koltunski
|
// certain objects have certain cubits locked - for example, the Cube3's centers of
|
| 48 |
|
|
// sides always have the same color.
|
| 49 |
|
|
// If a certain cubit is locked, return the color (index into it's FACE_COLORS array) it
|
| 50 |
|
|
// must have. Otherwise return -1.
|
| 51 |
|
|
|
| 52 |
9c2f0c91
|
Leszek Koltunski
|
public static int cubitIsLocked(ObjectList object, int size, int cubit)
|
| 53 |
46a961fd
|
Leszek Koltunski
|
{
|
| 54 |
9c2f0c91
|
Leszek Koltunski
|
if( object == ObjectList.CUBE && size == 3)
|
| 55 |
46a961fd
|
Leszek Koltunski
|
{
|
| 56 |
|
|
if( cubit==21 ) return 0; // center of the right face
|
| 57 |
|
|
if( cubit== 4 ) return 1; // center of the left face
|
| 58 |
|
|
if( cubit==15 ) return 2; // center of the up face
|
| 59 |
|
|
if( cubit==10 ) return 3; // center of the bottom face
|
| 60 |
|
|
if( cubit==13 ) return 4; // center of the front face
|
| 61 |
|
|
if( cubit==12 ) return 5; // center of the back face
|
| 62 |
|
|
}
|
| 63 |
|
|
|
| 64 |
|
|
return -1;
|
| 65 |
|
|
}
|
| 66 |
|
|
|
| 67 |
|
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 68 |
f0336037
|
Leszek Koltunski
|
|
| 69 |
fcd5b990
|
Leszek Koltunski
|
private void solveCube3(RubikScreenSolver solver)
|
| 70 |
f0336037
|
Leszek Koltunski
|
{
|
| 71 |
373fa45f
|
Leszek Koltunski
|
String result;
|
| 72 |
|
|
|
| 73 |
|
|
if( !org.distorted.solvers.cube3.Search.prepare(mRes) )
|
| 74 |
|
|
result= "Error 9";
|
| 75 |
|
|
else
|
| 76 |
ecf3f149
|
Leszek Koltunski
|
{
|
| 77 |
|
|
String objectPosition = prepareCube3position();
|
| 78 |
|
|
result = org.distorted.solvers.cube3.Search.solution(objectPosition, 24, 20);
|
| 79 |
|
|
}
|
| 80 |
373fa45f
|
Leszek Koltunski
|
|
| 81 |
|
|
if (result.contains("Error"))
|
| 82 |
|
|
{
|
| 83 |
|
|
switch (result.charAt(result.length() - 1))
|
| 84 |
|
|
{
|
| 85 |
|
|
case '1': result = mRes.getString(R.string.solver_cube3_error1); break;
|
| 86 |
|
|
case '2': result = mRes.getString(R.string.solver_cube3_error2); break;
|
| 87 |
|
|
case '3': result = mRes.getString(R.string.solver_cube3_error3); break;
|
| 88 |
|
|
case '4': result = mRes.getString(R.string.solver_cube3_error4); break;
|
| 89 |
|
|
case '5': result = mRes.getString(R.string.solver_cube3_error5); break;
|
| 90 |
|
|
case '6': result = mRes.getString(R.string.solver_cube3_error6); break;
|
| 91 |
|
|
case '7': result = mRes.getString(R.string.solver_cube3_error7); break;
|
| 92 |
|
|
case '8': result = mRes.getString(R.string.solver_cube3_error8); break;
|
| 93 |
|
|
case '9': result = mRes.getString(R.string.solver_cube3_error9); break;
|
| 94 |
|
|
}
|
| 95 |
|
|
|
| 96 |
|
|
solver.displayErrorDialog(result);
|
| 97 |
|
|
}
|
| 98 |
|
|
else
|
| 99 |
|
|
{
|
| 100 |
|
|
solver.setSolved(result);
|
| 101 |
|
|
}
|
| 102 |
f0336037
|
Leszek Koltunski
|
}
|
| 103 |
|
|
|
| 104 |
ecf3f149
|
Leszek Koltunski
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 105 |
|
|
// order: Up --> Right --> Front --> Down --> Left --> Back
|
| 106 |
|
|
// (because the first implemented Solver - the two-phase Cube3 one - expects such order)
|
| 107 |
|
|
//
|
| 108 |
|
|
// Solved 3x3x3 Cube maps to "UUUUUUUUURRRRRRRRRFFFFFFFFFDDDDDDDDDLLLLLLLLLBBBBBBBBB"
|
| 109 |
|
|
//
|
| 110 |
|
|
// s : size of the cube; let index = a*s + b (i.e. a,b = row,column)
|
| 111 |
|
|
//
|
| 112 |
|
|
// Up : index --> b<s-1 ? (s-1)*(s+4b)+a : 6*s*s -13*s +8 +a
|
| 113 |
|
|
// Right : index --> 6*s*s - 12*s + 7 - index
|
| 114 |
|
|
// Front : index --> if b==0 : s*s - 1 - index
|
| 115 |
|
|
// if b==s-1: 6*s*s -11*s +6 - index
|
| 116 |
|
|
// else
|
| 117 |
|
|
// a==0: s*s + s-1 + 4*(b-1)*(s-1) + 2*(s-2) + s
|
| 118 |
|
|
// else: s*s + s-1 + 4*(b-1)*(s-1) + 2*(s-1-a)
|
| 119 |
|
|
// Down : index --> b==0 ? (s-1-a) : s*s + s-1 + 4*(b-1)*(s-1) - a
|
| 120 |
|
|
// Left : index --> (s-1-a)*s + b
|
| 121 |
|
|
// Back : index --> if b==s-1: s*(s-1-a)
|
| 122 |
|
|
// if b==0 : 5*s*s -12*s + 8 + (s-1-a)*s
|
| 123 |
|
|
// else
|
| 124 |
|
|
// if a==s-1: s*s + 4*(s-2-b)*(s-1)
|
| 125 |
|
|
// else : s*s + 4*(s-2-b)*(s-1) + s + (s-2-a)*2
|
| 126 |
|
|
|
| 127 |
|
|
private String prepareCube3position()
|
| 128 |
|
|
{
|
| 129 |
|
|
StringBuilder objectString = new StringBuilder();
|
| 130 |
|
|
int layers = mObject.getNumLayers();
|
| 131 |
|
|
int len = layers*layers;
|
| 132 |
|
|
int cubitIndex, row, col, color,face;
|
| 133 |
|
|
|
| 134 |
|
|
final int RIGHT= 0;
|
| 135 |
|
|
final int LEFT = 1;
|
| 136 |
|
|
final int UP = 2;
|
| 137 |
|
|
final int DOWN = 3;
|
| 138 |
|
|
final int FRONT= 4;
|
| 139 |
|
|
final int BACK = 5;
|
| 140 |
|
|
|
| 141 |
|
|
// 'I' - interior, theoretically can happen
|
| 142 |
|
|
final char[] FACE_NAMES = { 'R', 'L', 'U', 'D', 'F', 'B', 'I'};
|
| 143 |
|
|
|
| 144 |
|
|
face = UP;
|
| 145 |
|
|
|
| 146 |
|
|
for(int i=0; i<len; i++)
|
| 147 |
|
|
{
|
| 148 |
|
|
row = i/layers;
|
| 149 |
|
|
col = i%layers;
|
| 150 |
|
|
|
| 151 |
|
|
cubitIndex = col<layers-1 ? (layers-1)*(layers+4*col) + row : 6*layers*layers - 13*layers + 8 + row;
|
| 152 |
|
|
color = mObject.getCubitFaceColorIndex(cubitIndex,face);
|
| 153 |
|
|
objectString.append(FACE_NAMES[color]);
|
| 154 |
|
|
}
|
| 155 |
|
|
|
| 156 |
|
|
face = RIGHT;
|
| 157 |
|
|
|
| 158 |
|
|
for(int i=0; i<len; i++)
|
| 159 |
|
|
{
|
| 160 |
|
|
cubitIndex = 6*layers*layers - 12*layers +7 - i;
|
| 161 |
|
|
color = mObject.getCubitFaceColorIndex(cubitIndex,face);
|
| 162 |
|
|
objectString.append(FACE_NAMES[color]);
|
| 163 |
|
|
}
|
| 164 |
|
|
|
| 165 |
|
|
face = FRONT;
|
| 166 |
|
|
|
| 167 |
|
|
for(int i=0; i<len; i++)
|
| 168 |
|
|
{
|
| 169 |
|
|
row = i/layers;
|
| 170 |
|
|
col = i%layers;
|
| 171 |
|
|
|
| 172 |
|
|
if( col==layers-1 ) cubitIndex = 6*layers*layers - 11*layers + 6 -i;
|
| 173 |
|
|
else if( col==0 ) cubitIndex = layers*layers - 1 - i;
|
| 174 |
|
|
else
|
| 175 |
|
|
{
|
| 176 |
|
|
if( row==0 ) cubitIndex = layers*layers + layers-1 + 4*(col-1)*(layers-1) + 2*(layers-2) + layers;
|
| 177 |
|
|
else cubitIndex = layers*layers + layers-1 + 4*(col-1)*(layers-1) + 2*(layers-1-row);
|
| 178 |
|
|
}
|
| 179 |
|
|
|
| 180 |
|
|
color = mObject.getCubitFaceColorIndex(cubitIndex,face);
|
| 181 |
|
|
objectString.append(FACE_NAMES[color]);
|
| 182 |
|
|
}
|
| 183 |
|
|
|
| 184 |
|
|
face = DOWN;
|
| 185 |
|
|
|
| 186 |
|
|
for(int i=0; i<len; i++)
|
| 187 |
|
|
{
|
| 188 |
|
|
row = i/layers;
|
| 189 |
|
|
col = i%layers;
|
| 190 |
|
|
|
| 191 |
|
|
cubitIndex = col==0 ? layers-1-row : layers*layers + layers-1 + 4*(col-1)*(layers-1) - row;
|
| 192 |
|
|
color = mObject.getCubitFaceColorIndex(cubitIndex,face);
|
| 193 |
|
|
objectString.append(FACE_NAMES[color]);
|
| 194 |
|
|
}
|
| 195 |
|
|
|
| 196 |
|
|
face = LEFT;
|
| 197 |
|
|
|
| 198 |
|
|
for(int i=0; i<len; i++)
|
| 199 |
|
|
{
|
| 200 |
|
|
row = i/layers;
|
| 201 |
|
|
col = i%layers;
|
| 202 |
|
|
|
| 203 |
|
|
cubitIndex = (layers-1-row)*layers + col;
|
| 204 |
|
|
color = mObject.getCubitFaceColorIndex(cubitIndex,face);
|
| 205 |
|
|
objectString.append(FACE_NAMES[color]);
|
| 206 |
|
|
}
|
| 207 |
|
|
|
| 208 |
|
|
face = BACK;
|
| 209 |
|
|
|
| 210 |
|
|
for(int i=0; i<len; i++)
|
| 211 |
|
|
{
|
| 212 |
|
|
row = i/layers;
|
| 213 |
|
|
col = i%layers;
|
| 214 |
|
|
|
| 215 |
|
|
if( col==layers-1 ) cubitIndex = layers*(layers-1-row);
|
| 216 |
|
|
else if( col==0 ) cubitIndex = 5*layers*layers - 12*layers + 8 + (layers-1-row)*layers;
|
| 217 |
|
|
else
|
| 218 |
|
|
{
|
| 219 |
|
|
if( row==layers-1 ) cubitIndex = layers*layers + 4*(layers-2-col)*(layers-1);
|
| 220 |
|
|
else cubitIndex = layers*layers + 4*(layers-2-col)*(layers-1) + layers + 2*(layers-2-row);
|
| 221 |
|
|
}
|
| 222 |
|
|
|
| 223 |
|
|
color = mObject.getCubitFaceColorIndex(cubitIndex,face);
|
| 224 |
|
|
objectString.append(FACE_NAMES[color]);
|
| 225 |
|
|
}
|
| 226 |
|
|
|
| 227 |
|
|
return objectString.toString();
|
| 228 |
|
|
}
|
| 229 |
|
|
|
| 230 |
f0336037
|
Leszek Koltunski
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 231 |
|
|
|
| 232 |
373fa45f
|
Leszek Koltunski
|
private void interruptCube3()
|
| 233 |
f0336037
|
Leszek Koltunski
|
{
|
| 234 |
|
|
org.distorted.solvers.cube3.Search.interrupt();
|
| 235 |
|
|
}
|
| 236 |
|
|
|
| 237 |
373fa45f
|
Leszek Koltunski
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 238 |
|
|
|
| 239 |
|
|
public void start()
|
| 240 |
|
|
{
|
| 241 |
|
|
Thread thr = new Thread(this);
|
| 242 |
|
|
thr.start();
|
| 243 |
|
|
}
|
| 244 |
|
|
|
| 245 |
f0336037
|
Leszek Koltunski
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
| 246 |
|
|
|
| 247 |
|
|
public void run()
|
| 248 |
|
|
{
|
| 249 |
f5da732a
|
Leszek Koltunski
|
RubikScreenSolver solver = (RubikScreenSolver) ScreenList.SVER.getScreenClass();
|
| 250 |
f0336037
|
Leszek Koltunski
|
|
| 251 |
ecf3f149
|
Leszek Koltunski
|
if( mObject.getObjectList()==ObjectList.CUBE && mObject.getNumLayers()==3 )
|
| 252 |
f0336037
|
Leszek Koltunski
|
{
|
| 253 |
373fa45f
|
Leszek Koltunski
|
solveCube3(solver);
|
| 254 |
f0336037
|
Leszek Koltunski
|
}
|
| 255 |
|
|
else
|
| 256 |
|
|
{
|
| 257 |
373fa45f
|
Leszek Koltunski
|
solver.displayErrorDialog(mRes.getString(R.string.solver_generic_error1));
|
| 258 |
f0336037
|
Leszek Koltunski
|
}
|
| 259 |
|
|
}
|
| 260 |
|
|
}
|