留学生作业代写do not hesitate to contact me!
WeChat：lovexc60
A sudoku is an n×n grid (normally 9×9) with some numbers initially placed – these cannot
In this assignment you will implement an AI that can solve 9×9 sudoku puzzles using
Your code will be subject to automated testing on example grids which have various
Download and extract the sudoku.zip file on this page, and open sudoku.ipynb to begin.
You must submit your completed Jupyter notebook (.ipynb) file.
• You should restart the kernel and run all cells before submission.
• You must not delete or modify any of the blank test cells.
• You do not have to write your code in the Jupyter environment. You are welcome to
Additionally submit any other files as required to get your solution to work, or as specified
be changed. The grid is broken down into sub-blocks of equal size. Solving the puzzle
requires finding numbers from 1 to n such that each number appears exactly once in each
row, column and sub-block or declaring that the Sudoku is unsolvable. Below is an
example of a 9×9 sudoku.
search algorithms that you have seen in the unit so far (Breadth- and depth-first search,
Heuristic search, informed search: Greedy, A* search, local search, or any other method
you deem suitable).
difficulties. More details can be found in the Jupyter Notebook file.
Ensure you read the guidelines carefully.
write your solution in another IDE, but you must copy it across and test it within the
Jupyter notebook before submission.
in the notebook (e.g. readme files).
