Solve Sudoku with Python using the CSF approach
-
Updated
Feb 5, 2017 - Python
Solve Sudoku with Python using the CSF approach
An AI for solving Sudoku. 🤖 ⚡️
AI for the game Numbrix and Hidato by means of modelling it as a constraint-satisfication problem using BT, FC, GAC with MRV heuristic.
sudoku resolving using AI algorithms
Using CSP heuristics
Solving Sudoku puzzle with CSP
Homework Assignments for CSE 537 - Artificial Intelligence Spring 2018 in Stony Brook University under Prof. Niranjan Balasubramanian
A futoshiki solver tool using backtracking with some pruning methods.
A Kenken puzzle generator & solver
solving sudoku problems with csp
CSP Map Coloring
This project solves a Futoshiki Board given an input files using the least number of moves. Backtracking, forward checking, the mrv heuristic, and the degree heuristic was used.
Solving Class Scheduling problem using the CSP method.
This project is a sudoku-solver implement by Constraint satisfaction problem. We add the colour option to our sudoku problem as if the number of a place is bigger than other neighbours, the colour of that place must be higher in a given colour's priority. We use the Constraint satisfaction problem(CSP), as we said before, in additional apply deg…
second project at AUT Artificial Intelligence course (Fall 2020)
CSP-Sudoku solver
A simple solution to a Constraint Satisfaction Problem using forward checking and MRV heuristics
AUT Principles and Applications of Artificial Intelligence course (Fall 2020) projects
Add a description, image, and links to the mrv-heuristic topic page so that developers can more easily learn about it.
To associate your repository with the mrv-heuristic topic, visit your repo's landing page and select "manage topics."