## The tridagon rule

Advanced methods and approaches for solving Sudoku puzzles

### Re: The tridagon rule

.
Resilience of the non-degenerate tridagon pattern

I had a few questions about it, because it had an unusually high proportion of puzzles in B6B.
I went back in time and checked his previous two collections:
They also have unusually high proportions of puzzles in B6B.

But what I had completely overlooked and what there's in common between the three collections is a very high proportion of puzzles with a non-degenerate tridagon (with guardians): 100%, 99.97% and 97.01% resp.

The result is, my questions in the "hardest" thread about the unusual BpB ratings were misguided by my idea that they could mainly result from the search for high SER.
Indeed, I now think they result mainly from the technique of vicinity search.

Starting from puzzles with a non-degenerate tridagon, "many" nearby ones will also have this non-degenerate pattern. Said otherwise, the non-degenerate tridagon pattern is very resilient to "small" changes of givens (even without counting all the trivial isomorphisms).

(For puzzles in T&E(3), this high resilience may also explain why so many puzzles with a non-degenerate tridagon have been found so fast after the first few ones.)

There remains to explain why the presence of a non-degenerate tridagon AND a high SER favours a high BpB, but at least this is easier to imagine than just a high value of the SER (because this explanation alone would contradict our previous vague correlation results).

.
denis_berthier
2010 Supporter

Posts: 4045
Joined: 19 June 2007
Location: Paris

### Re: The tridagon rule

.
All the puzzles in mith's max-expand collection (http://forum.enjoysudoku.com/t-e-3-puzzles-split-from-hardest-sudokus-thread-t40514.html) have a non-degenerate tridagon.

I had previously shown that all the known minimal puzzles in T&E(3) have a non-degenerate tridagon and at that time, I didn't care to look beyond the minimals.

My new calculations allow to conclude that all the known* puzzles in T&E(3) have a non-degenerate tridagon.

(*) and all the implicitly known ones, between the minimals and the max-expands.
.
denis_berthier
2010 Supporter

Posts: 4045
Joined: 19 June 2007
Location: Paris

### Re: The tridagon rule

.
What happens to a (non-degenerate) tridagon pattern when clues are deleted or added? The question arises in particular in the context of vicinity search.

1) When a clue is deleted from a puzzle with a tridagon pattern, the puzzle may come to have multiple solutions, but the tridagon is untouched (except that it may come to have more guardians).

2) As for adding a clue, we can be quite precise for puzzles in T&E(3).
Let's start with mith's collection of T&E(3) puzzles. He provides 3 collections in T&E(3): minimals, min-expands and max-expands (which I now prefer to call T&E(3)-expands in order to avoid any ambiguity).
Starting from minimals, clues can be added by applying Singles until one first reaches the min-expands, but still more clues (taken from the solution) can be added until one reaches the T&E(3)-expands, the limit beyond which one leaves T&E(3). Between minimals and max-expands is the whole T&E(3) land and its thickness is variable between 1 (in case the minimal is its own max-expand) and a few puzzles. Nothing really new until now.

But now what happens if one adds one more clue?
First, let's say that a puzzle P' is a 1-expand of a single solution puzzle P if P' has all the clues of P plus one (taken from the solution of P).
Now, starting from all the max-expands in mith's T&E(3) collection (48,071 minus 6 that are there by error), and applying systematically all the possible 1-expansions, one gets 2,257,893 puzzles, thus multiplying the number of puzzles by about 47 (before this number is eventually reduced by isomorphisms).
By the definition of a T&E(3)-expand, we know that none of these puzzles can be in T&E(3) or deeper (this is how I found the small error in the max-expands database). We also know that all the T&E(3)-expand puzzles have a non-degenerate tridagon.
The T&E(3)-expands form the border of T&E(3) from the inner side, and some of their 1-expands form part of the border from the outer side.
Note that these 1-expanded puzzles are not minimals and they may have other minimals than the already known ones, in T&E(3) or not. That's why they are not necessarily on the outer side of the T&E(3) border.

