Hashlife
Algorithm for speeding up cellular automaton simulations
Hashlife is a memoized algorithm for computing the long-term fate of a given starting configuration in Conway's Game of Life and related cellular automata, much more quickly than would be possible using alternative algorithms that simulate each time step of each cell of the automaton. The algorithm was first described by Bill Gosper in the early 1980s while he was engaged in research at the Xerox Palo Alto Research Center.
Nº Q3027624 ★
Common · Knowledge
Hashlife
Algorithm for speeding up cellular automaton simulations
Hashlife is a memoized algorithm for computing the long-term fate of a given starting configuration in Conway's Game of Life and related cellular automata, much more quickly than would be possible using alternative algorithms that simulate each time step of each cell of the automaton. The algorithm was first described by Bill Gosper in the early 1980s while he was engaged in research at the Xerox Palo Alto Research Center.
From Wikipedia
Hashlife is a memoized algorithm for computing the long-term fate of a given starting configuration in Conway's Game of Life and related cellular automata, much more quickly than would be possible using alternative algorithms that simulate each time step of each cell of the automaton. The algorithm was first described by Bill Gosper in the early 1980s while he was engaged in research at the Xerox Palo Alto Research Center. Hashlife was originally implemented on Symbolics Lisp machines with the aid of the Flavors extension.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
Conway's Game of Life
Two-dimensional cellular automaton devised by J. H. Conway in 1970
Nº Q244615 ★★★★
Not listed
-
Linear probing
Collision resolution scheme
Nº Q2988094 ★
Not listed
-
R
Rabin–Karp algorithm
String searching algorithm
Nº Q1384131 ★
Not listed
-
Bill Gosper
American mathematician, programmer/hacker
Nº Q862150 ★
Not listed
-
The Game of Life
Board game
Nº Q1319521 ★★★
Not listed
-
G
Gale–Shapley algorithm
Algorithm for solving the stable matching problem
Nº Q65123731 ★★
Not listed