From 277019e043b2b9361f4f649c8f2c56734208d728 Mon Sep 17 00:00:00 2001 From: FiveMovesAhead Date: Tue, 3 Feb 2026 12:21:37 +0000 Subject: [PATCH] Update satisfiability challenge description --- tig-challenges/src/satisfiability/README.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/tig-challenges/src/satisfiability/README.md b/tig-challenges/src/satisfiability/README.md index cee7f08a..e42aecce 100644 --- a/tig-challenges/src/satisfiability/README.md +++ b/tig-challenges/src/satisfiability/README.md @@ -56,7 +56,9 @@ This assignment corresponds to the variable assignment $X1=False, X2=True, X3=Tr When substituted into the Boolean formula, each clause will evaluate to True, thereby this assignment is a solution as it satisfies all clauses. # Our Challenge -In TIG, the 3-SAT Challenge is based on the example above with configurable difficulty. Please see the challenge code for a precise specification. +In TIG, the 3-SAT Challenge is based on the example above with configurable difficulty. Please see the challenge code for a precise specification. + +Your algorithm does not return a solution; it calls `save_solution` as it runs. The **last** saved solution is evaluated. A valid solution is any assignment of True/False to the variables (one value per variable). The evaluated metric is **quality** (a fixed-point integer with 6 decimal places): quality is **1.0** if the assignment satisfies the formula (makes all clauses true) and **0** otherwise. # Applications