AI Chat AI Image Generator AI Video Text to Speech

Searching for Spaceships

04/10/2000

∙

by David Eppstein, et al.

∙

∙

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.

page 2

page 5

research

∙ 02/20/2018

Higher-Dimensional Timed Automata

We introduce a new formalism of higher-dimensional timed automata, based...

0 Uli Fahrenberg, et al. ∙

research

∙ 07/18/2020

Object Tracking by Least Spatiotemporal Searches

Tracking a car or a person in a city is crucial for urban safety managem...

30 Zhiyong Yu, et al. ∙

research

∙ 02/16/2020

Advanced BIT* (ABIT*): Sampling-Based Planning with Advanced Graph-Search Techniques

Path planning is an active area of research essential for many applicati...

0 Marlin P. Strub, et al. ∙

research

∙ 12/03/2020

Reconstructing cellular automata rules from observations at nonconsecutive times

Recent experiments by Springer and Kenyon have shown that a deep neural ...

0 Veit Elser, et al. ∙

research

∙ 08/31/2021

Graphs where Search Methods are Indistinguishable

Graph searching is one of the simplest and most widely used tools in gra...

0 Matjaž Krnc, et al. ∙

research

∙ 04/21/2020

On the Performance of Hybrid Search Strategies for Systematic Literature Reviews in Software Engineering

Context: When conducting a Systematic Literature Review (SLR), researche...

0 Erica Mourão, et al. ∙

research

∙ 08/20/2023

Computing backwards with Game of Life, part 1: wires and circuits

Conway's Game of Life is a two-dimensional cellular automaton. As a dyna...

0 Ville Salo, et al. ∙