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 a checkerboard matrix
Back to basics 6 - Column Vector
Back to basics 15 - classes
How to subtract?
Find the maximum number of decimal places in a set of numbers
Rule of mixtures (composites) - upper bound
Highly divisible triangular number (inspired by Project Euler 12)
Divisible by n, prime divisors (including powers)
Power Times (of the day)
Divisible by 12
Find the treasures in MATLAB Central and discover how the community can help you!
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