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 ^^'
Make the vector [1 2 3 4 5 6 7 8 9 10]
36284 Solvers
Find the longest sequence of 1's in a binary sequence.
3423 Solvers
Project Euler: Problem 5, Smallest multiple
410 Solvers
Create logical matrix with a specific row and column sums
176 Solvers
259 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!