Programming, Sudoku, Python3, Backtracking, Search.
candidates. Probabilitically speaking, if there is one spot in the remaining opening spots that has no candidate at all, then we prune this branch instead of wasting our time and effort to first try others spots and then found out that it is an dead end. Time Complexity Assume we have n empty