Project

General

Profile

Download (11.6 KB) Statistics
| Branch: | Tag: | Revision:

magiccube / src / main / java / org / distorted / solvers / SolverPyraminxDuo.java @ 185dd0a1

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