Coolout Conjecture: Difference between revisions

From LifeWiki
Jump to navigation Jump to search
Infobox
No edit summary
 
(21 intermediate revisions by 7 users not shown)
Line 2: Line 2:
|name        = Coolout Conjecture
|name        = Coolout Conjecture
|pname        = cooloutconjecture
|pname        = cooloutconjecture
|type        = Problem
|c            = 8
|c            = 8
|bx          = 6
|bx          = 6
|by          = 2
|by          = 2
|discoverer  = Richard Schroeppel
|symmetry    = D2_+2
|discoverer  = Rich Schroeppel
|discoveryear = 2001
|discoveryear = 2001
|plaintext    = true
|rle          = true
|rle          = true
}}
}}
The '''Coolout Conjecture''' is a conjecture proposed by [[Richard Schroeppel]] before 1992, and disproven by counterexample in 2001. The conjecture has been stated as:
The '''Coolout Conjecture''' is a conjecture proposed by [[Rich Schroeppel]] before 1992, and disproven by counterexample in 2001. The exact original form of the conjecture is unknown, but it can be summarized as follows:


:''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?
:''Given a partial Life pattern that's internally consistent with being part of a [[still life]] (i.e. each cell can be stabilized individually by the placement of cells at the pattern's boundary), there is always some way to add a stabilizing boundary for the entire pattern.


or alternatively,
Alternatively, here is the form of the conjecture from an April 1992 list of open questions<ref>{{LinkForumThread|p=196451|title=Re: Thread for basic questions|author=dvgrn|date=October 23, 2024|format=ref}}</ref>:


:''If a configuration <tt>C</tt> is locally stable over a rectangle <tt>R</tt>, does there exist a configuration <tt>C*</tt> such that:''
:''if a configuration <tt>C</tt> is locally stable over a rectangle <tt>R</tt>, then there exists a configuration <tt>C*</tt> such that''
:# ''<tt>C*</tt> is locally equal to <tt>C</tt> over <tt>R</tt>; and''
::'' '''(a)''' <tt>C*</tt> is locally equal to <tt>C</tt> over <tt>R</tt>; and''
:# ''<tt>C*</tt> is globally stable?''
::'' '''(b)''' <tt>C*</tt> is globally stable.''


In August 2001, Schroeppel published the following 6x2 pattern as a counterexample to the conjecture:
In August 2001, Schroeppel published the following {{times|6|2}} pattern as a counterexample to the conjecture:


<center>{{LV:Viewer|x = 6, y = 2, rule = B3/S23:P6,2
<center>{{LV:Viewer|x = 6, y = 2, rule = B3/S23:P6,2
Line 26: Line 29:


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, this {{times|5|2}} pattern can be shown to be a counterexample to the conjecture:<ref>{{LinkForumThread|f=12|t=2703|p=44437|title=Re: Random posts|author=BlinkerSpawn|date=June 16, 2017|format=ref}}</ref>
<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 have also been found,<ref>{{LinkForumThread|f=7|t=2919|title=Coolout Conjecture Counterexamples|author=Aleph|date=June 24, 2017|format=ref}}</ref> including this one:
<center>{{LV:Viewer|x = 6, y = 2, rule = B3/S23:P6,2
2ob3o$2o2bo!
[[ THEME 6 GRID GRIDMAJOR 0 VIEWONLY THUMBNAIL ]]}}</center>
It has been shown via a small brute-force search that a {{times|5|2}} rectangle is the smallest bounding box that allows a counterexample to exist.
== References ==
<references />

Latest revision as of 15:10, 6 August 2026

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 Problem
Number of cells 8
Bounding box 6 × 2
Static symmetry D2_+2
Discovered by Rich Schroeppel
Year of discovery 2001

The Coolout Conjecture is a conjecture proposed by Rich Schroeppel before 1992, and disproven by counterexample in 2001. The exact original form of the conjecture is unknown, but it can be summarized as follows:

Given a partial Life pattern that's internally consistent with being part of a still life (i.e. each cell can be stabilized individually by the placement of cells at the pattern's boundary), there is always some way to add a stabilizing boundary for the entire pattern.

Alternatively, here is the form of the conjecture from an April 1992 list of open questions[1]:

if a configuration C is locally stable over a rectangle R, then there exists a configuration C* such that
(a) C* is locally equal to C over R; and
(b) C* is globally stable.

In August 2001, Schroeppel published the following 6 × 2 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, this 5 × 2 pattern can be shown to be a counterexample to the conjecture:[2]

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 have also been found,[3] including this one:

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

It has been shown via a small brute-force search that a 5 × 2 rectangle is the smallest bounding box that allows a counterexample to exist.

References

  1. ↑ dvgrn (October 23, 2024). Re: Thread for basic questions (discussion thread) at the ConwayLife.com forums
  2. ↑ BlinkerSpawn (June 16, 2017). Re: Random posts (discussion thread) at the ConwayLife.com forums
  3. ↑ Aleph (June 24, 2017). Coolout Conjecture Counterexamples (discussion thread) at the ConwayLife.com forums