98.7.....7.6...8......5....4......3..9.6.........24..1.6.9..5......3..4......1..2;38692;GP;12_07
Comments on this puzzle extracted from the data base of potential hardest and heavily discussed in this thread pages 22-23.
the final solution for the puzzle is
985763214736412859214859367428195736391687425657324981162948573579236148843571692
Years ago, my code classified this puzzle as having a 2 rows 2 columns rank 0 logic. This should not have been. One condition to have a rank 0 logic of “free use” is to have no triple point in the truths, so, the crossing in the 2 rows 2 columns must be free, and this was not true in this sudoku.
However, as we will see, it works here despite one point 2 truths.
In this example, many solutions have been produced; I pick up part of them of general interest.
Several preliminary remarks.
remark 1: A valid SLG can not clear a candidate of the solution.This is trivial. No logical rule can destroy the solution. If a Sets/Links group can be built, leading to eliminations, these eliminations are always candidates not belonging to the solution.
This evidence can be used in 2 ways:
to build an active SLG (by hand or with a computer), saving wrong racks,
to check without Xudo if a SLG is valid.
remark 2: Xsudo is a kind of “brute force” applied to a set/links group. As in a multi-fish analysis, the results must be used with care.
In a rank 0 logic, eliminations done within the matrix of truths should not be seen as a result of the rank 0 logic.
remark 3: in a rank 0 logic, triple points with 2 links don’t destroy the logic of the proof. This is not the case with triple point having 2 truths.
Using a rank 0 logic with such triple points need more validation.
The pm at the start is the following
- Code: Select all
9 8 12345 |7 146 236 |12346 1256 3456
7 12345 6 |1234 149 239 |8 1259 3459
123 1234 1234 |12348 5 23689 |1234679 12679 34679
---------------------------------------------------------
4 1257 12578 |158 1789 5789 |267 3 5678
12358 9 123578 |6 178 3578 |247 2578 4578
6 357 3578 |358 2 4 |79 5789 1
---------------------------------------------------------
1238 6 123478 |9 478 278 |5 178 378
1258 1257 125789 |258 3 25678 |1679 4 6789
358 3457 345789 |458 4678 1 |3679 6789 2
the reduced pm for digits 1234 is the following
- Code: Select all
- - 1234+ |- 14+ 23+ |1234 12+ 34+
- 1234+ - |1234 14+ 23+ |- 12+ 34+
123 1234 1234 |1234+ - 23+ |1234+ 12+ 34+
----------------------------------------------
4 12+ 12+ |1+ 1+ - |2+ 3 -
123+ - 123+ |- 1+ 3+ |24+ 2+ 4+
- 3+ 3+ |3+ 2 4 |- - 1
----------------------------------------------
123+ - 1234+ |- 4+ 2+ |- 1+ 3+
12+ 12+ 12+ |2+ 3 2+ |1+ 4 -
3+ 34+ 34+ |4+ 4+ 1 |3+ - 2
The multi floors analysis shows a high potential for eliminations in this multi floors.
I show in details several solutions. One post is open for each solution to have easier discussion on a specific one later.
we will see in next posts
mix rows+columns + added cells proposed by ronk
MSLS proposed by David
MSLS proposed by JC Van Hay
and to conclude a summary of the rank 0 logic as I see it to-day