Applying AI to solve Sudoku
-
Updated
Mar 5, 2018 - Python
Applying AI to solve Sudoku
Sudoku solver by using AI approaches
Implement diagonal sudoku solver using naked twins, elimination, only choice strategy.
AI Agent that can solve the Sudoku puzzle
Solving every Sudoku puzzle: Constraint Propagation and Search algorithms in action
Solve the Sudoku Puzzle within 30 seconds by Constraint Propagation and Search
Playground for Artificial intelligence projects and exercises I come across.
Project: Diagonal Sudoku Solver | Artificial Intelligence Nanodegree | Udacity
Sudoku Solver implementation for "normal" and diagonal Sudoku. Project submission for Udacity's Artificial Intelligence Nanodegree Program.
Sudoku solver using the AI artificial intelligence concepts constraint propagation and depth-first search.
udacity aind project 1
Sudoku Solver. Using Naked Twins and Constraint Propagation techniques
CS 531 Course Assignments + Projects at OSU
Created an AI to solve Diagonal Sudokus using constraint propagation and search techniques. Additionally, taught the agent to use the Naked Twins advanced Sudoku strategy.
Created an AI to solve Diagonal Sudokus using constraint propagation and search techniques. Additionally, taught the agent to use the Naked Twins advanced Sudoku strategy.
CP and SMT model to solve the Present Wrapping Problem (PWP): given a wrapping paper roll of a certain dimen- sion and a list of presents, decide how to cut off pieces of paper so that all the presents can be wrapped. Consider that each present is described by the dimensions of the piece of paper needed to wrap it. Moreover, each necessary piece…
Udacity AIND - Solving a Sudoku using search and constrain propagation
Add a description, image, and links to the constraint-propagation topic page so that developers can more easily learn about it.
To associate your repository with the constraint-propagation topic, visit your repo's landing page and select "manage topics."