coosld/tig-monorepo
1
0
Fork 0
mirror of https://github.com/tig-foundation/tig-monorepo.git synced 2026-02-21 10:27:49 +08:00
Code Issues Actions 1 Packages Projects Releases Wiki Activity

Update satisfiability challenge description

Browse Source
This commit is contained in:
FiveMovesAhead 2026-02-03 12:21:37 +00:00
parent df3d580f81
commit 277019e043
1 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
tig-challenges/src/satisfiability/README.md
View File

@ -58,6 +58,8 @@ When substituted into the Boolean formula, each clause will evaluate to True, th
# 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.
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
SAT has a vast range of applications in science and industry in fields including computational biology, formal verification, and electronic circuit design. For example: