Finding Mona Lisa in the Game of Life — with JAX

Finding Mona Lisa in the Game of Life — with JAX » ¬


¬
with JAX
This video might take a few seconds to load. Please squint for best results :).
The results of this experiment are not exactly close to my target as you can see, but I thought it was worth a blog post anyway. There was this rough idea I’ve been thinking about in Conway’s Game of Life for a really long time.
I wonder if it's possible to use some kind of stochastic algorithm that gives you an initial state which forms legible text after many cycles.— yakinavault (@yakinavault) August 7, 2020
I came across an article of the same title by Kevin Galligan recently and I thought I could do something similar using a different approach. What if instead of using SAT Solvers, I use some kind of heuristic algorithm that could somehow “program” a large world of Game of Life to display an image after a few generations?

Related Keywords

Mona Lisa , Neil Armstrong , Eden States , John Horton Conway , Bojan Nikolic , Kevin Galligan , , Cellular Automata , Google Colab , Single Instruction Multiple Data , Test Pattern , மோனா லிசா , நீல் ஆம்ஸ்ட்ராங் , ஈடன் மாநிலங்களில் , ஜான் ஹார்டன் கான்வே , கெவின் கள்ளிகாண் , செல்லுலார் ஆட்டோமேட்டா , கூகிள் கோலாப் , ஒற்றை அறிவுறுத்தல் பல தகவல்கள் , சோதனை முறை ,

© 2025 Vimarsana