Magic Cube

    if( mSolvedFunctionIndex==2 ) return isSolved2();

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

// Dino6 uses this. It is solved if and only if:

//

// All four 'X' cubits (i.e. those whose longest edge goes along the X axis) are rotated

// by the same quaternion qX, similarly all four 'Y' cubits by the same qY and all four 'Z'

// by the same qZ, and then either:

//

// a) qX = qY = qZ

// b) qY = qX*Q2 and qZ = qX*Q8  (i.e. swap of WHITE and YELLOW faces)

// c) qX = qY*Q2 and qZ = qY*Q10 (i.e. swap of BLUE and GREEN faces)

// d) qX = qZ*Q8 and qY = qZ*Q10 (i.e. swap of RED and BROWN faces)

//

// BUT: cases b), c) and d) are really the same - it's all just a mirror image of the original.

//

// X cubits: 0, 2, 8, 10

// Y cubits: 1, 3, 9, 11

// Z cubits: 4, 5, 6, 7

  public boolean isSolved2()

    {

    int qX = CUBITS[0].mQuatIndex;

    int qY = CUBITS[1].mQuatIndex;

    int qZ = CUBITS[4].mQuatIndex;

    if( CUBITS[2].mQuatIndex != qX || CUBITS[8].mQuatIndex != qX || CUBITS[10].mQuatIndex != qX ||

        CUBITS[3].mQuatIndex != qY || CUBITS[9].mQuatIndex != qY || CUBITS[11].mQuatIndex != qY ||

        CUBITS[5].mQuatIndex != qZ || CUBITS[6].mQuatIndex != qZ || CUBITS[ 7].mQuatIndex != qZ  )

      {

      return false;

      }

    return ( qX==qY && qX==qZ ) || ( qY==mulQuat(qX,2) && qZ==mulQuat(qX,8) );

    }