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 5, Smallest multiple
Back to basics 12 - Input Arguments
Get the length of a given vector
Arrange vector in ascending order
Lights Out 5 - 5x5, 10 moves
Divisible by n, prime divisors (including powers)
Pattern Recognition 1 - Known Unit Length
Divisible by 10
Weighted Gold/Silver Standard
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