Conway's

|
Unsolved problems
This is a list of unsolved problems in Conway's game of
Life. The problems highlighted in bold have cash prizes!
- Create a 90° stable reflector in a 50*50 box.
($50 USD - Dave Greene)
- Create a 90° stable reflector in a 35*35 box.
($50 USD - Dave Greene)
- Create a steerable spaceship.
($50 USD - Amos Bairn)
- Build a replicator.
- Make a pattern with unstoppable quadratic growth.
- Find a glider synthesis of a c/3 spaceship.
- Find a glider synthesis of a c/5 spaceship.
- Engineer a pattern with spiral growth.
- Find oscillators for the remaining periods: 19, 23, 31, 34, 38, 41, 43, 53
- Make a more elegant stable lightspeed transceiver than my existing monstrocity.
- Find a way to turn a lightspeed signal quickly around a corner.
- Build a 'reflectorless rotating oscillator'.
- Make pure-period glider guns for all remaining periods.
- Make a stable reflector with a recovery time less than 100.
- Find lightspeed signals of all periods.
- Prove, or disprove by example, that every stable pattern can be constructed from gliders.
- Prove, or disprove, that every stable pattern has a sequence of gliders that can destroy it.
- Find a fountain oscillator of periods 7 and 9, and a superfountain of period 6.
- Create a pattern that can absorb any single glider fired at it and return to its original state.
- Create a stable pattern that satisfies the above conditions.
- Make a p14 oscillator using two copies of the 7-generation TL push.
- Produce a p36 pre-pulsar oscillator.
- Make an object that stretches an oblique line of ants.
- Make a transceiver for a drifter-based lightspeed signal.
- Prove, or disprove, the existence of a pattern with a parent but no grandparent.
- Find a way to turn a 2c/3 signal quickly around a corner.
- Make a direct 2c/3 signal injector.
- Make a pattern that can directly transform a drifter into a glider.
- Disprove, or prove by example, the existence of a c/2 'stripes agar' signal.
- Create a suitable p30 domino sparker, so that the p15 oscillator below can be made p30:
x = 14, y = 10, rule = B3/S23
bb3o4b3o$6obb6o$bb3o4b3o5$4bo4bo$bboob4oboo$4bo4bo!
- Find a 2c/5 'against-the-grain' greyship.
- Fill in the missing gaps on the status page.
- Build a gun for the 17c/45 Caterpillar spaceship.
- Build a stable glider-to-2c/5 ship converter.
- Determine whether the Fermat Prime Calculator grows indefinitely.
If you have solved a problem, either e-mail me, or in
the case of the 'prize problems', the person who is
offering the prize. You can also contact me if you want
to propose a new problem.
Problem 40 is equivalent to the mathematical problem:
Do any Fermat Primes exist above 65537? A Fermat Prime is
a prime number of the form 2^(2^n)+1, where n is a positive
integer.
If a Fermat Prime above 65537 exists, then the population of
the calculator is bounded. Otherwise, the pattern will grow
indefinitely, exhibiting linear growth.