TwistyPuzzleLib

    int q0 = quats[0];

    int len = quats.length;

    boolean theSame = true;

    for(int q=1; q<len; q++)

      if( quats[q]!=q0 )

        {

        theSame = false;

        break;

        }

    // original Kociemba solver returns 13-move long 'solution' to an already solved position!

    if( theSame )

      {

      screen.setSolved(null,0,null);

      }

    else

      {

      SolverSearch.prepare(mOS);

      String objectPosition = preparePosition();

      String result = SolverSearch.solution(objectPosition, 24, 20);

      // this should be impossible since we've validated the position already!

      if( result.contains("Error") ) screen.displayImpossibleDialog(result);

      else screen.setSolved(result);

      }