Magic Cube

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

  public boolean isSolved()

    {

    int index = CUBITS[0].mQuatIndex;

    for(int i=1; i<NUM_CUBITS; i++)

      {

      if( CUBITS[i].mQuatIndex != index ) return false;

      }

    return true;

    }

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

// Square-2 is solved iff

// a) all of its cubits are rotated with the same quat

// b) its two 'middle' cubits are rotated with the same quat, the 6 'front' and 6 'back'

// edges and corners with this quat multiplied by QUATS[18] (i.e. those are upside down)

// and all the 12 left and right edges and corners also with the same quat multiplied by

// QUATS[12] - i.e. also upside down.

  public boolean isSolved()

    {

    int index = CUBITS[0].mQuatIndex;

    if( CUBITS[1].mQuatIndex!=index ) return false;

    int indexX = mulQuat(index,12);  // QUATS[12] = 180deg (1,0,0)

    int indexZ = mulQuat(index,18);  // QUATS[18] = 180deg (0,0,1)

    for(int i=2; i<18; i+=2)

      {

      if( CUBITS[i].mQuatIndex != index && CUBITS[i].mQuatIndex != indexZ ) return false;

      }

    for(int i=3; i<18; i+=2)

      {

      if( CUBITS[i].mQuatIndex != index && CUBITS[i].mQuatIndex != indexX ) return false;

      }

    for(int i=18; i<NUM_CUBITS; i+=2)

      {

      if( CUBITS[i].mQuatIndex != index && CUBITS[i].mQuatIndex != indexX ) return false;

      }

    for(int i=19; i<NUM_CUBITS; i+=2)

      {

      if( CUBITS[i].mQuatIndex != index && CUBITS[i].mQuatIndex != indexZ ) return false;

      }

    return true;

    }