noXing

Post puzzles for others to solve here.

noXing

Postby Qinlux » Mon Aug 30, 2021 11:07 pm

Here's a puzzle (my first post here) that I am very happy with and quite excited to share with you all! Interested to hear how you will approach this one. :D

Code: Select all
.-------.-------.-------.
| 6 . . | 5 . 4 | 3 . . |
| . . 9 | . . . | . . . |
| 1 . . | . . . | . . 5 |
+-------+-------+-------+
| 8 . . | . 5 3 | . . 6 |
| . 6 5 | . . 7 | . . . |
| 4 . . | 9 . . | . . 7 |
+-------+-------+-------+
| . 1 . | . 4 . | . 9 . |
| . . 2 | . 8 . | . . . |
| . . . | 3 . 5 | 2 . 4 |
'-------'-------'-------'
Qinlux
 
Posts: 1
Joined: 30 August 2021

Re: noXing

Postby denis_berthier » Thu Sep 02, 2021 6:47 am

Hi Qinlux,

Welcome on this forum

There are always many ways to approach a puzzle and we don't know what you're expecting.

SER = 8.3 puts it in the hard, but not very hard, category.

Code: Select all
Resolution state after Singles and whips[1]:
   +----------------------+----------------------+----------------------+
   ! 6      278    78     ! 5      1279   4      ! 3      1278   1289   !
   ! 237    5      9      ! 12678  12367  1268   ! 14678  124678 128    !
   ! 1      2378   4      ! 2678   23679  2689   ! 6789   2678   5      !
   +----------------------+----------------------+----------------------+
   ! 8      279    17     ! 124    5      3      ! 149    124    6      !
   ! 239    6      5      ! 1248   12     7      ! 1489   12348  12389  !
   ! 4      23     13     ! 9      126    1268   ! 158    12358  7      !
   +----------------------+----------------------+----------------------+
   ! 357    1      3678   ! 267    4      26     ! 5678   9      38     !
   ! 3579   4      2      ! 167    8      169    ! 1567   13567  13     !
   ! 79     789    678    ! 3      1679   5      ! 2      1678   4      !
   +----------------------+----------------------+----------------------+
184 candidates.


1) Simplest-first solution, with the hardest steps several z-chains[4] and a t-whip[4]:
finned-x-wing-in-rows: n1{r9 r1}{c5 c8} ==> r2c8≠1
finned-x-wing-in-columns: n2{c1 c9}{r5 r2} ==> r2c8≠2
biv-chain[3]: r5c5{n1 n2} - c1n2{r5 r2} - r2n3{c1 c5} ==> r2c5≠1
biv-chain[3]: r6c2{n2 n3} - b1n3{r3c2 r2c1} - c1n2{r2 r5} ==> r4c2≠2
biv-chain[3]: r4n2{c8 c4} - r5c5{n2 n1} - r9n1{c5 c8} ==> r4c8≠1
biv-chain[3]: r9c1{n7 n9} - b4n9{r5c1 r4c2} - b4n7{r4c2 r4c3} ==> r7c3≠7, r9c3≠7
biv-chain[3]: c1n2{r2 r5} - r6c2{n2 n3} - b1n3{r3c2 r2c1} ==> r2c1≠7
whip[1]: c1n7{r9 .} ==> r9c2≠7
biv-chain[4]: r1c3{n8 n7} - b4n7{r4c3 r4c2} - b4n9{r4c2 r5c1} - c9n9{r5 r1} ==> r1c9≠8
biv-chain[4]: r1c3{n8 n7} - r4c3{n7 n1} - r6c3{n1 n3} - c2n3{r6 r3} ==> r3c2≠8
whip[1]: b1n8{r1c3 .} ==> r1c8≠8
z-chain[4]: r1n9{c5 c9} - r1n1{c9 c8} - r9n1{c8 c5} - r5c5{n1 .} ==> r1c5≠2
z-chain[3]: r1n2{c9 c2} - b4n2{r6c2 r5c1} - c9n2{r5 .} ==> r3c8≠2
z-chain[4]: c9n9{r5 r1} - c9n2{r1 r2} - c1n2{r2 r5} - r5c5{n2 .} ==> r5c9≠1
z-chain[3]: c9n1{r2 r8} - r9n1{c8 c5} - r1n1{c5 .} ==> r2c7≠1
z-chain[4]: c1n2{r2 r5} - c5n2{r5 r6} - r6n6{c5 c6} - r7c6{n6 .} ==> r2c6≠2
t-whip[4]: r5c5{n2 n1} - r9n1{c5 c8} - r1n1{c8 c9} - c9n9{r1 .} ==> r5c9≠2
whip[1]: b6n2{r6c8 .} ==> r1c8≠2
biv-chain[3]: c9n9{r5 r1} - b3n2{r1c9 r2c9} - c1n2{r2 r5} ==> r5c1≠9
singles ==> r4c2=9, r9c2=8, r9c3=6, r7c3=3, r6c3=1, r4c3=7, r1c3=8, r7c9=8
naked-pairs-in-a-column: c8{r1 r9}{n1 n7} ==> r8c8≠7, r8c8≠1, r5c8≠1, r3c8≠7, r2c8≠7
whip[1]: b6n1{r5c7 .} ==> r8c7≠1
finned-swordfish-in-columns: n7{c8 c2 c5}{r9 r1 r3} ==> r3c4≠7
biv-chain[3]: r1c8{n7 n1} - r2c9{n1 n2} - r1n2{c9 c2} ==> r1c2≠7
stte

