Programming, Sudoku, Python3, Backtracking, Search.
all numbers form 1 to ‘n’ Each sub-grid ( √(n)×√(n)) has all numbers form 1 to n Only all constraint are satisfied can we have a valid candidate. How many possible candidates here? Suppose we have an empty table, the brute force is to try 1 to n at each grid, we have possible solution space of nⁿ².