gfind
gfind is a program by David Eppstein which uses de Bruijn graphs to search for new spaceships. It was with gfind that Eppstein found the weekender, and Paul Tooke later used it to find the dragon.
| gfind | |
| Homepage | Click here |
|---|---|
| Purpose | Searching for spaceships |
| Created by | David Eppstein |
| Platform | Platform-independent C |
Also see
- Tutorials/gfind
- qfind
- zfind
gollark: Plus algebraic data types.
gollark: Meanwhile, FP languages can generally do it in as little as:```haskelldata Bees = ApioBee Integer String deriving (Eq, Show, Ord)```or whatever.
gollark: If you want to declare a type with equality and hashing and other such apioforms, you'll need an entire file of rather a lot of apiocode.
gollark: It's quite verbose and annoying.
gollark: You could try Clojure or Scala or Kotlin or Apioforms or something.
External links
- Gfind at the Life Lexicon
Source code
- gfind.c -- C source code
- Adapting gfind (discussion thread) at the ConwayLife.com forums -- Paul Tooke's modified version
Documentation
- Searching for Spaceships -- David Eppstein's paper describing gfind
- EricG (January 21, 2012). Re: How to use Gfind? (discussion thread) at the ConwayLife.com forums -- description of how to run gfind
Results
- Spaceships in Life-like cellular automata (discussion thread) at the ConwayLife.com forums
- Online Database of Unsuccessful GFIND Searches (discussion thread) at the ConwayLife.com forums
This article is issued from Conwaylife. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.