Tutorials/LLS - Revision history

Qqd: Replaced instructions for Cygwin with instructions for WSL

2026-09-25T16:35:39Z

Replaced instructions for Cygwin with instructions for WSL

← Older revision		Revision as of 16:35, 25 September 2026
Line 6:		Line 6:
	Are you a Windows user? If so, you'll need a Unix-like environment.		Are you a Windows user? If so, you'll need a Unix-like environment.

	# Start by installing ~~[http~~:~~//cygwin.com/ Cygwin]~~		1. Start by installing WSL (Windows Subsystem for Linux) by running the following in your command prompt (the installation can take several minutes):
	~~# When prompted to choose which packages to~~ install, ~~make sure <tt>gcc-core</tt>, <tt>git</tt>, <tt>gzip</tt>, <tt>make</tt>, <tt>python3</tt>~~, and ~~<tt>tar</tt> are all selected.~~		wsl --install
	~~# If prompted,~~ confirm ~~that you also want to install any required prerequisites~~.		2. Once WSL is installed, open WSL and create a user account with a username and password, and confirm the prompt regarding collection of platform metrics.

	If you already have ~~Cygwin~~ installed, you obviously do not need to install it again, but make sure all the packages listed above are installed.		3. Update the package list using the following command:
			$ sudo apt update
			4. Install the following packages using the following command:
			$ sudo apt install -y build-essential git gzip python3 tar

			If you already have WSL installed, you obviously do not need to install it again, but make sure all the packages listed above are installed.

	=== Installing LLS ===		=== Installing LLS ===

ElijahKen: Removing a confusing line "and run configure.sh" from the kissat build instructions section. That step happened later, and with a better explanation.

2026-09-02T11:20:18Z

Removing a confusing line "and run configure.sh" from the kissat build instructions section. That step happened later, and with a better explanation.

← Older revision		Revision as of 11:20, 2 September 2026
Line 88:		Line 88:
	Resolving deltas: 100% (443/443), done.</pre>		Resolving deltas: 100% (443/443), done.</pre>

	Now enter kissat's directory~~, and run <tt>configure.sh</tt>~~:		Now enter kissat's directory:

	<pre>$ cd kissat		<pre>$ cd kissat

TheWayOfTheCon: Adding new section, rearranged some stuff

2026-08-05T00:46:31Z

Adding new section, rearranged some stuff

Show changes

Muzik at 22:30, 13 September 2025

2025-09-13T22:30:16Z

Show changes

Dvgrn: "backtracking" -> "rewinding"

2024-12-01T16:14:05Z

"backtracking" -> "rewinding"

← Older revision		Revision as of 16:14, 1 December 2024
Line 430:		Line 430:
	There's one thing you should (probably) not do, and that's start a LifeWiki article on your discovery. If it's notable, chances are good someone else will.		There's one thing you should (probably) not do, and that's start a LifeWiki article on your discovery. If it's notable, chances are good someone else will.

	==Predecessor searches (~~backtracking~~)==		==Predecessor searches (rewinding)==
	Another thing that LSS is very good at is searching for predecessors. Suppose you have a pattern for which no predecessor is known, e.g.,		Another thing that LSS is very good at is searching for predecessors. Suppose you have a pattern for which no predecessor is known, e.g.,

Line 572:		Line 572:
	2b2obo$5bo6bob3o$2bob3ob4obobobobo$12bo$bobobo5bo2b2ob2o!		2b2obo$5bo6bob3o$2bob3ob4obobobobo$12bo$bobobo5bo2b2ob2o!
	}}		}}
	Notice the "0" toward the center of the "minus-two" generation's target pattern, in the input file above -- and also the extra "0"s in the corners. Replace the central "0" with a "1" and a different predecessor will be generated. When ~~backtracking~~ patterns through multiple generations, it's often useful to experiment with additional constraints like this, to make sure that there are multiple possible choices of ancestor and reduce the likelihood of arriving at a [[Garden of Eden]] dead end.		Notice the "0" toward the center of the "minus-two" generation's target pattern, in the input file above -- and also the extra "0"s in the corners. Replace the central "0" with a "1" and a different predecessor will be generated. When rewinding patterns through multiple generations, it's often useful to experiment with additional constraints like this, to make sure that there are multiple possible choices of ancestor and reduce the likelihood of arriving at a [[Garden of Eden]] dead end.

	A 16x16 pattern's predecessor seems to have a tendency to be larger than it is, by about one cell on each side. That's a very rough average, though, not necessarily true in any specific case! Larger patterns may have to add two rows or columns of cells along each edge to enable a solution to be found.		A 16x16 pattern's predecessor seems to have a tendency to be larger than it is, by about one cell on each side. That's a very rough average, though, not necessarily true in any specific case! Larger patterns may have to add two rows or columns of cells along each edge to enable a solution to be found.

Dvgrn: Add an initial section on LLS predecessor searches

2024-11-30T03:07:17Z

Add an initial section on LLS predecessor searches

Show changes

