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 all elements less than 0 or greater than 10 and replace them with NaN
Inner product of two vectors
Return elements unique to either input
Set some matrix elements to zero
Combinations without using nchoosek
Rule of mixtures (composites) - lower bound
Rumis Scorer 3
Divisible by 10
Lights Out 5 - 5x5, 10 moves
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