Programming, Sudoku, Python3, Backtracking, Search.
state how backtracking can be optimized with search prunning in CSP. Suppose we are at level 2 with state s=(s_0, s_1, and if we know that this state will never lead to valid solution, we do not need to traverse through this branch but backtrack to previous state at level one. This will end up