Oh, that's clever! That would probably speed up the filtering the wca asked
of us.



On Feb 11, 2013, at 7:19 AM, "Clément Gallet" <notifications@github.com>
wrote:

In scrambles/src/puzzle/CubePuzzle.java:

> +					clockwiseTurnsToGetToPrimaryColor++;
> +					azzert(clockwiseTurnsToGetToPrimaryColor < 3);
> +				}
> +				int piece = (clockwiseTurnsToGetToPrimaryColor << 3) + pieceVal;
> +				pieces[i] = piece;
> +			}
> +			
> +			state.permutation = TwoByTwoSolver.packPerm(pieces);
> +			state.orientation = TwoByTwoSolver.packOrient(pieces);
> +			return state;
> +		}
> +		
> +		@Override
> +		public String solveIn(int n) {
> +			if(size == 2) {
> +				String solution = twoSolver.solveIn(toTwoByTwoState(), n, false);

We could use the underlying 2x2 of a nxn puzzle for pruning !
A nxn puzzle is solvable in n moved only if corners are solvable in n moves.

—
Reply to this email directly or view it on
GitHub<https://github.com/cubing/tnoodle/pull/104/files#r2962644>..