Mapping a set of random points to a uniform lattice
-
Updated
Oct 26, 2018 - Python
Mapping a set of random points to a uniform lattice
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.
Search, Knowledge, Uncertainty, Optimization, Learning, Neural Networks and Language.
Constraint-solver to solve the problem of Field Missions-UAV-Pilot Scheduling
an artificial intelligence project to solve the N-queen constraint satisfaction problem
A lightweight CNF SAT constraint encoder library
Example of algorithms used to solve distributed constraint problems
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!
Bio-ModelChecker: Using Bounded Constraint Satisfaction to Seamlessly Integrate Observed Behavior with Prior Knowledge of Biological Networks
Solve Sudoku with Python using the CSF approach
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."