Difference between revisions of "Lifesrc"

From LifeWiki
Jump to navigation Jump to search
(New page: {{Software|name=lifesrc|purpose=Search for oscillators and spaceships|createdby=David Bell|platform=Platform-independent C|url=http://www.canb.auug.org.au/~dbell/}} '''Lifesrc'...)
 
(Added reference to Java version of lifesrc/WinLifeSearch)
Line 2: Line 2:
 
'''Lifesrc''' is [[David Bell]]'s [[Conway's Game of Life|Life]] search program for finding new [[oscillator]]s and [[spaceship]]s. It is a C implementation of an algorithm developed by [[Dean Hickerson]] in 6502 assembler. Many of the well-known oscillators and [[non-standard spaceship]]s in Life were found either by lifesrc or Hickerson's original program.
 
'''Lifesrc''' is [[David Bell]]'s [[Conway's Game of Life|Life]] search program for finding new [[oscillator]]s and [[spaceship]]s. It is a C implementation of an algorithm developed by [[Dean Hickerson]] in 6502 assembler. Many of the well-known oscillators and [[non-standard spaceship]]s in Life were found either by lifesrc or Hickerson's original program.
  
Although lifesrc itself is a command-line program, [[Jason Summers]] has made a graphical version called for Windows called [[WinLifeSearch]].
+
Although lifesrc itself is a command-line program, [[Jason Summers]] has made a graphical version called for Windows called [[WinLifeSearch]], or "WLS".
 +
 
 +
More recently, in 2012-13, [[Karel Suhajda]] developed a platform-independent Java version called [[JavaLifeSearch]], or "JLS".<ref>{{cite web|url=http://www.conwaylife.com/forums/viewtopic.php?f=9&t=990|title=JavaLifeSearch|author=Karel Suhajda|date=November 9, 2012|accessdate=September 21, 2015}}</ref>  JLS includes some new search options, notably the ability to prune the search space in the middle of a search by tracking the list of cells that have always been assigned the same state, either ON or OFF, in every previously-discovered solution.
  
 
The lifesrc algorithm is only useful for very small periods, as the amount of computing power required rises rapidly with increasing period. For most purposes, period 7 is the practical limit with current hardware.
 
The lifesrc algorithm is only useful for very small periods, as the amount of computing power required rises rapidly with increasing period. For most purposes, period 7 is the practical limit with current hardware.
Line 8: Line 10:
 
==External links==
 
==External links==
 
{{LinkLexicon|lex_l.htm#lifesrc}}
 
{{LinkLexicon|lex_l.htm#lifesrc}}
 +
 +
==References==
 +
<references/>

Revision as of 20:41, 21 September 2015

lifesrc
Homepage Click here
Purpose Search for oscillators and spaceships
Created by David Bell
Platform Platform-independent C

Lifesrc is David Bell's Life search program for finding new oscillators and spaceships. It is a C implementation of an algorithm developed by Dean Hickerson in 6502 assembler. Many of the well-known oscillators and non-standard spaceships in Life were found either by lifesrc or Hickerson's original program.

Although lifesrc itself is a command-line program, Jason Summers has made a graphical version called for Windows called WinLifeSearch, or "WLS".

More recently, in 2012-13, Karel Suhajda developed a platform-independent Java version called JavaLifeSearch, or "JLS".[1] JLS includes some new search options, notably the ability to prune the search space in the middle of a search by tracking the list of cells that have always been assigned the same state, either ON or OFF, in every previously-discovered solution.

The lifesrc algorithm is only useful for very small periods, as the amount of computing power required rises rapidly with increasing period. For most purposes, period 7 is the practical limit with current hardware.

External links

References

  1. Karel Suhajda (November 9, 2012). "JavaLifeSearch". Retrieved on September 21, 2015.