Create your own Sudoku Solver using AI and Python

4.2
43件の評価
提供:
Coursera Project Network
2,593人がすでに登録済みです
このガイド付きプロジェクトでは、次のことを行います。

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
Intermediate中級
Cloudダウンロード不要
Video分割画面ビデオ
Comment Dots英語
Laptopデスクトップのみ

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.

あなたが開発するスキル

  • Artificial Intelligence (AI)
  • Constraint Satisfaction Problem
  • Backtracking
  • Python Programming
  • Search Algorithm

ステップバイステップで学習します

ワークエリアを使用した分割画面で再生するビデオでは、講師がこれらの手順を説明します。

  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.

ガイド付きプロジェクトの仕組み

ワークスペースは、ブラウザに完全にロードされたクラウドデスクトップですので、ダウンロードは不要です

分割画面のビデオで、講師が手順ごとにガイドします

レビュー

CREATE YOUR OWN SUDOKU SOLVER USING AI AND PYTHON からの人気レビュー

すべてのレビューを見る

よくある質問

よくある質問

さらに質問がある場合は、受講者ヘルプセンターにアクセスしてください。