The first test suite problem is troublesome because it requires only 3 moves, and the 3-move solution is not necessarily the first one it finds that has 6 moves or less.
...also, how does the assert(numel(moves)==6) work on the problem that has only 3 moves?
@William: the troublesome test case has been removed. Thanks for pointing that out.
some cases admit shorter solution ^^'
1849 Solvers
Program an exclusive OR operation with logical operators
641 Solvers
Number of 1s in a binary string
3046 Solvers
Find a subset that divides the vector into equal halves
336 Solvers
Make a run-length companion vector
521 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!