Simple Sudoko solver written in Python
-
Updated
Dec 2, 2021 - Python
Simple Sudoko solver written in Python
Implementation of CSP heuristics and backtracking algorithm for magnet puzzle in Rust.
The Radio Link Frequency Assignment Problem
Solving resource management problem using backtracking,back jumping and forward checking. Edit Add topics
Programme de résolution de puzzles de types "Picross" grâce à un algorithme de programmation dynamique, puis algorithme d'exploration partielle d'un arbre d'énumération (type algorithme de retour arrière avec "forward checking")
Golomb Ruler using Constraint Satisfaction Problem
kakuro (simple version) solver as CSP problem - Artificial Intelligence course project - Spring 2021
A CSP approach to solve magnet puzzle problem
Implemented a constraint satisfaction problem solver using backtracking and forward checking.
Project focuses on optimised implementation of Backtracking and Forward Checking algorithms in order to find all solutions of the N Queens problem
CSP-Sudoku solver
A university project for AI class that Solve Sudoku usinig CSP algorithms like backtracking and forwardchecking,and for heuristic uses MRV and Degree
Implementación de algoritmos de búsqueda con restricciones para resolver crucigramas, aplicando backtracking y forwardchecking. Desafío de IA con niveles de dificultad crecientes y validación de resultados en un proyecto práctico.
This is a homework about Formulating a game called "Magnet Puzzle" into CSP, then using Backtracking, Forward Checking to solve it. Various heuristics such as MRV, LCV, Arc consistency (AC3) is used to improve the searching performance. This homework is a part of many projects in a Fundamentals to AI course @ FUM.
A futoshiki solver tool using backtracking with some pruning methods.
🗓️ Fundamentals of AI, 4th and 5th laboratory. Schedule making app (using 🧬 genetic, minimum remaining values, power heuristics, least constraining values and forward-checking algorithms).
Made for COSC4368 initally, modified the program to be general-solution and work with any domain or constraint set provided. Obviously the program would need to be optimized if a highly efficient algorithm is needed for a set of constraints.
The solver finds a solution to the problem given the constraints. No solution may be found if all the constraints are not satisfied.
Implementation of constraint satisfaction problem algorithms to solve the radio link frequency assignment problem - rlfap
Add a description, image, and links to the forward-checking topic page so that developers can more easily learn about it.
To associate your repository with the forward-checking topic, visit your repo's landing page and select "manage topics."