Improved performance of the solveIn method. One big thing is that we weren't stopping the search early enough (by taking into account the fact that we're trying to solve in <= n turns). Also optimized the getMoveCost() method of sq1 to do as little computation as possible. Since this method is in the innermost loop of solveIn(), slight improvments are felt manyfold.