TwistyPuzzleLib

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

  private int computeCenterQuat(int originalLocation, int newLocation)

    {

    return 0;

    }

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

  private int computeCornerQuat(int originalLocation, int newLocation, int twist)

    {

    return 0;

    }

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

  private int[] computeCenterPerm(int q0, int q1, int q2, int q3)

    {

    return null;

    }

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

  private int computeCornerPerm(int[] output, int[] quats)

    {

    return 0;

    }

    int centers_perm_num = (index%12);

    index /= 12;

    int totalTwist = (index%128);

    int corners_perm_num = (index/128);

    int[] centers_perm = new int[4];

    TablebaseHelpers.getEvenPermutationFromNum(centers_perm,centers_perm_num);

    int[] corners_perm = new int[6];

    TablebaseHelpers.getEvenPermutationFromNum(corners_perm,corners_perm_num);

    int[] quats = new int[14];

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

      {

      int twist = (totalTwist%2);

      totalTwist /= 2;

      quats[i] = computeCornerQuat(i,corners_perm[i],twist);

      }

    quats[ 6] = computeCenterQuat(0,centers_perm[0]);

    quats[ 8] = computeCenterQuat(1,centers_perm[1]);

    quats[11] = computeCenterQuat(2,centers_perm[2]);

    quats[13] = computeCenterQuat(3,centers_perm[3]);

    return quats;

    int[] center_perm = computeCenterPerm(quats[6],quats[8],quats[11],quats[13]);

    int centers_perm_num = TablebaseHelpers.computeEvenPermutationNum(center_perm);

    int[] corners_perm = new int[6];

    int totalTwist = computeCornerPerm(corners_perm,quats);

    int corners_perm_num = TablebaseHelpers.computeEvenPermutationNum(corners_perm);

    return centers_perm_num + 12*(totalTwist + 128*corners_perm_num);