Coolout Conjecture: Difference between revisions

From LifeWiki
Jump to navigation Jump to search
Infobox
No edit summary
Line 26: Line 26:


The row above the top edge must have six consecutive OFF cells; if it does not, the ON cells in the second and/or fifth columns will turn OFF. However, six consecutive OFF cells prevent the OFF cells in the third and fourth columns from being stabilized:  without an ON neighbor above the top row, they will turn ON.
The row above the top edge must have six consecutive OFF cells; if it does not, the ON cells in the second and/or fifth columns will turn OFF. However, six consecutive OFF cells prevent the OFF cells in the third and fourth columns from being stabilized:  without an ON neighbor above the top row, they will turn ON.
By similar logic, it can be shown that this pattern is also a counterexample to the conjecture:
<center>{{LV:Viewer|x = 5, y = 2, rule = B3/S23:P5,2
2ob2o$obobo!
[[ THEME 6 GRID GRIDMAJOR 0 VIEWONLY THUMBNAIL ]]}}</center>
Similarly to the original counterexample, the cells in the top row allow the center OFF cell to turn on if they are OFF and turn OFF the flanking ON cells if they are ON.
Some other counterexamples to the Coolout Conjecture have been found, including these three small patterns:
<center>{{LV:Viewer|x = 27, y = 3, rule = B3/S23:P27,3
A3.A$.A.A6.3A.2A5.2A.3A$A.A.A5.A4.A5.2A2.A!
[[ THEME 6 GRID GRIDMAJOR 0 VIEWONLY THUMBNAIL ]]}}</center>
It has been proven via a small brute-force search that a 2-by-5 rectangle is the smallest bounding box that allows a counterexample to exist.
It has been conjectured that no nontrivial counterexample exists with fewer than seven ON cells but this has yet to be proven.

Revision as of 02:20, 3 July 2017

Coolout Conjecture
x = 6, y = 2, rule = B3/S23:P6,2 2o2b2o$ob2obo! #C [[ THUMBSIZE 2 THEME 6 GRID GRIDMAJOR 0 SUPPRESS THUMBLAUNCH ]]
Pattern type Miscellaneous
Number of cells 8
Bounding box 6 × 2
Static symmetry Unspecified
Discovered by Richard Schroeppel
Year of discovery 2001

The Coolout Conjecture is a conjecture proposed by Richard Schroeppel before 1992, and disproven by counterexample in 2001. The conjecture has been stated as:

Given a partial Life pattern that's internally consistent with being part of a still life (stable pattern), is there always a way to add a stabilizing boundary?

or alternatively,

If a configuration C is locally stable over a rectangle R, does there exist a configuration C* such that:
  1. C* is locally equal to C over R; and
  2. C* is globally stable?

In August 2001, Schroeppel published the following 6x2 pattern as a counterexample to the conjecture:

x=6, y = 2, rule = B3/S23:P6,2 2o2b2o$ob2obo! [[ THEME 6 GRID GRIDMAJOR 0 VIEWONLY THUMBNAIL ]]

The row above the top edge must have six consecutive OFF cells; if it does not, the ON cells in the second and/or fifth columns will turn OFF. However, six consecutive OFF cells prevent the OFF cells in the third and fourth columns from being stabilized: without an ON neighbor above the top row, they will turn ON.

By similar logic, it can be shown that this pattern is also a counterexample to the conjecture:

x=5, y = 2, rule = B3/S23:P5,2 2ob2o$obobo! [[ THEME 6 GRID GRIDMAJOR 0 VIEWONLY THUMBNAIL ]]

Similarly to the original counterexample, the cells in the top row allow the center OFF cell to turn on if they are OFF and turn OFF the flanking ON cells if they are ON. Some other counterexamples to the Coolout Conjecture have been found, including these three small patterns:

x=27, y = 3, rule = B3/S23:P27,3 A3.A$.A.A6.3A.2A5.2A.3A$A.A.A5.A4.A5.2A2.A! [[ THEME 6 GRID GRIDMAJOR 0 VIEWONLY THUMBNAIL ]]

It has been proven via a small brute-force search that a 2-by-5 rectangle is the smallest bounding box that allows a counterexample to exist. It has been conjectured that no nontrivial counterexample exists with fewer than seven ON cells but this has yet to be proven.