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 ^^'
Extract leading non-zero digit
1206 Solvers
Find nearest prime number less than input number
270 Solvers
531 Solvers
128 Solvers
14 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!