Introduction
You must follow the instructions within, and then download
and submit this specific notebook (.ipynb file). Failure to do this will result
in zero marks.
A Sudoku puzzle is an n×n grid with some numbers initially
placed – these cannot 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 are two examples of Sudoku grids, an
easier 4x4 grid and a more difficult 9x9 grid.
Programming language to use is Python. All necessary codes and assignment details are attached
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
27 | 28 | 29 | 30 | 1 | 2 | 3 |
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 | 29 | 30 | 31 |