From 59dc422de73e6653aeaa739dafd26b82f219519a Mon Sep 17 00:00:00 2001 From: Hitoshi Togasaki Date: Tue, 19 Jan 2021 01:19:07 +0900 Subject: [PATCH] Update README.md --- README.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index 03e596e..d563d3b 100644 --- a/README.md +++ b/README.md @@ -11,6 +11,7 @@ I have implemented the core SAT Solver algorithms and techniques in `screwsat`. - CDCL(Conflict-Driven-Clause-Learning) - Back Jump - Two-Literal-Watching +- VSIDS The performance of `screwsat` isn't as good as other modern sat solvers. But you can grasp some important points of SAT Solver from `screwsat`(I hope). @@ -174,4 +175,4 @@ fn main() { This code is really inspired by his good simple code [not522's SAT Solver](https://github.com/not522/CompetitiveProgramming/blob/master/include/math/sat.hpp) ### Contribution -Contributions and feedbacks are welcome. (e.g., fix typo and tedious code and my English, report bugs/issues, **GIVE ME GITHUB STARS**) \ No newline at end of file +Contributions and feedbacks are welcome. (e.g., fix typo and tedious code and my English, report bugs/issues, **GIVE ME GITHUB STARS**)