TL;DR
This paper presents software that searches for spaceships in Conway's Game of Life using advanced graph search algorithms, successfully discovering a new spaceship in a vast state space.
Contribution
It introduces a novel search method combining breadth first and iterative deepening techniques with bit-parallel algorithms, enabling discovery of new spaceships in large automaton state spaces.
Findings
Discovered a new 2c/7 spaceship in Life
Developed a search algorithm that efficiently explores large state spaces
Successfully searched 2^126 states to find the spaceship
Abstract
We describe software that searches for spaceships in Conway's Game of Life and related two-dimensional cellular automata. Our program searches through a state space related to the de Bruijn graph of the automaton, using a method that combines features of breadth first and iterative deepening search, and includes fast bit-parallel graph reachability and path enumeration algorithms for finding the successors of each state. Successful results include a new 2c/7 spaceship in Life, found by searching a space with 2^126 states.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.