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 ^^'
Back to basics 17 - white space
245 Solvers
Sum of diagonal of a square matrix
1328 Solvers
95 Solvers
How long is the longest prime diagonal?
338 Solvers
Find the maximum number of decimal places in a set of numbers
742 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!