Die hard: Difference between revisions
m Updated the longest lasting diehard in C1 symmetry |
m Updated information |
||
| Line 30: | Line 30: | ||
{{LinkLexicon|lex_d.htm#diehard}} | {{LinkLexicon|lex_d.htm#diehard}} | ||
* [https://catagolue.appspot.com/object/messless_13h/b3s23 diehard1340 on Catagolue] | * [https://catagolue.appspot.com/object/messless_13h/b3s23 diehard1340 on Catagolue] | ||
* [https://catagolue.appspot.com/object/messless_10h/b3s23 | * [https://catagolue.appspot.com/object/messless_10h/b3s23 diehard1058 on Catagolue] | ||
Revision as of 12:16, 23 January 2019
| Die hard | |||||||
| View static image | |||||||
| Pattern type | Methuselah | ||||||
|---|---|---|---|---|---|---|---|
| Number of cells | 7 | ||||||
| Bounding box | 8 × 3 | ||||||
| Lifespan | 130 generations | ||||||
| L/I | 18.6 | ||||||
| Static symmetry | Unspecified | ||||||
| Discovered by | Unknown | ||||||
| Year of discovery | Unknown | ||||||
| |||||||
Die hard is a 7-cell methuselah (essentially a collision between a block and the traffic light sequence) that vanishes after 130 generations, which is conjectured to be the limit for vanishing patterns of 7 or fewer cells. Note that there is no limit for higher numbers of cells, as eight cells suffice to have a glider heading towards an arbitrarily distant blinker.
Alternatively, "die hard" or "diehard" may refer to any methuselah that eventually vanishes. These are referred to as "messless methuselahs" by Catagolue and apgsearch.
For example, on January 7, 2019, a symmetric soup search run by Apple Bottom turned up a 31x31, 1340-tick diehard:
| (click above to open LifeViewer) RLE: here Plaintext: here |
As of early 2019, the longest-lasting diehard found in an asymmetric soup (and fitting inside a 16x16 bounding box) is a 1058-tick "C1" pattern found by Dave Greene on January 20, 2019.
In other rules
In HighLife, despite the instability of the traffic light sequence, the die hard still works, disappearing after 119 generations.