Logic Life Search

From LifeWiki
Revision as of 12:10, 30 January 2018 by Apple Bottom (talk | contribs) (New entry for Macbi's excellent tool)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
Logic Life Search
Homepage Click here
Purpose Search for patterns
Created by Oscar Cunningham
Platform Unix; platform-independent

Logic Life Search (abbreviated as LLS) is a program to search for patterns in Conway's Game of Life and other cellular automata by use of a SAT solver, written in Python. LLS is similar to lifesrc, WinLifeSearch and JavaLifeSearch; although slower, it offers more flexibility than these.

Mechanism

LLS works by converting pattern searches to boolean satisfiability (SAT) problems, then employing an external SAT solver (e.g. MiniSAT, Lingeling or Glucose) to solve the SAT problem, and converts the solution to RLE format. Although SAT solving is NP-complete, many practical problems can be solved swiftly by SAT solver tools, making this a viable approach to Life pattern searching.

Also see

  • Tutorials/LLS — for information on how to install, configure, test, and use LLS.
Retrieved from "https://conwaylife.com/w/index.php?title=Logic_Life_Search&oldid=43252"