Show me a random blog post


stickers latex light reddit geometry christmas card a gamut of games sport coins platonic solids games manchester ternary hexapawn accuracy dataset oeis interpolation error bars people maths martin gardner sorting london chalkdust magazine pythagoras tennis news rhombicuboctahedron polynomials braiding noughts and crosses binary gerry anderson estimation flexagons cross stitch video games mathslogicbot harriss spiral hats triangles python mathsjam european cup arithmetic palindromes misleading statistics nine men's morris final fantasy craft reuleaux polygons propositional calculus game show probability golden spiral pizza cutting folding paper puzzles radio 4 php national lottery london underground bubble bobble inline code aperiodical big internet math-off royal baby twitter pac-man speed chebyshev draughts golden ratio sound manchester science festival electromagnetic field rugby bodmas christmas chess menace wool football fractals folding tube maps world cup map projections weather station statistics raspberry pi approximation game of life data curvature trigonometry dates asteroids frobel books captain scarlet machine learning logic javascript probability programming realhats countdown mathsteroids graph theory go dragon curves the aperiodical matt parker plastic ratio


Show me a random blog post
▼ show ▼

Making names in Life

The Game of Life is a cellular automaton invented by John Conway in 1970, and popularised by Martin Gardner.
In Life, cells on a square grid are either alive or dead. It begins at generation 0 with some cells alive and some dead. The cells' aliveness in the following generations are defined by the following rules:
Starting positions can be found which lead to all kinds of behaviour: from making gliders to generating prime numbers. The following starting position is one of my favourites:
It looks boring enough, but in the next generation, it will look like this:
If you want to confirm that I'm not lying, I recommend the free Game of Life Software Golly.

Going backwards

You may be wondering how I designed the starting pattern above. A first, it looks like a difficult task: each cell can be dead or alive, so I need to check every possible combination until I find one. The number of combinations will be \(2^\text{number of cells}\). This will be a very large number.
There are simplifications that can be made, however. Each of the letters above (ignoring the gs) is in a 3×3 block, surrounded by dead cells. Only the cells in the 5×5 block around this can affect the letter. These 5×5 blocks do no overlap, so can be calculated seperately. I doesn't take too long to try all the possibilities for these 5×5 blocks. The gs were then made by starting with an o and trying adding cells below.

Can I make my name?

Yes, you can make your name.
I continued the search and found a 5×5 block for each letter. Simply Enter your name in the box below and these will be combined to make a pattern leading to your name!
Enter your name:

Similar posts

Building MENACEs for other games
MENACE at Manchester Science Festival
The Mathematical Games of Martin Gardner


Comments in green were written by me. Comments in blue were not written by me.
 Add a Comment 

I will only use your email address to reply to your comment (if a reply is needed).

Allowed HTML tags: <br> <a> <small> <b> <i> <s> <sup> <sub> <u> <spoiler> <ul> <ol> <li>
To prove you are not a spam bot, please type "htdiw" backwards in the box below (case sensitive):
© Matthew Scroggs 2019