Sina-Baharlou/GSAT-WalkSAT
Different heuristics and random initialization methods applied to GSAT and WalkSAT algorithms
This project helps researchers and students in computer science evaluate and compare different strategies for solving complex Boolean satisfiability problems. It takes a Boolean formula in DIMACS format and shows how various random initialization methods and heuristics impact the algorithm's ability to find a solution and its running time. This tool is ideal for those studying or working with SAT solvers.
No commits in the last 6 months.
Use this if you need to understand how different random initializations and heuristic choices affect the performance of GSAT and WalkSAT algorithms for solving Boolean satisfiability problems.
Not ideal if you are looking for a general-purpose, production-ready SAT solver for real-world applications, as its primary focus is on algorithmic comparison and research.
Stars
9
Forks
1
Language
C++
License
—
Category
Last pushed
Jul 08, 2022
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/Sina-Baharlou/GSAT-WalkSAT"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
TimefoldAI/timefold-solver
The open source Solver AI for Java and Kotlin to optimize scheduling and routing. Solve the...
TimefoldAI/timefold-quickstarts
Get started with Timefold quickstarts here. Optimize the vehicle routing problem, employee...
apache/incubator-kie-optaplanner-quickstarts
OptaPlanner quick starts for AI optimization: many use cases shown in many different technologies.
optapy/optapy
OptaPy is an AI constraint solver for Python to optimize planning and scheduling problems.
berv-uni-project/scheduler-op
This is scheduler that implements 3 algorithm.