Problem 1970. Kaggle: Reverse Game of Life - Periods of Oscillators

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:hyperlink w:docLocation=\"http://www.kaggle.com/c/conway-s-reverse-game-of-life\"><w:r><w:t>Kaggle's Conway's Reverse Game of Life</w:t></w:r></w:hyperlink><w:r><w:t> contest inspires this Period of Life challenge. The kaggle contest runs from Oct-14-2013 thru Mar-02-2014. References:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://mathworld.wolfram.com/GameofLife.html\"><w:r><w:t>Game of Life at Wolfram</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Conway%27s_Game_of_Life\"><w:r><w:t>Wiki Life</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[1. Any live cell with fewer than two live neighbors dies, as if caused by under-population.\n2. Any live cell with two or three live neighbors lives on to the next generation.\n3. Any live cell with more than three live neighbors dies, as if by overcrowding.\n4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.\n5. No wrap around. Beyond edge is zero. Eight Neighbors.]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Determine the period of life for a given binary matrix. A stable configuration, Still Life, has a cycle of 1.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> M , an [m,n] array</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> N, Period of Life cycle (Period &lt;11)</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Examples:</w:t></w:r><w:r><w:t> A few matrices of varying periods</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[N=1 N=2 N=3 Caterer\n0000 00000 0000000000\n0110 00000 0001000000\n0110 01110 0100011110\n0000 00000 0100010000\n 00000 0100000000\n 0000100000\n 0011000000\n 0000000000]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Additional References:</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.conwaylife.com/wiki/Oscillator\"><w:r><w:t>Oscillators</w:t></w:r></w:hyperlink><w:r><w:t>,</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.conwaylife.com/wiki/Still_life\"><w:r><w:t>Still Life</w:t></w:r></w:hyperlink></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

<a href = "http://www.kaggle.com/c/conway-s-reverse-game-of-life">Kaggle's Conway's Reverse Game of Life</a> contest inspires this Period of Life challenge. The kaggle contest runs from Oct-14-2013 thru Mar-02-2014. References: <a href = "http://mathworld.wolfram.com/GameofLife.html">Game of Life at Wolfram</a>. <a href = "http://en.wikipedia.org/wiki/Conway%27s_Game_of_Life">Wiki Life</a>.<pre class="language-matlab">1. Any live cell with fewer than two live neighbors dies, as if caused by under-population.
2. Any live cell with two or three live neighbors lives on to the next generation.
3. Any live cell with more than three live neighbors dies, as if by overcrowding.
4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.
5. No wrap around. Beyond edge is zero. Eight Neighbors.
</pre>Determine the period of life for a given binary matrix. A stable configuration, Still Life, has a cycle of 1.Input: M , an [m,n] arrayOutput: N, Period of Life cycle (Period &lt;11)Examples: A few matrices of varying periods<pre class="language-matlab">N=1 N=2 N=3 Caterer
0000 00000 0000000000
0110 00000 0001000000
0110 01110 0100011110
0000 00000 0100010000
 00000 0100000000
 0000100000
 0011000000
 0000000000
</pre>Additional References: <a href = "http://www.conwaylife.com/wiki/Oscillator">Oscillators</a>, <a href = "http://www.conwaylife.com/wiki/Still_life">Still Life</a>

<http://www.kaggle.com/c/conway-s-reverse-game-of-life Kaggle's Conway's Reverse Game of Life> contest inspires this Period of Life challenge. The kaggle contest runs from Oct-14-2013 thru Mar-02-2014. References: <http://mathworld.wolfram.com/GameofLife.html Game of Life at Wolfram>. <http://en.wikipedia.org/wiki/Conway%27s_Game_of_Life Wiki Life>.

1. Any live cell with fewer than two live neighbors dies, as if caused by under-population.
  2. Any live cell with two or three live neighbors lives on to the next generation.
  3. Any live cell with more than three live neighbors dies, as if by overcrowding.
  4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction.
5. No wrap around. Beyond edge is zero. Eight Neighbors.

Determine the period of life for a given binary matrix. A stable configuration, Still Life, has a cycle of 1.

*Input:* M , an [m,n] array

*Output:* N, Period of Life cycle (Period <11)

*Examples:*  A few matrices of varying periods

N=1   N=2    N=3 Caterer
  0000  00000  0000000000
  0110  00000  0001000000
  0110  01110  0100011110
  0000  00000  0100010000
        00000  0100000000
               0000100000
               0011000000
               0000000000

*Additional References:*
<http://www.conwaylife.com/wiki/Oscillator Oscillators>, <http://www.conwaylife.com/wiki/Still_life Still Life>

Solve

Solution Stats

21 Solutions
15 Solvers

Last Solution submitted on Oct 11, 2021

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Rafael S.T. Vieira on 4 Jul 2020

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.

Problem Recent Solvers15

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!