note: the "is it sneaky?" part of the testsuite is not really a complete test (e.g. the matrix [1 2 3; 4 5 6; 7 8 9] would pass that). Using "complex(I,J)" instead of "I+J" would fix this.
Thanks Alfonso! Advice taken.
You also gave me a new test for "Is it Snaky (42705)" that knocked out the current leader.
Can you clarify: does the partial sequence 1-1-0-1 force a failure? Your diagram doesn't seem to allow diagonal paths, so it seems that a single 0 or 1 causes failure.
Hi Carl: All sequences are generated from successful packings. So you wouldn't get 1-1-0-1 because, as you note, it couldn't be packed successfully. In other words, this situation shouldn't come up.
Back and Forth Rows
Given a window, how many subsets of a vector sum positive
Set the array elements whose value is 13 to 0
Convert matrix to 3D array of triangular matrices
Find the stride of the longest skip sequence
Make a function that returns its own character count
Is It a Snake?
Simulate one complete step in the Biham–Middleton–Levine traffic model
Twist 'n' Match
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