TwistyPuzzleLib

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

// 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.objectlib.tablebases;

import static org.distorted.objectlib.main.TwistyObject.SQ2;

import static org.distorted.objectlib.main.TwistyObject.SQ3;

import static org.distorted.objectlib.main.TwistyObject.SQ6;

import org.distorted.library.type.Static3D;

import org.distorted.objectlib.R;

import org.distorted.objectlib.helpers.OperatingSystemInterface;

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

public class TBPyraminx extends TablebasesAbstract

{

  public static final int[][] EDGE_QUATS = new int[][]

      {

          { 0,10},  // even-odd quat (i.e. even-odd twist of the relevant edge piece)

          { 1, 7},

          { 4, 8},

          { 2, 6},

          { 3, 5},

          {11, 9}

      };

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

  public TBPyraminx()

    {

    super();

    }

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

  public TBPyraminx(OperatingSystemInterface os)

    {

    super(os, R.raw.pyra_3_tablebase);

    }

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

  int[][] getBasicAngles()

    {

    int[] tmp = {3,3};

    return new int[][] { tmp,tmp,tmp,tmp };

    }

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

  Static3D[] getRotationAxis()

    {

    return new Static3D[]

         {

           new Static3D(     0,-SQ3/3,-SQ6/3),

           new Static3D(     0,-SQ3/3, SQ6/3),

           new Static3D( SQ6/3, SQ3/3,     0),

           new Static3D(-SQ6/3, SQ3/3,     0),

         };

    }

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

  float[][] getPosition()

    {

    return new float[][]

         {

             { 0.0f,-SQ2/4, 0.5f},

             { 0.0f,-SQ2/4,-0.5f},

             {-0.5f, SQ2/4, 0.0f},

             { 0.5f, SQ2/4, 0.0f},

             { 0.0f,-SQ2/2, 0.0f},   // index=0 has the quats already set up so that

             { 0.0f,-SQ2/2, 0.0f},   // all the edges fall into right spots, so here

             { 0.0f,-SQ2/2, 0.0f},   // they need to be all in one place

             { 0.0f,-SQ2/2, 0.0f},

             { 0.0f,-SQ2/2, 0.0f},

             { 0.0f,-SQ2/2, 0.0f},

         };

    }

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

  float[][] getCuts()

    {

    float[] cut = { 0.25f*(SQ6/3) };

    return new float[][] { cut,cut,cut,cut };

    }

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

  boolean[][] getRotatable()

    {

    boolean[] tmp = new boolean[] {false,true};

    return new boolean[][] { tmp,tmp,tmp,tmp };

    }

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

// specifically for the tablebase

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

  private void addMove(int[] move, int axis, int twist)

    {

    move[0] = axis;

    move[1] = 4;

    move[2] = (twist==2 ? -1:twist);

    }

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

  private void includeTip(int[] move, int[] extra, int index)

    {

    move[1] = 6;

    extra[index] += (move[2]==1 ? 2:1);

    }

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

  private boolean failedInsertingTipMove(int[][] moves, int[] extra, int extraIndex, int axis)

    {

    int numAxis = 0;

    boolean ret = true;

    extra[extraIndex]+=3; // make sure extra is positive

    for( int[] move : moves )

      {

      if( move[0]==axis )

        {

        numAxis++;

        if( (numAxis==1 && (move[2]-extra[extraIndex])%3==0 ) || numAxis>=2 ) ret=false;

        }

      }

    int currAx = 0;

    int numMoves = moves.length;

    int foreIndex=-1;

    int lastIndex = -1;

    for( int index=0; index<numMoves; index++ )

      {

      int[] move = moves[index];

      if( move[0]==axis )

        {

             if( currAx <  numAxis-2 ) includeTip(move,extra,extraIndex);

        else if( currAx == numAxis-2 ) foreIndex = index;

        else if( currAx == numAxis-1 ) lastIndex = index;

        currAx++;

        }

      }

    extra[extraIndex] = (extra[extraIndex]%3);

    if( foreIndex>=0 )

      {

      int foreAngle = moves[foreIndex][2];

      int lastAngle = moves[lastIndex][2];

      if( extra[extraIndex]==1 )

        {

        if( foreAngle==1 ) includeTip(moves[foreIndex],extra,extraIndex);

        else

          {

          includeTip(moves[lastIndex],extra,extraIndex);

          if( lastAngle==-1 ) includeTip(moves[foreIndex],extra,extraIndex);

          }

        }

      else if( extra[extraIndex]==2 )

        {

        if( foreAngle==-1 ) includeTip(moves[foreIndex],extra,extraIndex);

        else

          {

          includeTip(moves[lastIndex],extra,extraIndex);

          if( lastAngle==1 ) includeTip(moves[foreIndex],extra,extraIndex);

          }

        }

      }

    else if( lastIndex>=0 )

      {

      int lastAngle = moves[lastIndex][2];

      if( (extra[extraIndex]-lastAngle)%3 ==0 )

        includeTip(moves[lastIndex],extra,extraIndex);

      }

    extra[extraIndex] = (extra[extraIndex]%3);

    return ret;

    }

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

// extra = cornerTips

  @Override

  int[][] extraInfo(int[][] moves, int[] extra)

    {

    int lenExtra = 0;

    if( failedInsertingTipMove(moves,extra,0,1) && extra[0]!=0 ) lenExtra++;

    if( failedInsertingTipMove(moves,extra,1,0) && extra[1]!=0 ) lenExtra++;

    if( failedInsertingTipMove(moves,extra,2,3) && extra[2]!=0 ) lenExtra++;

    if( failedInsertingTipMove(moves,extra,3,2) && extra[3]!=0 ) lenExtra++;

    if( lenExtra>0 )

      {

      int[][] extraMoves = new int[lenExtra][3];

      int index=0;

      if( extra[0]!=0 ) { addMove(extraMoves[index],1,extra[0]); index++; }

      if( extra[1]!=0 ) { addMove(extraMoves[index],0,extra[1]); index++; }

      if( extra[2]!=0 ) { addMove(extraMoves[index],3,extra[2]); index++; }

      if( extra[3]!=0 ) { addMove(extraMoves[index],2,extra[3]);          }

      int len = moves.length;

      int totalLen = len+lenExtra;

      int[][] totalMoves = new int[totalLen][];

      if( len>0 ) System.arraycopy(moves, 0, totalMoves, 0, len);

      System.arraycopy(extraMoves, 0, totalMoves, len, lenExtra);

      return totalMoves;

      }

    return moves;

    }

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

  int getSize()

    {

    return 933120;  // see https://www.jaapsch.net/puzzles/pyraminx.htm

    }

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

  int getMinScramble()

    {

    return 9;

    }

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

  public static void getEdgePermutation(int[] output, int[] quats, int index)

    {

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

      {

      int quat = quats[i+index];

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

        {

        int[] edge = EDGE_QUATS[j];

        if( quat==edge[0] || quat==edge[1] ) { output[i]=j; break; }

        }

      }

    }

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

  public static void getEdgeTwist(int[] output, int[] quats, int index)

    {

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

      {

      int quat = quats[i+index];

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

        {

        int[] edge = EDGE_QUATS[j];

        if( quat==edge[0] ) { output[i]=0; break; }

        if( quat==edge[1] ) { output[i]=1; break; }

        }

      }

    }

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

  private void getEdgeQuats(int twist, int[] perm, int[] output)

    {

    int totalTwist = 0;

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

      {

      int p = perm[i];

      int t = (twist%2);

      twist/=2;

      output[i+4] = EDGE_QUATS[p][t];

      totalTwist += t;

      }

    int p = perm[5];

    int t = (totalTwist%2)==0 ? 0:1;

    output[9] = EDGE_QUATS[p][t];

    }

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

  private int getVertexTwist(int[] quats)

    {

    int twist = 0;

    if( quats[3]==5 ) twist += 1;

    if( quats[3]==6 ) twist += 2;

    twist *= 3;

    if( quats[2]==7 ) twist += 1;

    if( quats[2]==8 ) twist += 2;

    twist *= 3;

    if( quats[1]==1 ) twist += 1;

    if( quats[1]==2 ) twist += 2;

    twist *= 3;

    if( quats[0]==3 ) twist += 1;

    if( quats[0]==4 ) twist += 2;

    return twist;

    }

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

  private void getVertexQuats(int twist, int[] output)

    {

    switch(twist%3)

      {

      case 0: output[0]=0; break;

      case 1: output[0]=3; break;

      case 2: output[0]=4; break;

      }

    twist /= 3;

    switch(twist%3)

      {

      case 0: output[1]=0; break;

      case 1: output[1]=1; break;

      case 2: output[1]=2; break;

      }

    twist /= 3;

    switch(twist%3)

      {

      case 0: output[2]=0; break;

      case 1: output[2]=7; break;

      case 2: output[2]=8; break;

      }

    twist /= 3;

    switch(twist%3)

      {

      case 0: output[3]=0; break;

      case 1: output[3]=5; break;

      case 2: output[3]=6; break;

      }

    }

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

  public int[] getQuats(int index)

    {

    int vertexTwist = (index%81);

    index /= 81;

    int edgeTwist = (index%32);

    int perm_num = index/32;

    int[] quats = new int[10];

    getVertexQuats(vertexTwist,quats);

    int[] permutation = new int[6];

    TablebaseHelpers.getEvenPermutationFromNum(permutation,perm_num);

    getEdgeQuats(edgeTwist,permutation,quats);

    return quats;

    }

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

  public int getIndex(int[] quats)

    {

    int vertexTwist = getVertexTwist(quats);

    int[] permutation = new int[6];

    getEdgePermutation(permutation,quats,4);

    int[] twist = new int[6];

    getEdgeTwist(twist,quats,4);

    int edgeTwist = twist[0]+ 2*(twist[1]+ 2*(twist[2]+ 2*(twist[3]+ 2*twist[4])));

    int perm_num = TablebaseHelpers.computeEvenPermutationNum(permutation);

    return vertexTwist + 81*(edgeTwist + 32*perm_num);

    }

}