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 ^^'
Find the two most distant points
How to find the position of an element in a vector without using the find function
Project Euler: Problem 6, Natural numbers, squares and sums.
Create logical matrix with a specific row and column sums
Numbers spiral diagonals (Part 2)
Rumis Scorer 2
Divisible by 6
Is it really a 5?
Divisible by n, Truncated-number Divisors
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office