Create your own Sudoku Solver using AI and Python

4.2
별점
43개의 평가
제공자:
Coursera Project Network
2,585명이 이미 등록했습니다.
학습자는 이 안내 프로젝트에서 다음을 수행하게 됩니다.

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의 최상위 리뷰

모든 리뷰 보기

자주 묻는 질문

자주 묻는 질문

궁금한 점이 더 있으신가요? 학습자 도움말 센터를 방문해 보세요.