News for hackers. Stuff that matters.
Re:Modern SAT solvers: fast, neat and underused by smallnamespace on Monday May 20, 2019 @12:27AM (#19957515)
From the article, a lot of the heuristics seems to revolve around and 1) which variables to try first 2) which learned clauses to keep in your set.

Assign scores and differentiate on those scores. This is (very loosely) how AlphaGo also works - you take a tree-based algorithm (MCTS) and then use neural nets to score the next node to expand.

There are no comments on this comment yet.