Solving Sudoku puzzles using Python. A recursive solution that filters options to fill empty cells recursively and backtracks when necessary.

Computer Science learning blog

Implementing a recursive Sudoku solver in Python. The first step is to generate possible candidates for each empty cell by scanning rows, columns and sub-grids. Whenever there’s only one possible candidate, the cell is filled with that value. Next, the solver guesses one value and the process continues recursively until a valid solution is found.

Numpy used to create a tic-tac-toe grid. Numpy array views were used to address the same elements from different arrays.