https://github.com/strake/yfind
Search program for gliders (periodic translating patterns) in cellular automata
https://github.com/strake/yfind
cellular-automata search
Last synced: 3 months ago
JSON representation
Search program for gliders (periodic translating patterns) in cellular automata
- Host: GitHub
- URL: https://github.com/strake/yfind
- Owner: strake
- License: bsd-3-clause
- Created: 2018-05-01T07:56:10.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2019-04-08T23:41:42.000Z (over 6 years ago)
- Last Synced: 2025-04-05T02:15:21.718Z (6 months ago)
- Topics: cellular-automata, search
- Language: Haskell
- Homepage:
- Size: 56.6 KB
- Stars: 3
- Watchers: 2
- Forks: 0
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# yfind
Search for translating patterns (a.k.a. spaceships) in cellular automata.
## Building
You need [git](https://git-scm.com/), [stack](https://haskell-lang.org/get-started), and [z3](https://github.com/Z3Prover/z3).
```sh
git clone https://github.com/strake/yfind
chdir yfind
stack build
```
## Using
For example, to search the rule B2o45/S2o45 for spaceships of maximum size (8,8) and speed (1,1)/3:
```sh
stack exec -- yfind -rB2o45/S2o45 -s'(8,8)' -v'(1,1)/3'
```