A lightweight CNF SAT constraint encoder library
-
Updated
Jan 16, 2023 - Python
A lightweight CNF SAT constraint encoder library
Solve Sudoku with Python using the CSF approach
Search, Knowledge, Uncertainty, Optimization, Learning, Neural Networks and Language.
Bio-ModelChecker: Using Bounded Constraint Satisfaction to Seamlessly Integrate Observed Behavior with Prior Knowledge of Biological Networks
Example of algorithms used to solve distributed constraint problems
an artificial intelligence project to solve the N-queen constraint satisfaction problem
Constraints solving (sequencing, priority) as a command line tool. Type your constraints in simple plain text. Generation of Graphviz compatible documents that can be rendered as a diagram!
Implementation of a generalized Constraint Satisfaction Problem, alongside a backtracking solver with MAC, min-remaining-value, and least-constraining-value heuristics. Applied to map coloring, the N-Queens Problem, and Circuit Board design. Also an implementation of a min-conflicts local search that is ideal for the N-Queens.
Mapping a set of random points to a uniform lattice
Sudoku Solver is a repository dedicated to the development and benchmark of famous and novel approaches to solve Sudoku puzzles up to 17 clues
Constraint-solver to solve the problem of Field Missions-UAV-Pilot Scheduling
Add a description, image, and links to the constraint-satisfaction topic page so that developers can more easily learn about it.
To associate your repository with the constraint-satisfaction topic, visit your repo's landing page and select "manage topics."