Lozenges 8.3

Post puzzles for others to solve here.

Re: Lozenges 8.3

Postby denis_berthier » Mon Nov 30, 2020 3:32 am

DEFISE wrote:
denis_berthier wrote:3...9...4.4.5.2.3...6...9...3..5..4.1..3.6..8.6..1..7...7...4...5.1.8.2.2...4...5
The challenge here is not to solve the puzzle, but to find long oddagons.

Here is a resolution with whips and 3 oddagons

Hi DEFISE

It's strange that you find Oddagons with whips activated. SudoRules finds a solution in W4 (leaving no chance for any oddagon):

Hidden Text: Show
***********************************************************************************************
*** SudoRules 20.1.s based on CSP-Rules 2.1.s, config = W+O+S
*** Using CLIPS 6.32-r773
***********************************************************************************************
singles ==> r7c6 = 5, r5c3 = 4, r8c1 = 4, r7c1 = 6
160 candidates, 777 csp-links and 777 links. Density = 6.11%
whip[1]: r5n5{c8 .} ==> r6c7 ≠ 5
whip[1]: c5n8{r3 .} ==> r3c4 ≠ 8, r1c4 ≠ 8
hidden-pairs-in-a-row: r4{n1 n6}{c7 c9} ==> r4c9 ≠ 9, r4c9 ≠ 2, r4c7 ≠ 2
x-wing-in-columns: n6{c4 c8}{r1 r9} ==> r9c7 ≠ 6, r1c7 ≠ 6
whip[3]: c2n9{r9 r5} - c8n9{r5 r7} - b8n9{r7c4 .} ==> r9c3 ≠ 9
whip[3]: c8n9{r9 r5} - c2n9{r5 r9} - b8n9{r9c4 .} ==> r7c9 ≠ 9
whip[3]: r8c3{n3 n9} - c9n9{r8 r6} - r6n3{c9 .} ==> r8c7 ≠ 3
whip[3]: r8c7{n7 n6} - c5n6{r8 r2} - r1c4{n6 .} ==> r1c7 ≠ 7
whip[2]: r1n7{c6 c2} - r5n7{c2 .} ==> r3c5 ≠ 7, r2c5 ≠ 7
whip[3]: c5n7{r5 r8} - c5n6{r8 r2} - r1c4{n6 .} ==> r4c4 ≠ 7
whip[3]: b6n2{r6c9 r5c7} - c7n5{r5 r1} - c3n5{r1 .} ==> r6c3 ≠ 2
whip[3]: b4n2{r4c3 r5c2} - r5n7{c2 c5} - r4c6{n7 .} ==> r4c3 ≠ 9
whip[4]: b8n6{r9c4 r8c5} - c5n7{r8 r5} - c5n2{r5 r7} - r7c4{n2 .} ==> r9c4 ≠ 9
naked-pairs-in-a-column: c4{r1 r9}{n6 n7} ==> r3c4 ≠ 7
singles ==> r3c4 = 4, r6c6 = 4
whip[4]: r5n9{c8 c2} - r9n9{c2 c6} - r4c6{n9 n7} - b4n7{r4c1 .} ==> r7c8 ≠ 9
whip[4]: r8c3{n3 n9} - r7n9{c2 c4} - r7n2{c4 c5} - r7n3{c5 .} ==> r8c9 ≠ 3
whip[4]: r8n7{c9 c5} - r5c5{n7 n2} - r7c5{n2 n3} - b9n3{r7c9 .} ==> r9c7 ≠ 7
whip[1]: r9n7{c6 .} ==> r8c5 ≠ 7
singles ==> r5c5 = 7, r4c6 = 9, r7c4 = 9, r7c5 = 2, r7c9 = 3, r6c7 = 3, r4c1 = 7, r3c9 ≠ 7
naked-pairs-in-a-block: b9{r7c8 r9c7}{n1 n8} ==> r9c8 ≠ 8, r9c8 ≠ 1
hidden-pairs-in-a-column: c7{n2 n5}{r1 r5} ==> r1c7 ≠ 8, r1c7 ≠ 1
whip[2]: r5n2{c2 c7} - r1n2{c7 .} ==> r3c2 ≠ 2
stte

In order to find Oddagons, I have to activate only them + bivalue-chains.
denis_berthier
2010 Supporter
 
Posts: 4213
Joined: 19 June 2007
Location: Paris

Re: Lozenges 8.3

Postby Mauriès Robert » Mon Nov 30, 2020 10:12 am

