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 ^^'
712 Solvers
Piecewise linear interpolation
305 Solvers
544 Solvers
Replace multiples of 5 with NaN
362 Solvers
Van Eck's Sequence's nth member
294 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!