2) There's no 1-step solution with whips of reasonable length.
denis_berthier
2010 Supporter
 
Posts: 4237
Joined: 19 June 2007
Location: Paris

Re: noXing

Postby marek stefanik » Thu Sep 02, 2021 7:58 am

Hi Qinlux,

Welcome to the forum.

As Denis says, there is more than one way to solve the puzzle, I even found two similar stte patterns. Here is the simpler one:
Code: Select all
     2                                /1                       /1        2
   +------------------------+------------------------+------------------------+
   | 6       278     78     | 5       1279    4      | 3       1278   L12–89  | 1
   | 2357    34578–2 9      | 1678–2  367–12  168–2  | 14678   4678–12 128    | /2
   | 1       23478   3478   | 2678    23679   2689   | 46789   24678   5      |
   +------------------------+------------------------+------------------------+
   | 8       279     17     | 124     5       3      | 149     24–1    6      |
   | 239     6       5      | 148–2  T12      7      | 1489    348–12  12389  | /2
   | 4       23      13     | 9       26–1    1268   | 158     2358–1  7      |
   +------------------------+------------------------+------------------------+
   | 357     1       3678   | 267     4       26     | 5678    9       38     |
   | 3579    34579   2      | 167     8       169    | 1567    3567–1  13     |
   | 79      789     678    | 3       1679    5      | 2       1678    4      | 1
   +------------------------+------------------------+------------------------+
Two Finned X-Wings, r5c5 forces one of them to take the fin, so the other is proven. stte
5 Truths = {1R19 2C19 5N5}
5 Links = {1c58 2r25 1n9}

Can I please ask you not to use dots in the border of the grid? It makes it harder to paste the puzzle into a GUI, since it thinks they're empty cells.

Marek
marek stefanik
 
Posts: 360
Joined: 05 May 2021

Re: noXing

Postby Cenoman » Thu Sep 02, 2021 1:36 pm

Welcome to Qinlux !

Same solution as Marek's, written as an AIC:
Code: Select all
 +-----------------------+-------------------------+---------------------------+
 |  6      278    78     |  5      b1279*   4      |  3      b1278*  ea12-89   |
 | d237^   5      9      |  1678-2  367-12  168-2  |  14678   4678-12 d128^    |
 |  1      2378   4      |  2678    23679   2689   |  6789    2678     5       |
 +-----------------------+-------------------------+---------------------------+
 |  8      279    17     |  124     5       3      |  149     124      6       |
 | d239^   6      5      |  148-2  c12      7      |  1489    348-12  d12389^  |
 |  4      23     13     |  9       26-1    1268   |  158     2358-1   7       |
 +-----------------------+-------------------------+---------------------------+
 |  357    1      3678   |  267     4       26     |  5678    9        38      |
 |  3579   4      2      |  167     8       169    |  1567    3567-1   13      |
 |  79     789    678    |  3      b1679*   5      |  2      b1678*    4       |
 +-----------------------+-------------------------+---------------------------+

(1)r1c9 = XW*(1)r19\c58 - (1=2)r5c5 - XW^(2)c19\r25 = (2)r1c9 loop => -89 r1c9; ste (and other ineffective XWs eliminations: -1 r26c5, r2568c8, -2 r2c4568, r5c48)
Cenoman
Cenoman
 
Posts: 2997
Joined: 21 November 2016
Location: France

Re: noXing

Postby shye » Thu Sep 02, 2021 1:56 pm

welcome qinlux!

my solution is also similar to marek/cenomans, but slightly different (๑✦ ヮ ✦๑)

written out:
r5c5 must be placed in r1c9
1r5c5 - [1r9c5 = 1r9c8 - 1r8c9] & 1r1c5 & 1r5c9, therefore 1 in row 1 and column 9 takes the intersection
2r5c5 - [2r5c1 = 2r2c1 - 2r1c2] & 2r1c5 & 2r5c9, therefore 2 in row 1 and column 9 takes the intersection

