SatSolver%20Tournament%20Results

1
SatSolver Tournament Results

• CS 402

2
The Tournament

• Generators
• 39 sets of CNF generated (total 78)
• SatSolvers
• 31 Solvers
• Range from solving 1 to solving all but 9 (69 in
  total) CNFs in 15 seconds

3
Results
4
Results (without outlier)
5
TOP PERFORMERS
6
Results

• Top Finishers
• Honorable Mention, theparaDoxguy07
• Solved 69 CNFs with average time 7017ms
• v3.5, Build 110127. WalkSat based, with 50 p.
  Features T-F Stat Initial model, QuickCheck()
  QuickUpdate() and Dynamic Mixer with tolerance
  40000, 5 increment and 60 limit)
• Solved the most amount of CNF sentences within
  the time limit

7
Results

• Top Finishers
• 3rd place, Anand Atreya
• Solved 64 CNFs in average time of 4392ms
• WalkSAT variant.

8
Results

• Top Finishers
• 2nd place, Lan Dong
• Solved 66 CNFs in average time of 4344ms
• This sat-solver uses WalkSat with varying p
  (probabality to flip the symbol randomly vs. flip
  the symbol which will maximize the number of
  satisfied clauses)

9
Results

• Top Finishers
• 1st place, Brendan Miller
• Solved 68 CNFs with average time 3436ms
• This sat-solver uses a slightly modified version
  of WalkSat, returning the solution or the best
  one when time runs out.
• Best Average Time Per CNF sentence

10
Results

• Hardest CNFs
• Raymond Lanihan
• Only Kent Cheng was able to solve the CNF
• Reduces the Japanese SoDuko number puzzle into
  CNF formulas, every puzzle has a solution. How it
  generates the CNFs is explained in the readme
• Frank Macreery and Sameer Shariff
• No one was able to solve their CNFs