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 java.io.IOException;

import java.io.InputStream;

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

  private PruningTable[] mMidTables;

  abstract int[] getHighPruningLevels();

  abstract int getGodsNumber();

    byte[] tmp = new byte[16384];

      byte[] data = buffer.toByteArray();

      buffer.close();

    catch(IOException ex)

    super();

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

    int high= highIDs!=null ? highIDs.length : 0;

    mMidTables = mid >0 ? new PruningTable[mid] : null;

    mHighTables= high>0 ? new PruningTable[high]: null;

    mGodsNumber = getGodsNumber();

    for(int i=0; i<high; i++) mHighTables[i]= createPruningTable(os,highIDs[i]);

    computeLowHigh();

  public byte[][] getPacked()

    {

      {

      int numMidLevels= midLevels!=null ? midLevels.length : 0;

      int[] highLevels = getHighPruningLevels();

      int numHighLevels= highLevels!=null ? highLevels.length : 0;

        {

        for( int l : highLevels )

          if( l>maxLevel ) maxLevel = l;

        }

      else

        {

        if( midLevels!=null )

          for( int l : midLevels )

            if( l>maxLevel ) maxLevel = l;

        }

      mHighTables= numHighLevels>0 ? new PruningTable[numHighLevels] : null;

        mMidTables[i] = new PruningTable(mTablebase,midLevels[i]);

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

        mHighTables[i] = new PruningTable(mTablebase,highLevels[i]);

    int highNum = mHighTables!=null ? mHighTables.length : 0;

    byte[][] data = new byte[midNum+highNum][];

    for(int i=0; i<midNum ; i++) data[i       ] = mMidTables[i].getPacked();

    for(int i=0; i<highNum; i++) data[i+midNum] = mHighTables[i].getPacked();

    }

    {

    mLowestHigh = mGodsNumber+1;

    int numHigh = mHighTables==null ? 0 : mHighTables.length;

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

      {

      int level = mHighTables[i].getLevel();

      if( i==0 || level<mLowestHigh ) mLowestHigh=level;

      }

    mLowestMid = 0;

    mHighestMid= 0;

    int numMid = mMidTables==null ? 0 : mMidTables.length;

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

      {

      int level = mMidTables[i].getLevel();

      if( i==0 || level<mLowestMid  ) mLowestMid =level;

      if( i==0 || level>mHighestMid ) mHighestMid=level;

      }

    }

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

  public int traverseDownTable(int index, PruningTable[] tables, int tableIndex, int lastA, int lastR, int[] move, int[] tmpQuats)

    {

    int[] quats = getQuats(index);

    int numQuats = quats.length;

    move[0]=0;

    move[1]=0;

    move[2]=1;

    move[3]=1;

    for(int s=0; s<mScalingFactor; s++)

      {

      int ax    = move[0];

      int layer = move[1];

      int quat  = move[3];

      if( mRotatable[ax][layer] && moveCanProceed(lastA,lastR,move[0],move[1]) )

        {

        for(int cubit=0; cubit<mNumCubits; cubit++)

            int currQuat = tmpQuats[cubit];

            int newQuat = getMultQuat(quat,currQuat);

            tmpQuats[cubit] = newQuat;

            }

        int childIndex = getIndex(tmpQuats);

        if( tableIndex>0 )

          {

          if( tables[tableIndex-1].contains(childIndex) ) return childIndex;

          }

        else if( !tables[0].contains(childIndex) )

          {

          if( tables.length<=1 || !tables[1].contains(childIndex) ) return childIndex;

          }

        }

      getNextAxisLayerAngleQuat(move);

      }

    return -1;

    }

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

  private int traversePruningBlock(int[][] moves, PruningTable[] tables, int tableIndex, int index, int lastA, int lastR)

    do

      {

      lastA = move[0];

      lastR = move[1];

      tableIndex--;

      }

    while( tableIndex>=0 );

    return index;

    }

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

