by **rjamil** » Sat Oct 23, 2021 1:39 am

Hi MM,

Well, as per the definition of Brute-Force algorithm, search all 1 to 9 values for each empty/unsolved cell without deduct any value from unsolved cell's possible candidates/values.

Added as on 20211024:

Please treat my above statement for Brute-Force as 'strong opinions, weakly held'.

Since, an empty Sudoku puzzle is considered as a combination of 81 integers long password. However, there are some constraints involve, i.e., to fill a 9×9 grid with numbers so that each row, column and 3×3 box contain all of the digits between 1 and 9 only once.

Similarly, if a Sudoku puzzle has some given clues then, the remaining empty cells (i.e., 81 - given clue cells) need to be searched for all digits between 1 to 9 without applying any deduction logic.

Note that a logic is more than that a pre-defined constraint.

R. Jamil