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 ^^'
3258 Solvers
Getting the indices from a vector
3464 Solvers
ZigZag matrix with reflected format
100 Solvers
528 Solvers
Is this is a Tic Tac Toe X Win?
444 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!