Hi François and Denis,
I studied Francois' resolution up to the first Oddagon [15] announced. For me it is not an Oddagon (Broken wing) but a whip. Indeed, the Oddagon is characterized by the fact that the invalid loop appears only if the guardians are eliminated, which is not the case here, the described loop being invalid without deletion of any guardian, thus without the use of the 8r9c3 target.
I did not check the two others, but if the same principle was applied it is not Oddagons either.
Robert
Mauriès Robert
 
Posts: 594
Joined: 07 November 2019
Location: France

Re: Lozenges 8.3

Postby DEFISE » Mon Nov 30, 2020 11:03 am

Hi Robert,
Apparently there is a big controversy over the definition of Oddagon.
For my part I was content to read the 3 examples of Denis by following the link
a-revival-of-broken-wings-t5225-91.html. (Page 7).
And I was inspired by his examples. No need to read anything else. No Broken-Wings, no guardians etc…).
DEFISE
 
Posts: 280
Joined: 16 April 2020
Location: France

Re: Lozenges 8.3

Postby DEFISE » Mon Nov 30, 2020 11:56 am

denis_berthier wrote:Hi DEFISE
It's strange that you find Oddagons with whips activated. SudoRules finds a solution in W4 (leaving no chance for any oddagon):
In order to find Oddagons, I have to activate only them + bivalue-chains.

Hi Denis,
It must depend on the order of the different searches.
In my initial "Simple first" program I just inserted the search for oddagons between the search for basics and the search for whips.
DEFISE
 
Posts: 280
Joined: 16 April 2020
Location: France

Re: Lozenges 8.3

Postby denis_berthier » Mon Nov 30, 2020 1:30 pm

DEFISE wrote:
denis_berthier wrote:Hi DEFISE
It's strange that you find Oddagons with whips activated. SudoRules finds a solution in W4 (leaving no chance for any oddagon):
In order to find Oddagons, I have to activate only them + bivalue-chains.

Hi Denis,
It must depend on the order of the different searches.
In my initial "Simple first" program I just inserted the search for oddagons between the search for basics and the search for whips.


I see.
In SudoRules, oddagons follow the same priority rules as the other patterns: oddagons[n] are at level n.
Oddagons are a generic pattern, but an exotic one. Oddagons[n] are therefore just before all the generic non-exotic patterns of length n.

Anyway, you get the cup for the longest ones. Those I found have lengths ≤ 11.
denis_berthier
2010 Supporter
 
Posts: 4213
Joined: 19 June 2007
Location: Paris

Re: Lozenges 8.3

Postby Mauriès Robert » Mon Nov 30, 2020 5:49 pm

Hi Denis,
You did not answer my comment that I remind :
Mauriès Robert wrote:I studied Francois' resolution up to the first Oddagon [15] announced. For me it is not an Oddagon (Broken wing) but a whip. Indeed, the Oddagon is characterized by the fact that the invalid loop appears only if the guardians are eliminated, which is not the case here, the described loop being invalid without deletion of any guardian, thus without the use of the 8r9c3 target.
I did not check the two others, but if the same principle was applied it is not Oddagons either.

Am I right or wrong ?
Robert
Mauriès Robert
 
Posts: 594
Joined: 07 November 2019
Location: France

Re: Lozenges 8.3

Postby denis_berthier » Mon Nov 30, 2020 6:20 pm

Mauriès Robert wrote:You did not answer my comment that I remind :
Mauriès Robert wrote:I studied Francois' resolution up to the first Oddagon [15] announced. For me it is not an Oddagon (Broken wing) but a whip. Indeed, the Oddagon is characterized by the fact that the invalid loop appears only if the guardians are eliminated, which is not the case here, the described loop being invalid without deletion of any guardian, thus without the use of the 8r9c3 target.
I did not check the two others, but if the same principle was applied it is not Oddagons either.

Am I right or wrong ?


