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 ^^'
Project Euler: Problem 9, Pythagorean numbers
305 Solvers
Back to basics 23 - Triangular matrix
647 Solvers
Longest run of consecutive numbers
1955 Solvers
Check if number exists in vector
5020 Solvers
254 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!