Sudoku solver by using AI approaches
-
Updated
Jun 19, 2019 - Python
Sudoku solver by using AI approaches
Project: Diagonal Sudoku Solver | Artificial Intelligence Nanodegree | Udacity
Implement diagonal sudoku solver using naked twins, elimination, only choice strategy.
Sudoku Solver implementation for "normal" and diagonal Sudoku. Project submission for Udacity's Artificial Intelligence Nanodegree Program.
udacity aind project 1
Udacity AIND - Solving a Sudoku using search and constrain propagation
project submitted at AIND (May cohort)
Using an AI agent to solve a diagonal sudoku
solve a diagonal sudoku game
Solving every Sudoku puzzle: Constraint Propagation and Search algorithms in action
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.
My solution of Udacity AI nanodegree project1 Sudoku Solver
Sudoku Solver
Solving Sudoku (diagonally as well) using Depth First Search and Constraint Propagation
Create an AI agent to solve Sodoku by implementing constraint propagation
Introductory Project for the AI Nanodegree: Diagonal Sudoku Solver
Implementation of an AI agent to solve Sudoku
Analysis of the Sudoku Game using Constraint Propagation with Back Tracking and Relaxation Labelling
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."