I hadn't seen it. Guardians are z-candidates; they are not eliminated.
In oddagon[n]: {a1 a2},{a2 a3}, ...,{an a1} => not Z, the logic is very simple (because there is an odd number of bivalue (modulo Z) cells:
Code: Select all
if Z then
    a1 => not a2 => a3 => not a4 =>.... => not a1
    not a1 => a2 => not a3 => a4 => ... => a1
denis_berthier
2010 Supporter
 
Posts: 4213
Joined: 19 June 2007
Location: Paris

Re: Lozenges 8.3

Postby Mauriès Robert » Mon Nov 30, 2020 6:33 pm

So according to you, the oddagon [15] described by François is indeed an oddagon?
Robert
Mauriès Robert
 
Posts: 594
Joined: 07 November 2019
Location: France

Re: Lozenges 8.3

Postby DEFISE » Mon Nov 30, 2020 8:47 pm

Hi Robert,
Oddagon or not Oddagon this logic works and that’s all that matters to me. My eliminations are justified. There may be other more general patterns that work as well, but this one has the merit of simplicity.
DEFISE
 
Posts: 280
Joined: 16 April 2020
Location: France

Re: Lozenges 8.3

Postby Mauriès Robert » Mon Nov 30, 2020 9:35 pm

Hi François,
Yes your reasoning works, it corresponds to the scheme described in the last post above from Denis answering me. Your elimination is correct. I have only made a bad connection between Denis' conception of the oddagon and the one (original concept) that I read based on the notion of guardians which seems to me to be broader.
The loop [15] that you construct corresponds to an oddagon (original concept) whose keepers are 3r9c3 and 8r9c8, whereas Denis considers that the keepers are all the z-candidates who see the 8r9c3 target, which is restrictive in my opinion. Indeed, with Denis's design, only 8r9c3 is eliminated, whereas with the original design 8r9c3 is eliminated but all the candidates common to the tracks from 3r9c3 and 8r9c8 can be validated since these tracks are conjugated, so for example r7c9=3, stte (see puzzle).
puzzle: Show
In blue your loop [15] if both guardians are eliminated (hypothesis).
Image

In any case, congratulations for having found this loop[15].
Robert
Mauriès Robert
 
Posts: 594
Joined: 07 November 2019
Location: France

Re: Lozenges 8.3

Postby denis_berthier » Tue Dec 01, 2020 6:21 am

Hi Robert
If you want to learn more about oddagons, you'd better follow the link already given by DEFISE: http://forum.enjoysudoku.com/a-revival-of-broken-wings-t5225-91.html. Whether and how they are related to previously defined patterns (such as broken wing) is irrelevant.
denis_berthier
2010 Supporter
 
Posts: 4213
Joined: 19 June 2007
Location: Paris

Re: Lozenges 8.3

Postby denis_berthier » Tue Dec 01, 2020 6:48 am

Let me now give my solution with oddagons and explain how I found it.

As I've shown before, this puzzle is in W4. I therefore decided to try to solve it without whips. The first natural choice is to use only reversible patterns. (Another possibility would be to use only 2D chains.)

I first tried to activate all the reversible patterns in SudoRules: Subsets (Naked, Hidden and Super-Hidden), bivalue-chains, z-chains and oddagons, as shown in the following options of the SudoRules configuration file:
Code: Select all
(bind ?*Subsets* TRUE)
(bind ?*Bivalue-Chains* TRUE)
(bind ?*z-Chains* TRUE)
(bind ?*Oddagons* TRUE)

It appeared that this puzzle is also in Z4:
Hidden Text: Show
***********************************************************************************************
*** SudoRules 20.1.s based on CSP-Rules 2.1.s, config = Z+O+S
*** Using CLIPS 6.32-r773
***********************************************************************************************
singles ==> r7c6 = 5, r5c3 = 4, r8c1 = 4, r7c1 = 6
160 candidates, 777 csp-links and 777 links. Density = 6.11%
whip[1]: r5n5{c8 .} ==> r6c7 ≠ 5
whip[1]: c5n8{r3 .} ==> r3c4 ≠ 8, r1c4 ≠ 8
hidden-pairs-in-a-row: r4{n1 n6}{c7 c9} ==> r4c9 ≠ 9, r4c9 ≠ 2, r4c7 ≠ 2
x-wing-in-columns: n6{c4 c8}{r1 r9} ==> r9c7 ≠ 6, r1c7 ≠ 6
biv-chain[3]: r4c6{n9 n7} - r5c5{n7 n2} - r4n2{c4 c3} ==> r4c3 ≠ 9
;;; Resolution state RS1
z-chain[3]: c3n5{r6 r1} - c7n5{r1 r5} - b6n2{r5c7 .} ==> r6c3 ≠ 2
z-chain[3]: b8n9{r9c6 r7c4} - c8n9{r7 r5} - c2n9{r5 .} ==> r9c3 ≠ 9
z-chain[3]: r8n9{c9 c3} - c2n9{r9 r5} - c8n9{r5 .} ==> r7c9 ≠ 9
biv-chain[3]: r6n3{c7 c9} - c9n9{r6 r8} - r8c3{n9 n3} ==> r8c7 ≠ 3
biv-chain[3]: r8c7{n7 n6} - c8n6{r9 r1} - r1c4{n6 n7} ==> r1c7 ≠ 7
z-chain[2]: r1n7{c6 c2} - r5n7{c2 .} ==> r3c5 ≠ 7
z-chain[2]: r1n7{c6 c2} - r5n7{c2 .} ==> r2c5 ≠ 7
biv-chain[3]: c5n7{r5 r8} - c5n6{r8 r2} - r1c4{n6 n7} ==> r4c4 ≠ 7
biv-chain[4]: r5c8{n9 n5} - r5c7{n5 n2} - c5n2{r5 r7} - r7c4{n2 n9} ==> r7c8 ≠ 9
biv-chain[4]: r7n3{c9 c5} - b8n2{r7c5 r7c4} - r7n9{c4 c2} - r8n9{c3 c9} ==> r8c9 ≠ 3
biv-chain[4]: b8n6{r9c4 r8c5} - c5n7{r8 r5} - c5n2{r5 r7} - r7c4{n2 n9} ==> r9c4 ≠ 9
naked-pairs-in-a-column: c4{r1 r9}{n6 n7} ==> r3c4 ≠ 7
singles ==> r3c4 = 4, r6c6 = 4
z-chain[4]: r9n7{c6 c7} - b9n3{r9c7 r7c9} - r7c5{n3 n2} - r5c5{n2 .} ==> r8c5 ≠ 7
singles ==> r5c5 = 7, r4c6 = 9, r7c4 = 9, r7c5 = 2, r7c9 = 3, r6c7 = 3, r4c1 = 7
whip[1]: r2n7{c9 .} ==> r3c9 ≠ 7
whip[1]: r8n7{c9 .} ==> r9c7 ≠ 7
naked-pairs-in-a-block: b9{r7c8 r9c7}{n1 n8} ==> r9c8 ≠ 8, r9c8 ≠ 1
hidden-pairs-in-a-column: c7{n2 n5}{r1 r5} ==> r1c7 ≠ 8, r1c7 ≠ 1
biv-chain[2]: r5n2{c7 c2} - r3n2{c2 c9} ==> r6c9 ≠ 2, r1c7 ≠ 2
stte

This is probably the simplest solution one can hope, in terms of patterns involved and their maximal lengths (using only Subsets and bivalue-chains is not enough). As you can see from the resolution path, it heavily relies on z-chains.


But that day, I had set my mind on hunting oddagons. So I tried to de-activate z-chains, using the following configuration:
Code: Select all
(bind ?*Subsets* TRUE)
(bind ?*Bivalue-Chains* TRUE)
(bind ?*Oddagons* TRUE)

Notice that, while the previous choice was "natural", this one is less so. As oddagons rely on z-candidates, why would one activate them but not z-chains? Anyway, SudoRules allows to play freely with all the rules combinations (provided they are consistent). (What SudoRules doesn't allow easily is to change the relative priorities of rules.)

Hidden Text: Show
***********************************************************************************************
*** SudoRules 20.1.s based on CSP-Rules 2.1.s, config = BC+O+S
*** Using CLIPS 6.32-r773
***********************************************************************************************
Same start upto resolution state RS1
biv-chain[4]: r5c8{n9 n5} - r5c7{n5 n2} - c5n2{r5 r7} - r7c4{n2 n9} ==> r7c8 ≠ 9
biv-chain[5]: r4c6{n9 n7} - r5c5{n7 n2} - r7c5{n2 n3} - b2n3{r3c5 r3c6} - c6n4{r3 r6} ==> r6c6 ≠ 9
singles ==> r6c6 = 4, r3c4 = 4
oddagon[5]: c2n9{r5 r7},b7n9{r7c2 r9c3},r9n9{c3 c8},c8n9{r9 r5},r5n9{c8 c2} ==> r9c3 ≠ 9
oddagon[7]: r5n9{c2 c8},c8n9{r5 r9},b9n9{r9c8 r7c9},c9n9{r7 r8},r8n9{c9 c3},b7n9{r8c3 r9c2},c2n9{r9 r5} ==> r7c9 ≠ 9
biv-chain[3]: r6n3{c7 c9} - c9n9{r6 r8} - r8c3{n9 n3} ==> r8c7 ≠ 3
biv-chain[3]: r8c7{n7 n6} - c8n6{r9 r1} - r1c4{n6 n7} ==> r1c7 ≠ 7
biv-chain[4]: r7n3{c9 c5} - b8n2{r7c5 r7c4} - r7n9{c4 c2} - r8n9{c3 c9} ==> r8c9 ≠ 3
oddagon[5]: c2n7{r1 r5},r5n7{c2 c5},c5n7{r5 r3},b2n7{r3c5 r1c6},r1n7{c6 c2} ==> r3c5 ≠ 7
oddagon[11]: r1c7{n1 n5},c7n5{r1 r5},r5c7{n5 n2},c7n2{r5 r6},r6c7{n2 n3},r6n3{c7 c9},c9n3{r6 r7},r7c9{n3 n1},c9n1{r7 r4},r4n1{c9 c7},c7n1{r4 r1} ==> r1c7 ≠ 1
oddagon[11]: b1n2{r1c2 r3c2},c2n2{r3 r5},r5n2{c2 c5},c5n2{r5 r7},r7c5{n2 n3},r7n3{c5 c9},c9n3{r7 r6},r6n3{c9 c7},r6c7{n3 n2},c7n2{r6 r1},r1n2{c7 c2} ==> r1c7 ≠ 2
hidden-single-in-a-block ==> r3c9 = 2
whip[1]: b3n7{r2c9 .} ==> r2c1 ≠ 7, r2c5 ≠ 7
biv-chain[3]: r2n7{c9 c7} - r8c7{n7 n6} - c5n6{r8 r2} ==> r2c9 ≠ 6
biv-chain[3]: c5n7{r5 r8} - c5n6{r8 r2} - r1c4{n6 n7} ==> r4c4 ≠ 7
hidden-pairs-in-a-column: c4{n6 n7}{r1 r9} ==> r9c4 ≠ 9
biv-chain[3]: c2n2{r1 r5} - r5c7{n2 n5} - r1c7{n5 n8} ==> r1c2 ≠ 8
biv-chain[3]: r7c9{n1 n3} - r6c9{n3 n9} - b9n9{r8c9 r9c8} ==> r9c8 ≠ 1
biv-chain[3]: b6n2{r6c7 r5c7} - c7n5{r5 r1} - c3n5{r1 r6} ==> r6c3 ≠ 2
biv-chain[4]: r7c8{n8 n1} - r7c9{n1 n3} - r6c9{n3 n9} - b9n9{r8c9 r9c8} ==> r9c8 ≠ 8
naked-triplets-in-a-block: b9{r8c7 r8c9 r9c8}{n6 n7 n9} ==> r9c7 ≠ 7
stte

This is a more complex solution than with z-chains, but we got our oddagons (with max length 11), without changing the natural rules priorities.
denis_berthier
2010 Supporter
 
Posts: 4213
Joined: 19 June 2007
Location: Paris

Re: Lozenges 8.3

Postby Mauriès Robert » Tue Dec 01, 2020 8:31 am

Hi Denis,
denis_berthier wrote:Hi Robert
If you want to learn more about oddagons, you'd better follow the link already given by DEFISE: http://forum.enjoysudoku.com/a-revival-of-broken-wings-t5225-91.html. Whether and how they are related to previously defined patterns (such as broken wing) is irrelevant.

I have read and reread these texts because you had already given me this link at the beginning of this thread. I think I now have a fair idea of the mostly agreed definition of an oddagon and your definition. For example, you replied to eleven that guardians are for you z-candidates (so you didn't mention them), this is a restriction that makes your definition a special case of the general definition. I too invite you to read Allan Barker's point of view http://sudoku.allanbarker.com/sweb/gen2/blacklog.htm and why not participate in the thread I created (Oddagon or not Oddagon) to explain why you think the example I give is not an oddagon.
Cordialy
Robert
Mauriès Robert
 
Posts: 594
Joined: 07 November 2019
Location: France

Re: Lozenges 8.3

Postby denis_berthier » Tue Dec 01, 2020 8:40 am

Mauriès Robert wrote:I think I now have a fair idea of the mostly agreed definition of an oddagon and your definition.

There is no difference between "the mostly agreed definition of an oddagon" (which you don't even mention) and mine.
If you have any doubts, ask the expert on this topic, i.e. Tarek.
denis_berthier
2010 Supporter
 
Posts: 4213
Joined: 19 June 2007
Location: Paris

Re: Lozenges 8.3

Postby Mauriès Robert » Tue Dec 01, 2020 9:24 am

denis_berthier wrote:
Mauriès Robert wrote:I think I now have a fair idea of the mostly agreed definition of an oddagon and your definition.

There is no difference between "the mostly agreed definition of an oddagon" (which you don't even mention) and mine.

I suggest you then explain in the thread "Oddagon or not Oddagon" why you consider that in SteveC's example it is not an oddagon as you told me.
As for the commonly accepted definition of the oddagon (Broken wing), I refer you to the definition of its creator RodHagglund and to the broader definition of Allan Barker among others, definitions all of which are based on the principle of guardians who are not necessarily z-candidates.
Robert
PS :I will indeed ask Tarek to arbitrate this debate.
Mauriès Robert
 
Posts: 594
Joined: 07 November 2019
Location: France

PreviousNext

Return to Puzzles