Back-Tracking
Question 1 |
Which of the following is a right paradigm for solving the popular (Chinese) Sudoku problem?
Backtracking | |
Branch and Bound | |
Dynamic Programming | |
None of the above |
Question 1 Explanation:
The standard recursive approach for Sudoku (pick a cell, enumerate all values, and recurse) is a great example of backtracking, which is the paradigm that best describes this algorithm.