TwistyPuzzleLib

      if (SolverEdge.FR <= ep[j] && ep[j] <= SolverEdge.BR)

        {

        a += Cnk(11-j, x+1);

    int b = 0;

    for( int j=3; j>0; j--) // compute the index b < 4! for the permutation in perm

	  byte ori;

	  SolverCubieCube ccRet = new SolverCubieCube();

	  for( int i=0; i<12; i++) ccRet.ep[i] = SolverEdge.UR;    // and edges

	  int col1, col2;

	public static void prepare(OperatingSystemInterface os)

	  {

		SolverCoordCube.initialize(os,2);

		SolverCoordCube.initialize(os,3);

		SolverCoordCube.initialize(os,4);

    SurfaceInfo(float[] s) { surface = s; }

    void setIndices(int[] i) { indices = i; }

  private int[][] mTmpFaceColorTable;

  private int[][] mCubitFaceToSurfaceMap;

  private int[][] mCubitFaceToPuzzleFaceMap;

      case AXIS_Z: return numXMoves()+numYMoves();

      }

    }

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

  private ScrambleState produceScrambleState()

    {

    return null;

    }

  private static final int INVALID_MOVE = -1;

  private static final int NUM_MOVES = 23;

  private boolean mFresh;

  private long mID;

  private final long[] mMoves;

    String ret = str.length()!=0 ? "  ,":"  ";

    ret += row;

    ret += angle;

         if( id< 10 ) ret += (",  "+id);

        CORNER_MAP_INVERTED[i][j] = findIndex(CORNER_MAP[i],j);

        EDGE_MAP_INVERTED[i][j]   = findIndex(EDGE_MAP[i],j);

        }

  private int[][] mAngles;

  private boolean mUpsideDown;

    {

    fact[0] = 1;

    for(int i=1; i<MAX_PERM; i++) fact[i] = fact[i-1]*i;

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

    for(int axis=0; axis<mNumAxis; axis++)

      {

      float z = mRotAxis[axis].get2();

      float w = 0.0f;