Create your own Sudoku Solver using AI and Python

4.2
stars
30 ratings
Offered By
Coursera Project Network
2,160 already enrolled
In this Guided Project, you will:

Define the idea of a Constraint Satisfaction Problem

Implement how to obtain the candidate solutions in the Sudoku game

Implement the Backtracking algorithm to solve the Sudoku game

Clock2 hours
IntermediateIntermediate
CloudNo download needed
VideoSplit-screen video
Comment DotsEnglish
LaptopDesktop only

In this 1-hour long project-based course, you will create a Sudoku game solver using Python. This problem is an example of what is called a Constraint Satisfaction Problem (CSP) in the field of Artificial Intelligence. CSP is a mathematical problem that must satisfy a number of constraints or limitations all the time. In this project, You will use the Backtracking algorithm to solve CSPs, in a Sudoku game. Backtracking is a recursive algorithm that tries to build a solution incrementally, removing solutions that fail to satisfy the constraints. Eventually, you will be able to use the knowledge acquired from this project on far more complex projects that employ these technologies. Note: This course works best for learners who are based in the North America region. We’re currently working on providing the same experience in other regions.

Skills you will develop

Artificial Intelligence (AI)Constraint Satisfaction ProblemBacktrackingPython ProgrammingSearch Algorithm

Learn step-by-step

In a video that plays in a split-screen with your work area, your instructor will walk you through these steps:

  1. you will be able to define the idea of a Constraint Satisfaction Problem. You will identify the constraints of the Sudoku game and how humans play the sudoku game.

  2. You will be able to identify the idea of the Backtracking algorithm, and define how artificial intelligence uses Backtracking to solve the sudoku game.

  3. you will be able to use Python code to implement the initial structure of the Sudoku game. You will be able to implement three of four constraints of the Sudoku game.

  4. you will be able to use Python to implement the fourth rule of the Sudoku game. You will also identify how to move between cells in the Sudoku game.

  5. you will be able to use Python to implement the method that obtains the candidate solutions that do not violate the four constraints of the Sudoku game for any given cell.

  6. you will be able to define the difference between the assignment and deep copy in Python programming language. You will implement the recursive algorithm.

  7. you will be able to implement the Backtracking algorithm using recursion and will be able to define how the Backtracking algorithm can be used to solve the Sudoku game problem.

How Guided Projects work

Your workspace is a cloud desktop right in your browser, no download required

In a split-screen video, your instructor guides you step-by-step

Frequently asked questions

Frequently Asked Questions

More questions? Visit the Learner Help Center.