Magic Cube

///////////////////////////////////////////////////////////////////////////////////////////////////

// Copyright 2023 Leszek Koltunski                                                               //

//                                                                                               //

// This file is part of Magic Cube.                                                              //

//                                                                                               //

// Magic Cube is proprietary software licensed under an EULA which you should have received      //

// along with the code. If not, check https://distorted.org/magic/License-Magic-Cube.html        //

///////////////////////////////////////////////////////////////////////////////////////////////////

package org.distorted.solvers;

import android.content.res.Resources;

import org.distorted.main.R;

import org.distorted.objectlib.helpers.OperatingSystemInterface;

import org.distorted.objectlib.main.ObjectSignatures;

import org.distorted.objectlib.main.TwistyObject;

import org.distorted.objectlib.tablebases.ImplementedTablebasesList;

import org.distorted.objectlib.tablebases.TBCuboid323;

import org.distorted.objectlib.tablebases.TablebaseHelpers;

import org.distorted.objectlib.tablebases.TablebasesAbstract;

///////////////////////////////////////////////////////////////////////////////////////////////////

public class SolverCuboid323 extends SolverTablebase

{

  private static final int ERROR_CORNER_MISSING = -1;

  private static final int ERROR_EDGE_MISSING   = -2;

  private static final int ERROR_CORNERS_CANNOT = -3;

  private static final int ERROR_EDGE_TWISTED   = -4;

  private static final int ERROR_CORNER_TWISTED = -5;

  TablebasesAbstract mSolver;

  private final int[] mFaceColors;

  private int mErrorColor1, mErrorColor2, mErrorColor3;

  private boolean mUpper;

///////////////////////////////////////////////////////////////////////////////////////////////////

// true or false, depending on if the 'half-fixed' front edge is in its place or not.

// if the 'half-fixed' edge is the upped front one (i.e. mUpper==true) than it can be in its

// place or not; if mUpper==false it always must be in its place.

  private boolean isFrontEdgeInItsPlace(int[][] edges)