// ret: [0][] --> (new index,new depth,?,?) ; [1...N-1][] --> moves. (or null if index not in High)

  private int[][] traverseBlock(int index, PruningTable[] tables, int lastA, int lastR)

    {

    int num = (tables==null) ? 0 : tables.length;

    int tableIndex = -1;

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

      if( tables[i].contains(index) )

        {

        tableIndex = i;

        break;

        }

    int[][] ret = new int[tableIndex+2][4];

    ret[0][1] = tables[0].getLevel()-1;

    ret[0][0] = traversePruningBlock(ret,tables,tableIndex,index,lastA, lastR);

    return ret;

    }

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

  private int midTablesContain(int index)

    {

    int num = mMidTables.length;

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

      if( mMidTables[i].contains(index) )

        return i;

    return -1;

    }

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

                                         int[][] solution, int[][] tmpE, int[][][] rotRowE )

    int[] move    = solution[depth];

    int[][] rotRow= rotRowE[jump];

    move[0]=0;

    move[1]=0;

    move[2]=1;

    move[3]=1;

    for(int s=0; s<mScalingFactor; s++)

      {

      int ax    = move[0];

      int layer = move[1];

      int quat  = move[3];

      if( mRotatable[ax][layer] && moveCanProceed(lastA,lastR,ax,layer) )

        {

        for(int cubit=0; cubit<mNumCubits; cubit++)

        int childIndex = getIndex(tmp);

          solution[0][0] = childIndex;

          solution[0][1] = 0;

          return true;

          }

        int containingTable = midTablesContain(childIndex);

        if( containingTable>=0 )

          {

          solution[0][0] = childIndex;

          solution[0][1] = mMidTables[containingTable].getLevel();

          return true;

          }

          return true;

          }

        }

      getNextAxisLayerAngleQuat(move);

      }

    return false;

    }

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

    int[][][] rotRowE = new int[maxJump+1][mNumCubits][mNumAxis];

    return null;

    }

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

    int numQuats = quats.length;

    int[] move   = solution[depth];

    int[] tmp    = new int[mNumCubits];

    move[0]=0;

    move[1]=0;

    move[2]=1;

    move[3]=1;

    for(int s=0; s<mScalingFactor; s++)

      {

      int ax    = move[0];

      int layer = move[1];

      int quat  = move[3];

      if( mRotatable[ax][layer] && moveCanProceed(lastA,lastR,move[0],move[1]) )

        {

        for(int cubit=0; cubit<mNumCubits; cubit++)

            int currQuat = tmp[cubit];

            int newQuat = getMultQuat(quat,currQuat);

            tmp[cubit] = newQuat;

            }

        int childIndex = getIndex(tmp);

      getNextAxisLayerAngleQuat(move);

      }

    return false;

    }

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

    int[][] solution = new int[maxJump+1][4];

        solution[0][0] = i;

    }

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

  private int[][] concatenateMoves(int[][] high, int[][] jump1, int[][] mid, int[][] jump2)

    {

    int len1 = high ==null ? 0 : high.length-1;

    int[][] moves = new int[len1+len2+len3+len4][];

    int index = 0;

    for(int i=0; i<len1; i++) moves[index++] =  high[i+1];

    for(int i=0; i<len2; i++) moves[index++] = jump1[i+1];

    for(int i=0; i<len3; i++) moves[index++] =   mid[i+1];

    for(int i=0; i<len4; i++) moves[index++] = jump2[i+1];

    convertMoves(moves);

    return moves;

    }

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

    int[][] highMoves = traverseBlock(index,mHighTables,lastA,lastR);

    if( highMoves!=null )

      {

      index = highMoves[0][0];

      int len = highMoves.length;

      lastA = highMoves[len-1][0];

      lastR = highMoves[len-1][1];

      }

    int maxJump = Math.max(mLowestHigh-1-mHighestMid,mLowestMid/2);

    if( jump1Moves!=null )

      {

      if( jump1Moves[0][1]==mLowestMid )

        {

          {

          }

        }

      index = jump1Moves[0][0];

      lastA = jump1Moves[len][0];

      lastR = jump1Moves[len][1];

    int[][] midMoves = traverseBlock(index,mMidTables,lastA,lastR);

    if( midMoves!=null )

      {

      index = midMoves[0][0];

      int len = midMoves.length;

      lastA = midMoves[len-1][0];

      lastR = midMoves[len-1][1];

      }

      {

      }

      {

      }

    }