with truths and links:
Code: Select all
.------------------.--------------------.----------------------.
| 6    *278   78   | 5     *1279   4    | 3     *1278   #12-89 |
|*237   5     9    | 12678  12367  1268 | 14678  124678 *128   |
| 1     2378  4    | 2678   23679  2689 | 6789   2678    5     |
:------------------+--------------------+----------------------:
| 8     279   17   | 124    5      3    | 149    124     6     |
|*239   6     5    | 1248  #12     7    | 1489   12348  *12389 |
| 4     23    13   | 9      126    1268 | 158    12358   7     |
:------------------+--------------------+----------------------:
| 357   1     3678 | 267    4      26   | 5678   9       38    |
| 3579  4     2    | 167    8      169  | 1567   13567  *13    |
| 79    789   678  | 3     *1679   5    | 2     *1678    4     |
'------------------'--------------------'----------------------'

7 Truths = {1R19 2R1 1C9 2C19 5N5}
9 Links = {12r5 12c5 1n9 1b39 2b13}
=> -89r1c9

stte, great puzzle!!
User avatar
shye
 
Posts: 332
Joined: 12 June 2021

Re: noXing

Postby denis_berthier » Thu Sep 02, 2021 3:27 pm

I found a simple solution in two non-W1 steps:
Code: Select all
whip[4]: r5c5{n1 n2} - c1n2{r5 r2} - c9n2{r2 r1} - r1n9{c9 .} ==> r1c5≠1
whip[1]: r1n1{c9 .} ==> r2c7≠1, r2c8≠1, r2c9≠1
whip[5]: b3n1{r1c9 r1c8} - r9n1{c8 c5} - r5c5{n1 n2} - r1n2{c5 c2} - b4n2{r4c2 .} ==> r1c9≠9
stte
denis_berthier
2010 Supporter
 
Posts: 4237
Joined: 19 June 2007
Location: Paris

Re: noXing

Postby P.O. » Thu Sep 02, 2021 6:01 pm

Code: Select all
a two steps solution.
after singles:

 6      h(278)  h(78)    5       1279    4       3      h(-1278) ga(1×2-8-9)       
 237     5       9       12678   12367   1268    14678   124678  g(12-8)           
 1       2378    4       2678    23679   2689    6789    2678     5               
 8       279     17      124     5       3       149     124      6               
c(23-9)  6       5       1248    12      7       1489    12348   b1238+9           
 4      c(23)   d1-3     9       126     1268    158     12358    7               
 357     1      e+3678   267     4       26      5678    9       f-3+8               
 3579    4       2       167     8       169     1567    13567    13               
 79      789     678     3       1679    5       2       1678     4               

depth: 5  candidate: 2  from start
 
((9 0) (1 9 3) (1 2 8 9))                            if R1C9 is not 9
((9 0) (5 9 6) (1 2 3 8 9))                          R5C9 is 9
((3 1 3 203) ((5 1 4) (2 3 9)) ((6 2 4) (2 3)))      R5C1 & R6C2 a pair: one is 3
((3 2 12) (7 3 7) (3 6 7 8))                         R7C3 is 3
((8 3 9) (7 9 9) (3 8))                              R7C9 is 8
((1 4 2 32) ((1 9 3) (1 2 8 9)) ((2 9 3) (1 2 8)))   R1C9 & R2C9 a pair: one is 1
((2 5 1 321) ((1 2 1) (2 7 8)) ((1 8 3) (1 2 7 8)))  R1C2 R1C3 & R1C8 a triplet: one is 2

 6       278     78      5       1279    4       3       1278     189             
b+237    5       9       12678   12367   1268    14678   124678  c1-28             
 1       2378    4       2678    23679   2689    6789    2678     5               
 8       279     17      124     5       3       149     124      6               
a-239    6       5       1×248   1×2     7       1489    1×2348  d1+2389           
 4       23      13      9       126     1268    158     12358    7               
 357     1       3678    267     4       26      5678    9        38               
 3579    4       2       167     8       169     1567    13567    13               
 79      789     678     3       1679    5       2       1678     4               

depth: 1  candidate: 2  from cells
(((5 4 5) (1 2 4 8)) ((5 5 5) (1 2)) ((5 8 6) (1 2 3 4 8)))

((2 0) (5 1 4) (2 3 9))
((2 0) (2 1 1) (2 3 7))
((2 1 1) (5 9 6) (1 2 3 8 9))

ste.

P.O.
 
Posts: 1759
Joined: 07 June 2021

Re: noXing

Postby jovi_al01 » Fri Sep 03, 2021 3:52 pm

hi qinlux! welcome to the forum. wonderful puzzle! my solution was the same as marek's :)
User avatar
jovi_al01
 
Posts: 102
Joined: 26 July 2021

Re: noXing

Postby yzfwsf » Mon Apr 10, 2023 9:11 am

ALS Continuous Nice Loop: 2r5c1 = r2c1 - (2=381)r278c9 - r1c9 = r19c5(r19\c589) - (1=2)r5c5 => r24568c8,r26c5,r5c9<>1,r2c24568,r5c489<>2,r5c9,r8c8<>3,r15c9<>8;stte
yzfwsf
 
Posts: 921
Joined: 16 April 2019


Return to Puzzles