    {

    return (!mUpper || edges[3][1]==mFaceColors[2]);

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  public SolverCuboid323(OperatingSystemInterface os, Resources res, TwistyObject object)

    {

    super(os,res,object);

    mFaceColors = new int[6];

    }

////////////////////////////////////////////////////////////////////////////////////////

  private int findCorner(int[][] corners, int c1, int c2)

    {

    for(int i=0; i<8; i++)

      {

      int[] c = corners[i];

      if( c[0]==c1 && c[1]==c2 ) return c[2];

      if( c[1]==c1 && c[2]==c2 ) return c[0];

      if( c[2]==c1 && c[0]==c2 ) return c[1];

      }

    return ERROR_CORNERS_CANNOT;

    }

////////////////////////////////////////////////////////////////////////////////////////

  private int missingColor()

    {

    boolean[] present = new boolean[6];

    for(int i=0; i<5; i++) present[mFaceColors[i]] = true;

    int indexFalse = -1;

    for(int i=0; i<6; i++)

      if( !present[i] )

        {

        if( indexFalse<0 ) indexFalse=i;

        else return ERROR_CORNERS_CANNOT;

        }

    return indexFalse;

    }

////////////////////////////////////////////////////////////////////////////////////////

  private int edgePresent(int[][] edges, int f0, int f1)

    {

    int c0 = mFaceColors[f0];

    int c1 = mFaceColors[f1];

    for(int i=0; i<8; i++ )

      {

      int[] edge = edges[i];

      if( edge[0]==c0 && edge[1]==c1 ) return i;

      if( edge[0]==c1 && edge[1]==c0 )

        {

        mErrorColor1 = c0;

        mErrorColor2 = c1;

        return ERROR_EDGE_TWISTED;

        }

      }

    mErrorColor1 = c0;

    mErrorColor2 = c1;

    return ERROR_EDGE_MISSING;

    }

////////////////////////////////////////////////////////////////////////////////////////

  private int cornerPresent(int[][] corners, int f0, int f1, int f2)

    {

    int c0 = mFaceColors[f0];

    int c1 = mFaceColors[f1];

    int c2 = mFaceColors[f2];

    for(int i=0; i<8; i++)

      {

      int[] corner = corners[i];

      if(  corner[0]==c0 && corner[1]==c1 && corner[2]==c2 ) return i;

      if( (corner[0]==c1 && corner[1]==c2 && corner[2]==c0 ) ||

          (corner[0]==c2 && corner[1]==c0 && corner[2]==c1 )  )

        {

        mErrorColor1 = c0;

        mErrorColor2 = c1;

        mErrorColor3 = c2;

        return ERROR_CORNER_TWISTED;

        }

      }

    mErrorColor1 = c0;

    mErrorColor2 = c1;

    mErrorColor3 = c2;

    return ERROR_CORNER_MISSING;

    }

////////////////////////////////////////////////////////////////////////////////////////

  private int retEdgePermutation(int[] output, int[][] edges)

    {

    int[][] e = { {5,3}, {4,3}, {5,2}, {4,2}, {1,3}, {1,2}, {0,3}, {0,2} };

    for(int i=0; i<8; i++)

      {

      int[] ee = e[i];

      output[i] = edgePresent(edges,ee[0],ee[1]);

      if( output[i]<0 ) return output[i];

      }

    return 0;

    }

////////////////////////////////////////////////////////////////////////////////////////

  private int retCornerPermutation(int[] output, int[][] corners)

    {

    int[][] c = { {5,1,3}, {1,4,3}, {1,5,2}, {4,1,2}, {0,5,3}, {4,0,3}, {5,0,2}, {0,4,2} };

    for(int i=0; i<8; i++)

      {

      int[] cc = c[i];

      output[i] = cornerPresent(corners,cc[0],cc[1],cc[2]);

      if( output[i]<0 ) return output[i];

      }

    return 0;

    }

////////////////////////////////////////////////////////////////////////////////////////

  private int computeFaceColors(int[][] corners, int[][] edges, int[] centers)

    {

    mFaceColors[2] = centers[0];

    mFaceColors[3] = centers[1];

    if( edges[1][1]==mFaceColors[2] )

      {

      mUpper = true;

      mFaceColors[4] = edges[1][0];

      }

    else if( edges[3][1]==mFaceColors[2] )

      {

      mUpper = true;

      mFaceColors[4] = edges[3][0];

      }

    else

      {

      mUpper = false;

      mFaceColors[4] = edges[3][0];

      }

    mFaceColors[0] = findCorner(corners,mFaceColors[4],mFaceColors[2]);

    if( mFaceColors[0]<0 ) return mFaceColors[0];

    mFaceColors[1] = findCorner(corners,mFaceColors[2],mFaceColors[4]);

    if( mFaceColors[1]<0 ) return mFaceColors[1];

    mFaceColors[5] = missingColor();

    if( mFaceColors[5]<0 ) return mFaceColors[5];

    return 0;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private void getCorners(TwistyObject object, int[][] corners)

    {

    corners[0][0] = object.getCubitFaceStickerIndex(0,5);

    corners[0][1] = object.getCubitFaceStickerIndex(0,1);

    corners[0][2] = object.getCubitFaceStickerIndex(0,3);

    corners[1][0] = object.getCubitFaceStickerIndex(1,3);

    corners[1][1] = object.getCubitFaceStickerIndex(1,5);

    corners[1][2] = object.getCubitFaceStickerIndex(1,1);

    corners[2][0] = object.getCubitFaceStickerIndex(2,5);

    corners[2][1] = object.getCubitFaceStickerIndex(2,1);

    corners[2][2] = object.getCubitFaceStickerIndex(2,3);

    corners[3][0] = object.getCubitFaceStickerIndex(3,5);

    corners[3][1] = object.getCubitFaceStickerIndex(3,1);

    corners[3][2] = object.getCubitFaceStickerIndex(3,3);

    corners[4][0] = object.getCubitFaceStickerIndex(4,1);

    corners[4][1] = object.getCubitFaceStickerIndex(4,3);

    corners[4][2] = object.getCubitFaceStickerIndex(4,5);

    corners[5][0] = object.getCubitFaceStickerIndex(5,5);

    corners[5][1] = object.getCubitFaceStickerIndex(5,1);

    corners[5][2] = object.getCubitFaceStickerIndex(5,3);

    corners[6][0] = object.getCubitFaceStickerIndex(6,5);

    corners[6][1] = object.getCubitFaceStickerIndex(6,1);

    corners[6][2] = object.getCubitFaceStickerIndex(6,3);

    corners[7][0] = object.getCubitFaceStickerIndex(7,1);

    corners[7][1] = object.getCubitFaceStickerIndex(7,3);

    corners[7][2] = object.getCubitFaceStickerIndex(7,5);

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private void getEdges(TwistyObject object, int[][] edges)

    {

    edges[0][0] = object.getCubitFaceStickerIndex(8,5);

    edges[0][1] = object.getCubitFaceStickerIndex(8,3);

    edges[1][0] = object.getCubitFaceStickerIndex(9,3);

    edges[1][1] = object.getCubitFaceStickerIndex(9,5);

    edges[2][0] = object.getCubitFaceStickerIndex(10,3);

    edges[2][1] = object.getCubitFaceStickerIndex(10,5);

    edges[3][0] = object.getCubitFaceStickerIndex(11,5);

    edges[3][1] = object.getCubitFaceStickerIndex(11,3);

    edges[4][0] = object.getCubitFaceStickerIndex(12,3);

    edges[4][1] = object.getCubitFaceStickerIndex(12,5);

    edges[5][0] = object.getCubitFaceStickerIndex(13,5);

    edges[5][1] = object.getCubitFaceStickerIndex(13,3);

    edges[6][0] = object.getCubitFaceStickerIndex(14,3);

    edges[6][1] = object.getCubitFaceStickerIndex(14,5);

    edges[7][0] = object.getCubitFaceStickerIndex(15,5);

    edges[7][1] = object.getCubitFaceStickerIndex(15,3);

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private void getCenters(TwistyObject object, int[] centers)

    {

    centers[0] = object.getCubitFaceStickerIndex(16,4);

    centers[1] = object.getCubitFaceStickerIndex(17,4);

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  public int tablebaseIndex(TwistyObject object)

    {

    int[][] corners= new int[8][3];

    int[][] edges  = new int[8][2];

    int[] centers  = new int[2];

    getCorners(object,corners);

    getEdges(object,edges);

    getCenters(object,centers);

//for(int i=0; i<8; i++) android.util.Log.e("D", "corner: "+i+" : "+corners[i][0]+" "+corners[i][1]+" "+corners[i][2]);

//for(int i=0; i<8; i++) android.util.Log.e("D", "edge: "+i+" : "+edges[i][0]+" "+edges[i][1]);

    int result0 = computeFaceColors(corners, edges, centers);

    if( result0<0 ) return result0;

    int[] corner_perm = new int[8];

    int result1 = retCornerPermutation(corner_perm,corners);

    if( result1<0 ) return result1;

//android.util.Log.e("D", "upper: "+mUpper);

//for(int i=0; i<6; i++) android.util.Log.e("D", "face color: "+mFaceColors[i]);

    int[] edge_perm = new int[8];

    int result2 = retEdgePermutation(edge_perm,edges);

    if( result2<0 ) return result2;

//    TablebaseHelpers.displayTable(corner_perm, "CORNER PERM");

//    TablebaseHelpers.displayTable(edge_perm, "EDGE PERM");

    int[] edge_perm2 = TBCuboid323.edgePermTo7(edge_perm,mUpper); // edge1 (lower) or edge3 (upper) is fixed!

    int corner_perm_num = TablebaseHelpers.computePermutationNum(corner_perm);

    int edge_perm_num = TablebaseHelpers.computePermutationNum(edge_perm2);

    boolean inPlace = isFrontEdgeInItsPlace(edges);

//android.util.Log.e("D", "corner_perm_num: "+corner_perm_num+" edge_perm_num: "+edge_perm_num+" inPlace: "+inPlace);

//android.util.Log.e("D", "index="+(corner_perm_num + 40320*( (inPlace?0:1) + 2*edge_perm_num)));

    TBCuboid323.setUpper(mUpper, mUpper^inPlace);

    return corner_perm_num + 40320*( (inPlace?0:1) + 2*edge_perm_num);

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private int getColorIndex4(int color)

    {

    switch(color)

      {

      case 0: return R.string.color_yellow4;

      case 1: return R.string.color_white4;

      case 2: return R.string.color_blue4;

      case 3: return R.string.color_green4;

      case 4: return R.string.color_red4;

      case 5: return R.string.color_orange4;

      }

    return -1;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private int getColorIndex3(int color)

    {

    switch(color)

      {

      case 0: return R.string.color_yellow3;

      case 1: return R.string.color_white3;

      case 2: return R.string.color_blue3;

      case 3: return R.string.color_green3;

      case 4: return R.string.color_red3;

      case 5: return R.string.color_orange3;

      }

    return -1;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private int getColorIndex5(int color)

    {

    switch(color)

      {

      case 0: return R.string.color_yellow5;

      case 1: return R.string.color_white5;

      case 2: return R.string.color_blue5;

      case 3: return R.string.color_green5;

      case 4: return R.string.color_red5;

      case 5: return R.string.color_orange5;

      }

    return -1;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private int getColorIndex6(int color)

    {

    switch(color)

      {

      case 0: return R.string.color_yellow6;

      case 1: return R.string.color_white6;

      case 2: return R.string.color_blue6;

      case 3: return R.string.color_green6;

      case 4: return R.string.color_red6;

      case 5: return R.string.color_orange6;

      }

    return -1;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private String edgeTwistedError(Resources res, int color0, int color1)

    {

    int j0 = getColorIndex3(color0);

    int j1 = getColorIndex6(color1);

    String c0 = res.getString(j0);

    String c1 = res.getString(j1);

    return res.getString(R.string.solver_generic_twisted_edge,c0,c1);

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private String cornerTwistedError(Resources res, int color0, int color1, int color2)

    {

    int j0 = getColorIndex3(color0);

    int j1 = getColorIndex3(color1);

    int j2 = getColorIndex5(color2);

    String c0 = res.getString(j0);

    String c1 = res.getString(j1);

    String c2 = res.getString(j2);

    return res.getString(R.string.solver_generic_twisted_corner,c0,c1,c2);

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private String edgeMissingError(Resources res, int color0, int color1)

    {

    int j0 = getColorIndex3(color0);

    int j1 = getColorIndex6(color1);

    String c0 = res.getString(j0);

    String c1 = res.getString(j1);

    return res.getString(R.string.solver_generic_missing_edge,c0,c1);

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  private String cornerMissingError(Resources res, int color0, int color1, int color2)

    {

    int j0 = getColorIndex3(color0);

    int j1 = getColorIndex3(color1);

    int j2 = getColorIndex4(color2);

    String c0 = res.getString(j0);

    String c1 = res.getString(j1);

    String c2 = res.getString(j2);

    return res.getString(R.string.solver_generic_missing_corner,c0,c1,c2);

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  public String error(int index, Resources res)

    {

    switch(index)

      {

      case ERROR_CORNER_MISSING : return cornerMissingError(res,mErrorColor1,mErrorColor2,mErrorColor3);

      case ERROR_EDGE_MISSING   : return edgeMissingError(res,mErrorColor1,mErrorColor2);

      case ERROR_CORNERS_CANNOT : return res.getString(R.string.solver_generic_corners_cannot);

      case ERROR_EDGE_TWISTED   : return edgeTwistedError(res,mErrorColor1,mErrorColor2);

      case ERROR_CORNER_TWISTED : return cornerTwistedError(res,mErrorColor1,mErrorColor2,mErrorColor3);

      }

    return null;

    }

///////////////////////////////////////////////////////////////////////////////////////////////////

  public int[][] solution(int index, OperatingSystemInterface os)

    {

    if( mSolver==null )

      {

      mSolver = ImplementedTablebasesList.createPacked(os,ObjectSignatures.CU_323);

      //mSolver = ImplementedTablebasesList.createUnpacked(ObjectSignatures.CU_323);

      //if( mSolver!=null ) mSolver.test();

      }

    return mSolver!=null ? mSolver.solution(index,null,os) : null;

    }

}