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 matching parenthesis
Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock. Tick. Tock.
Lights Out 8 - 5x5, light-only solution? I
Lights Out 15 - 5x5, broken buttons I
Sphenic number sequence
Divisible by n, prime divisors from 20 to 200
Highly divisible triangular number (inspired by Project Euler 12)
Lights Out 1 - 5x5, 3 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