Dvgrn: /* Finding an alien (2,1)c/3 spaceship */ removed an extraneous period. (That wasn't supposed to be a "./python" for some kind of Linux compatibility, was it? There's nothing similar in the next code block.)

2024-03-25T13:31:54Z

Finding an alien (2,1)c/3 spaceship: removed an extraneous period. (That wasn't supposed to be a "./python" for some kind of Linux compatibility, was it? There's nothing similar in the next code block.)

← Older revision		Revision as of 13:31, 25 March 2024
Line 363:		Line 363:

	<pre>		<pre>
	$ .python lls -s p3 x2 y1 -b 6 6 -r pB1-c2345678/S012345678 -p ">0" -p "<=5"		$ python lls -s p3 x2 y1 -b 6 6 -r pB1-c2345678/S012345678 -p ">0" -p "<=5"

	Getting search pattern...		Getting search pattern...

DroneBetter: relink Catagolue object page with cata template

2023-06-03T15:29:44Z

relink Catagolue object page with cata template

← Older revision		Revision as of 15:29, 3 June 2023
Line 423:		Line 423:
	==Success -- now what?==		==Success -- now what?==
	Let's assume that you have run your own search, and found something new and exciting. What now? You may want to report your discovery; perhaps it's known, perhaps not. Here are some good places to do so:		Let's assume that you have run your own search, and found something new and exciting. What now? You may want to report your discovery; perhaps it's known, perhaps not. Here are some good places to do so:
	~~[[https://catagolue.hatsya.com/~~object\|The Catagolue object identification page]] (paste in your RLE to see whether it's already been discovered in any censuses or has a name or article)		{{cata\|object\|The Catagolue object identification page}} (paste in your RLE to see whether it's already been discovered in any censuses or has a name or article)
	{{LinkForumThread\|f=2\|t=2031\|title=Spaceship Discussion Thread}}		{{LinkForumThread\|f=2\|t=2031\|title=Spaceship Discussion Thread}}
	{{LinkForumThread\|f=2\|t=1437\|title=Oscillator Discussion Thread}}		{{LinkForumThread\|f=2\|t=1437\|title=Oscillator Discussion Thread}}

Confocal: /* Installing a SAT solver */ add link

2023-03-30T19:32:00Z

Installing a SAT solver: add link

← Older revision		Revision as of 19:32, 30 March 2023
Line 68:		Line 68:

	===Installing a SAT solver===		===Installing a SAT solver===
	LLS works by converting a pattern search problem into a boolean satisfiability (SAT) problem and solving that using a SAT solver tool, so you'll need a SAT solver.		LLS works by converting a pattern search problem into a boolean satisfiability (SAT) problem and solving that using a [[SAT solver]] tool, so you'll need a SAT solver.

	LLS currently supports many SAT solvers, but we'll focus on kissat and lingeling in this tutorial, as they appear to work best across different platforms, including Windows/Cygwin. At the date of writing, the fastest SAT solver freely available is [https://github.com/arminbiere/kissat kissat].		LLS currently supports many SAT solvers, but we'll focus on kissat and lingeling in this tutorial, as they appear to work best across different platforms, including Windows/Cygwin. At the date of writing, the fastest SAT solver freely available is [https://github.com/arminbiere/kissat kissat].
Line 216:		Line 216:
	</div>		</div>
	</div>		</div>

	==First steps==		==First steps==

Dvgrn: taking Macbi's suggestion and including kissat build instructions in the LLS tutorial

2023-02-04T13:52:41Z

taking Macbi's suggestion and including kissat build instructions in the LLS tutorial

@@ Line 48: / Line 48: @@
 ===Using the development version===
 New features are first made in the "develop" branch of the program. By default, you're using the "master" branch; use the "git checkout" command to switch to a different one:{{refn|group=note|Despite the name, this is a local command that does not interact with the remote repository on GitLab.}}
 <pre>
@@ Line 68: / Line 70: @@
 LLS works by converting a pattern search problem into a boolean satisfiability (SAT) problem and solving that using a SAT solver tool, so you'll need a SAT solver.
-LLS currently supports many SAT solvers, but we'll focus on Lingeling in this tutorial, as it appears to work best across different platforms, including Windows/Cygwin. At the date of writing, the fastest SAT solver freely available is [https://github.com/arminbiere/kissat kissat].
+LLS currently supports many SAT solvers, but we'll focus on kissat and lingeling in this tutorial, as they appear to work best across different platforms, including Windows/Cygwin. At the date of writing, the fastest SAT solver freely available is [https://github.com/arminbiere/kissat kissat].
 ====Installing Lingeling====
 Download Lingeling from [https://github.com/arminbiere/lingeling]
 Start by "cloning" the code so you'll have a full copy (don't worry, this'll only take a few seconds):
@@ Line 148: / Line 214: @@
 You also need to tell LLS to use lingeling as its default solver. Go to the file <tt>logic-life-search/settings.py</tt> and change the 'solver' line to read <tt>solver = "lingeling"</tt>.
 ==First steps==