Does Using Brute-Force to solve a puzzle make it invalid

Everything about Sudoku that doesn't fit in one of the other sections

Re: Does Using Brute-Force to solve a puzzle make it invalid

Postby Mathimagics » Fri Oct 22, 2021 11:01 pm

rjamil wrote:setting up a list of valid candidate values at initial puzzle state and/or after each step, instead of all 1 to 9 values, will violate brute-force definition and should be called T&E / guessing algorithm.

Oh, deary me! :cry:

This is only true if you insist on a definition of "brute force" for which we have generally disagreed, as reflected in the discussion above ...
User avatar
Mathimagics
2017 Supporter
 
Posts: 1870
Joined: 27 May 2015
Location: Canberra

Re: Does Using Brute-Force to solve a puzzle make it invalid

Postby 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
rjamil
 
Posts: 669
Joined: 15 October 2014
Location: Karachi, Pakistan

Previous

Return to General