Here's one that might be easy, maybe not.

Construct a pattern for Conway's Game of Life that, in all generations g > t (for some t),

the population count p is equal to g.

If that's possible, then try to minimize t.

I've tried this and figured out some possible ways to do it, but they aren't particularly

nice.

There's a reason I want this: I want to use this to help testing Golly (and other Life

programs).

-tom