Logic Life Search

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, but offers more flexibility than these. The difference in underlying search methods means that LLS may sometimes be slower than lifesrc to find the same solution, but in many cases with the right optimization it can also be very much faster.

Logic Life Search
Homepage Click here
Purpose Search for patterns
Created by Oscar Cunningham
Platform Unix; platform-independent

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 converting 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, and use LLS.
gollark: Do YOU want nonadministrative access to part of the secondary osmarks.tk™ server?
gollark: This is of course 22 heresy units of heresy.
gollark: Sadly, helloboi, their screenshot says windows, yes.
gollark: Satanic ubuntu?
gollark: I didn't say I was.
This article is issued from Conwaylife. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.