Programming, Sudoku, Python3, Backtracking, Search.
spots, and the number of possible values for each spot are spot= [a₀,a₁, …,an₋₁]. To fill each spot, we need to search the possibility tree. The search tree will have a height of n, at the first level, the width of the tree will be a₀, second level a₁, and as such each level will have a total nodes