But are they all in T&E(2)? NO, but a high percentage is.
Code: Select all
`1,584,186   are in T&E(2), i.e. 70.16 %598,053   are in T&E(1), i.e. 26.49 %75,632  are in T&E(0), i.e. 3.35 %`

Note that this is not very surprising, as the addition of a clue has unpredictable effects in general.

Back to our original question: what about the tridagon?
For the puzzles in T&E(2), there are
Code: Select all
`617,299 with a tridagon, i.e. 38.97 %1,117,285 with a tridagon or a degenerate cyclic tridagon, i.e. 70.53%`

For the puzzles in T&E(1), the percentages are lower, but still noticeable:
Code: Select all
`15.20 % with a tridagon, i.e. 36.08 % with a tridagon or a degenerate cyclic tridagon.`

Globally, considering the process of 1-expanding all the T&E(3)-expands:
Code: Select all
`-in 27.34 % of the cases, one gets a puzzle in T&E(2) that has a tridagon;-in 49.48 % of the cases, one gets a puzzle in T&E(2) that has a tridagon or a degenerate cyclic tridagon`

Said otherwise, about 50% of the 1-expands of all the T&E(3)-expands (before possible reduction by isomorphisms) are potential precursors of T&E(3) puzzles. Which suggests that, in the vicinity search procedure, one shouldn't only check all the minimals of the min-expands, but all the minimals of the 1-expands of all the T&E(3)-expands. Of course, this may quickly become overwhelming work.

I have many more results about such expansions, but I need to do some cleaning before I can sort out the really interesting ones and publish them.
.
denis_berthier
2010 Supporter

Posts: 4045
Joined: 19 June 2007
Location: Paris

### Re: The tridagon rule

.
In a previous post (http://forum.enjoysudoku.com/the-tridagon-rule-t39859-119.html),
I gave the proportion of degenerate-cyclic tridagons (as defined here http://forum.enjoysudoku.com/the-tridagon-rule-t39859-118.html)
in the first small part of the [cbg] collection: 0.22%.

As a background work when my Mac was not busy on some other calculations, I have now finished checking the whole collection of ~6M puzzles.

In the full controlled-bias collection, there is no non-degenerate tridagon, but there are 16,453 puzzles (0.278 % ) with the degenerate-cyclic variant.

The purpose of checking the whole collection was not to improve the precision of the percentage (though it did) but to be able to compute such distributions as the SER or B-ratings and to have enough puzzles for starting further calculations.

Both distributions (SER and B-ratings) are concentrated on much higher values than in the full [cbg] distribution, as shown below.

B distribution (number of puzzles):
Code: Select all
`3: 30394: 71075: 40966: 15357: 4928: 1389: 4010: 511: 012: 013: 1`

SER distribution (number of puzzles) (left column is 10*SER:
Code: Select all
`42: 24043: 044: 2745: 046: 047: 048: 049: 050: 651: 052: 053: 054: 155: 056: 057: 058: 059: 060: 061: 062: 363: 064: 065: 366: 12767: 9668: 1469: 370: 1671: 181472: 356473: 201574: 11675: 7576: 22077: 22878: 40879: 10280: 3481: 082: 25383: 264184: 201385: 81986: 7387: 2888: 20689: 62390: 59991: 8092: 593: 1`

Even after truncating this sub-collection to the upper B or SER values or both, there remains enough puzzles to be used as seeds in the search for non-degenerate tridagons.

[Edit): Actually, in order to avoid problems with uniqueness, I didn't use the SER but SER with no uniqueness; and I didn't use SudokuExplainer but its FPGX variant, available on GitHub in the programs folder of [cbg]: https://github.com/denis-berthier/Controlled-bias_Sudoku_generator_and_collection
.
denis_berthier
2010 Supporter

Posts: 4045
Joined: 19 June 2007
Location: Paris

Previous