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.metadata.ListObjects;

import org.distorted.objectlib.main.TwistyObject;

import org.distorted.objectlib.shape.ShapeColors;

import org.distorted.objectlib.shape.ShapeHexahedron;

import org.distorted.objectlib.tablebases.ImplementedTablebasesList;

import org.distorted.objectlib.tablebases.TBDino4;

import org.distorted.objectlib.tablebases.TablebasesAbstract;

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

public class SolverDino4 extends SolverTablebase

{

  private static final int ERROR_EDGE_THREE  = -1;

  private TablebasesAbstract mSolver;

  private int mErrorColor;

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

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

    {

    super(os, res,object);

    }

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

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

    {

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

      {

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

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

      }

    }

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

  private int checkEdges(int[][] edges)

    {

    int numB=0,numR=0, numY=0, numW=0;

    int indB=0,indY=0, indW=0, indR=0;

    int[] hexColors = ShapeHexahedron.FACE_COLORS;

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

      {

      int color = hexColors[i];

      if( color == ShapeColors.COLOR_WHITE) indW = i;

      if( color == ShapeColors.COLOR_YELLOW) indY = i;

      if( color == ShapeColors.COLOR_RED) indR = i;

      if( color == ShapeColors.COLOR_BLUE) indB = i;

      }

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

      {

      int e = edges[0][i];

      if( e==edges[1][i] )

        {

        if( e==indY ) numY++;

        if( e==indW ) numW++;

        if( e==indR ) numR++;

        if( e==indB ) numB++;

        }

      }

    if( numY !=3 ) { mErrorColor=0; return ERROR_EDGE_THREE; }

    if( numW !=3 ) { mErrorColor=1; return ERROR_EDGE_THREE; }

    if( numB !=3 ) { mErrorColor=2; return ERROR_EDGE_THREE; }

    if( numR !=3 ) { mErrorColor=3; return ERROR_EDGE_THREE; }

    return 0;

    }

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

  private void remap(int[] perm, int[] edges, int index, int section)

    {

    int val = edges[index];

    for(int i=index;i<12; i++)

      if( edges[i]==val )

        {

        edges[i]=-1;

        perm[i] = section;

        }

    }

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

  private int[] getPermutation(int[] edges)

    {

    int[] perm = new int[12];

    int index0 = 0;

    remap(perm,edges,index0,0);

    int index1 = index0+1;

    for(;index1<12;index1++)

      if( edges[index1]>=0 ) break;

    remap(perm,edges,index1,1);

    int index2 = index1+1;

    for(;index2<12;index2++)

      if( edges[index2]>=0 ) break;

    remap(perm,edges,index2,2);

    int index3 = index2+1;

    for(;index3<12;index3++)

      if( edges[index3]>=0 ) break;

    remap(perm,edges,index3,3);

    return perm;

    }

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

  public int tablebaseIndex(TwistyObject object)

    {

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

    getEdges(object,edges);

    int result1 = checkEdges(edges);

    if( result1<0 ) return result1;

    int[] perm = getPermutation(edges[0]);

    return TBDino4.indexFromPartition(perm);

    }

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

  private int getColorIndex7(int color)

    {

    switch(color)

      {

      case 0: return R.string.color_yellow7;

      case 1: return R.string.color_white7;

      case 2: return R.string.color_blue7;

      case 3: return R.string.color_red7;

      }

    return -1;

    }

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

  public String error(int index, Resources res)

    {

    int i = getColorIndex7(mErrorColor);

    String color = res.getString(i);

    return res.getString(R.string.solver_generic_edge_three,color);

    }

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

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

    {

    if( mSolver==null )

      {

      mSolver = ImplementedTablebasesList.createPacked(os, ListObjects.DIN4_3.name() );

      }

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

    }

}