I recommend seeing this: https://en.wikipedia.org/wiki/Oscillator_(cellular_automaton)
In this problem, all he wants is how many steps are necessary for the automaton to repeat itself.
Find all elements less than 0 or greater than 10 and replace them with NaN
Knight's Tour Checker
N-Dimensional Array Slice
Knots Contest: Score (TestSuite)
Cubic Integer Constrained Solution
GJam 2017 Kickstart: Parentheses (Small)
Packing Santa's Sleigh: First Layer
Rubik's Cube: 30 Moves or Less : Cody Size
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