Best Sample of Puzzles from 1.0 to Infinite Rating of SE

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

Postby Eioru » Tue Jun 12, 2007 5:58 pm

More and more forcing chains

Code: Select all
3..5..9..
....6....
..5..4..8
7..3..5..
.1.....6.
..2..7..4
6..9..3..
....1....
..4..8..7
ER=7.3 23xForcing Chain

Code: Select all
6..5..7..
....4....
..5..9..4
2..7..1..
.4.....3.
..8..5..6
7..1..2..
....3....
..3..8..5
ER=7.3 30xForcing Chain

Code: Select all
3.....4..
.1.6...9.
..5.8...2
.....9.1.
..4...7..
.6.2.....
9...1.3..
.2...8.4.
..7.....5
ER=8.5 25xForcing Chain (Sep.1 2007)
Last edited by Eioru on Sat Sep 01, 2007 2:18 am, edited 1 time in total.
Eioru
 
Posts: 182
Joined: 16 August 2006

Postby Pat » Sun Jul 22, 2007 3:22 pm

    the more progress one makes,
    the harder it becomes to make any more progress
      like accelerating towards the speed of light
User avatar
Pat
 
Posts: 3438
Joined: 18 July 2005

Postby Eioru » Wed Jul 25, 2007 4:39 pm

v 1.1.0

1. Advance the 2.6, 4.6, 6.6, 7.3, 7.8 puzzles.
2. Advance the 3.0, 3.2, 6.2, 7.8, 8.0 puzzles.(Aug.9)
3. Advance the 1.2, 8.8 puzzles, and add 8.1 back.(Sep.5)
Eioru
 
Posts: 182
Joined: 16 August 2006

Postby Eioru » Tue Sep 04, 2007 7:26 pm

v 1.1.1

1. Advance the 5.2, 5.9, 7.5, 7.9, 8.0, 8.1, 8.6, 8.7, 8.8 puzzles.
Eioru
 
Posts: 182
Joined: 16 August 2006

Postby Eioru » Sat Sep 08, 2007 6:42 pm

Code: Select all
1.....6.4
.2..7..5.
3........
....42...
.7.3.8.9.
...76....
........3
.5..9..2.
4.6.....1


SE=9.0

56 x Hidden Single
1 x Direct Hidden Pair
2 x Naked Single
7 x Pointing
3 x Hidden Pair
1 x Jellyfish
1 x Bidirectional Cycle
5 x Forcing Chain
10 x Aligned Triplet Exclusion ~ How many it has.
5 x Cell Forcing Chains
1 x Region Forcing Chains
2 x Dynamic Cell Forcing Chains
2 x Dynamic Region Forcing Chains
Eioru
 
Posts: 182
Joined: 16 August 2006

Postby Eioru » Sun Sep 09, 2007 6:01 pm

v 1.1.2

1. Advance the 2.3, 3.8, 8.5, 9.5, 9.6 puzzles.
Eioru
 
Posts: 182
Joined: 16 August 2006

Postby Eioru » Sun Sep 16, 2007 11:17 pm

Question for Unique Loop.
Please fill the hint rating in these block.

Code: Select all
                         Type 1   Type 2   Type 3   Type 4
Unique loop               4.6      4.6      4.8      4.6
Unique loop 8             4.7     _____     4.7     _____
Unique loop 10            5.0     _____    _____    _____
Unique loop 12           _____     5.0     _____    _____


I'm curious.:idea:
Need to change the score.
Bidirectional Cycle (1) 7.0 (2) 7.1 (3) 7.2 (4) 7.3 (5) 7.4 (6) 7.5
Forcing Chains (1) 7.1 (2) 7.2 (3) 7.3 (4) 7.4
Nishio Forcing Chains (1) 7.6 (2) 7.7 (3) 7.8 (4) 7.9 (5) 8.0 (6) 8.1
I've seen them with these rating, and want to choose one to represent difficulty themself.
Any suggestion?
Eioru
 
Posts: 182
Joined: 16 August 2006

Postby Eioru » Wed Oct 24, 2007 6:29 pm

v 1.1.3
Hard to improve!

1. Advance the 4.7, 4.9, 5.0, 5.6, 7.7 puzzles.
Eioru
 
Posts: 182
Joined: 16 August 2006

Postby Mike Barker » Tue Jan 08, 2008 6:06 am

I've been looking at Explainer ratings. Here's an updated list as near as I can make out. After looking at Nicolas' code I still have a number of questions, like:
1) based on the code it looks like a 10 cell Unique Loop should be 4.8, why does it shows up as 5.0?
2) is it possible to have contradiction or double multiple forcing chains?
3) based on the code the x.x9999999999 ratings are just round off errors because of how the ratings are calculated. Is this correct?
4) I didn't go into a lot of detail as to what the complexity truly is. It seems to be related to node count, but there may be something more as well (like maybe the number of chains) so my node counts may be off a little. Any idea how this is really counted? Also I didn't see any differences for ratings of cell, region, contradiction, or double forcing chains in the code. Is there any difference?

CRCD=Cell/Region/Contradiction/Double
UL=Unique Loop
UR=Unique Rectangle
BUG=Bivalue Universal Grave

    1.0 Single
    1.2 Hidden Single in box
    1.5 Hidden Single in line
    1.7 Direct Pointing
    1.9 Direct Claiming
    2.0 Direct Hidden Pair
    2.3 Naked Single
    2.5 Direct Hidden Triplet
    2.6 Pointing
    2.8 Claiming
    3.0 Naked Pair
    3.2 X-Wing
    3.4 Hidden Pair
    3.6 Naked Triplet
    3.8 Swordfish
    4.0 Hidden Triplet
    4.2 XY-Wing
    4.3
    4.4 XYZ-Wing
    4.5 UR Types 1, 2, 4 or 3 w/ hidden pair
    4.6 UR Type 3 w/ naked pair or hidden triplet or UL Types 1, 2, or 4, or 3 w/ hidden pair (6 cells)
    4.69 UL Type 3 w/ a naked pair or hidden triplet (6 cells)
    4.7 UR Type 3 w/ naked triplet or hidden quad or UL Types 1, 2, 4, or 3 w/ hidden pair (8 cells)
    4.8 UR Type 3 w/ naked quad or UL Type 3 w/ naked triplet [or hidden quad] (6 cells) or UL Type 3 w/ naked pair or hidden triplet (8 cells)
    4.89 UL Type 3 w/ naked quad (6 cells)
    4.9 [UL Type 3 w/ naked triplet or hidden quad (8 cells)]
    5.0 Naked Quad or UL 1, 2, or 4 (>=10 cells) (why isn't this 4.8?)
    5.1 UL Type 3 w/ naked pair (>=10 cells) (why isn't this 4.9?)
    5.2 Jellyfish
    5.3
    5.4 Hidden Quad
    5.5
    5.6 BUG Type 1
    5.7 BUG Type 2 or 4
    5.8 BUG Type 3 w/ naked pair
    5.9 BUG Type 3 w/ naked triplet
    6.0 BUG Type 3 w/ naked quad
    6.1 BUG Type 3 w/ naked quint
    6.2 Aligned Pair Exclusion
    6.3
    6.4
    6.5 Bidirectional X-Cycle or Bidirectional Y-Cycle (1-4 nodes)
    6.6 Forcing X-chain or Turbot Fish or Bidirectional Y-Cycle (5-6 nodes)
    6.69 Forcing X-Chain (7-8 nodes)
    6.7 Bidirectional Y-cycle (7-8 nodes)
    6.8 Forcing X-Chain or Bidirectional Y-cycle (9-12 nodes)
    6.9 Forcing X-Chain or Bidirectional Y-cycle (13-16 nodes)
    7.0 Forcing Chain or Bidirectional Cycle (1-4 nodes) or Bidirectional Y-cycle (17-24 nodes)
    7.1 Forcing Chain or Bidirectional Cycle (5-6 nodes)
    7.2 Forcing Chain or Bidirectional Cycle (7-8 nodes)
    7.3 Forcing Chain or Bidirectional Cycle (9-12 nodes)
    7.4 Forcing Chain (13-16 nodes)
    7.5 Forcing Chain (17-24 nodes) or Aligned Triplet Exclusion
    7.6 Forcing Chain (25-36 nodes) or Nishio Forcing Chain (5-6 nodes)
    7.7 Nishio Forcing Chain (7-8 nodes)
    7.8 Nishio Forcing Chain (9-12 nodes)
    7.9 Nishio Forcing Chain (13-16 nodes)
    8.0 Nishio Forcing Chain (17-24 nodes)
    8.1 Nishio Forcing Chain (25-36 nodes)
    8.2 Multiple (7-8 nodes) Region Forcing Chains (is cell, contradiction or double possible?)
    8.3 Multiple (9-12 nodes) Cell/Region Forcing Chains
    8.4 Multiple (13-16 nodes) Cell/Region Forcing Chains
    8.5 Multiple (17-24 nodes) Cell/Region Forcing Chains
    8.6 Multiple (25-36 nodes) or Dynamic (5-6 nodes) Cell/Region Forcing Chains
    8.7 Dynamic (7-8 nodes) Cell/Region Forcing Chains
    8.8 Dynamic (9-12 nodes) CRCD Forcing Chains
    8.9 Dynamic (13-16 nodes) CRCD Forcing Chains
    9.0 Dynamic (17-24 nodes) CRCD Forcing Chains
    9.1 Dynamic (25-36 nodes) CRCD Forcing Chains
    9.2 Dynamic (37-48 nodes) CRCD Forcing Chains
    9.3 Dynamic (49-72 nodes) or Dynamic + (9-12 nodes) CRCD Forcing Chains
    9.4 Dynamic (73-96 nodes) or Dynamic + (13-16 nodes) CRCD Forcing Chains
    9.5 Dynamic + (17-24 nodes) CRCD Forcing Chains
    9.6 Dynamic + (25-36 nodes) CRCD Forcing Chains
    9.7 Dynamic + (37-48 nodes) CRCD Forcing Chains
    9.8 Dynamic + (49-72 nodes) CRCD Forcing Chains
    9.9 Dynamic + (73-96 nodes) CRCD Forcing Chains
    10.0 Dynamic + (97-144 nodes) or Dynamic + Forcing Chains (17-24 nodes) CRCD Forcing Chains
    10.1 Dynamic + (145-192 nodes) or Dynamic + Forcing Chains (25-36 nodes) CRCD Forcing Chains
    10.2 Dynamic + Forcing Chains (37-48 nodes) CRCD Forcing Chains
    10.3 Dynamic + Forcing Chains (49-72 nodes) CRCD Forcing Chains
    10.4 Dynamic + Forcing Chains (73-96 nodes) CRCD Forcing Chains
    10.5 Dynamic + Forcing Chains (97-144 nodes) CRCD Forcing Chains
    10.6 Dynamic + Forcing Chains (145-192 nodes) CRCD Forcing Chains
    10.7 Dynamic + Forcing Chains (193-288 nodes) CRCD Forcing Chains
    10.8 Dynamic + Forcing Chains (289-384 nodes) CRCD Forcing Chains
    10.9 Dynamic + Multiple Forcing Chains (73-96 nodes) CRCD Forcing Chains
    11.0 Dynamic + Multiple Forcing Chains (97-144 nodes) CRCD Forcing Chains
    11.1 Dynamic + Multiple Forcing Chains (145-192 nodes) CRCD Forcing Chains
    11.2 Dynamic + Multiple Forcing Chains (193-288 nodes) CRCD Forcing Chains
    11.3 Dynamic + Multiple Forcing Chains (289-384 nodes) CRCD Forcing Chains
    11.4 Dynamic + Multiple Forcing Chains (385-576 nodes) CRCD Forcing Chains
    11.4 [Dynamic + Dynamic Forcing Chains (73-96 nodes) Region/Contradiction Forcing Chains]
    11.5 [Dynamic + Dynamic Forcing Chains (97-144 nodes) Region Forcing Chains]
    11.6 [Dynamic + Dynamic Forcing Chains (145-192 nodes) Cell Forcing Chains]
    11.7 [Dynamic + Dynamic Forcing Chains (193-288 nodes) Double Forcing Chains]
Last edited by Mike Barker on Tue Jan 08, 2008 10:28 am, edited 1 time in total.
Mike Barker
 
Posts: 458
Joined: 22 January 2006

Postby tarek » Tue Jan 08, 2008 10:14 am

Mike Barker wrote:2) is it possible to have contradiction or double multiple forcing chains?
3) based on the code the x.x9999999999 ratings are just round off errors because of how the ratings are calculated. Is this correct?
4) I didn't go into a lot of detail as to what the complexity truly is. It seems to be related to node count, but there may be something more as well (like maybe the number of chains) so my node counts may be off a little. Any idea how this is really counted? Also I didn't see any differences for ratings of cell, region, contradiction, or double forcing chains in the code. Is there any difference?

I don't know the real answers.
Here are 2 ratings from the new version (1.2.1) & the older (1.2):
Code: Select all
SE121 Analyzing Easter-Monster:
100000002090400050006000700050903000000070000000850040700000600030009080002000001
58 Hidden Single
5 Pointing
3 Claiming
2 Naked Pair
1 X-Wing
1 Hidden Pair
2 Naked Triplet
1 Hidden Triplet
3 Turbot Fish
1 Bidirectional Cycle
12 Forcing Chain
2 Nishio Forcing Chains
2 Region Forcing Chains
11 Dynamic Contradiction Forcing Chains
7 Dynamic Region Forcing Chains
1 Dynamic Cell Forcing Chains
1 Dynamic Cell Forcing Chains (+)
1 Dynamic Region Forcing Chains (+)
5 Dynamic Contradiction Forcing Chains (+)
11 Dynamic Contradiction Forcing Chains (+ Forcing Chains)
1 Dynamic Region Forcing Chains (+ Forcing Chains)
7 Dynamic Contradiction Forcing Chains (+ Multiple Forcing Chains)
Hardest technique: Dynamic Contradiction Forcing Chains (+ Multiple Forcing Chains)
Difficulty: 11.6

SE12 Analyzing Golden Nugget:
000000039000001005003050800008090006070002000100400000009080050020000600400700000
58 Hidden Single
2 Naked Single
6 Pointing
1 Claiming
3 Naked Pair
1 X-Wing
1 Hidden Pair
1 Turbot Fish
4 Forcing Chain
1 Nishio Forcing Chains
5 Region Forcing Chains
5 Cell Forcing Chains
2 Dynamic Cell Forcing Chains
13 Dynamic Contradiction Forcing Chains
1 Dynamic Double Forcing Chains
2 Dynamic Region Forcing Chains
1 Dynamic Region Forcing Chains (+)
3 Dynamic Contradiction Forcing Chains (+)
7 Dynamic Contradiction Forcing Chains (+ Forcing Chains)
13 Dynamic Contradiction Forcing Chains (+ Multiple Forcing Chains)
2 Dynamic Cell Forcing Chains (+ Dynamic Forcing Chains)
2 Dynamic Contradiction Forcing Chains (+ Dynamic Forcing Chains)
4 Dynamic Region Forcing Chains (+ Dynamic Forcing Chains)
Hardest technique: Dynamic Contradiction Forcing Chains (+ Dynamic Forcing Chains)
Difficulty: 11.5

if someone has the older rating of Easter Monster or the new one for Golden Nugget then through the change in rating between versions, an answer to your question might spring out.

tarek
User avatar
tarek
 
Posts: 2622
Joined: 05 January 2006

Postby Eioru » Wed Jan 23, 2008 12:57 pm

Only renew one

Code: Select all
4..1..7..
.5..6..8.
..3..5...
1..5.....
.2.....7.
.....3..9
...4..3..
.6..8..2.
..5..9..1

 
ER=8.2
57 x Hidden Single
1 x Naked Single
5 x Pointing
5 x Claiming
1 x Naked Pair
1 x X-Wing
1 x Naked Triplet
1 x Swordfish
3 x Turbot Fish
1 x Bidirectional Cycle
31 x Forcing Chain
1 x Region Forcing Chains
358.4
Eioru
 
Posts: 182
Joined: 16 August 2006

Postby Pat » Tue Feb 05, 2008 5:22 pm

hey Eioru,

which version of the software are you now using --
is it still version 1.2 or have you moved up to 1.2.1 ?
    some ratings will differ
User avatar
Pat
 
Posts: 3438
Joined: 18 July 2005

what's needed out of all that's available

Postby Pat » Sun Mar 09, 2008 11:02 am

    the report from SuDoku Explainer
    usually lists all that's available ( including red herrings )
    -- or so i thought
then came this example,
where SuDoku Explainer reports only 2 Swordfish ( those 2 which are needed ! )
and neglects to mention 3 other Swordfish ( red herrings )


Mauricio (2008.Feb.26) wrote:
      [ first puzzle ]
Code: Select all
..1..2..3.2..1..4.5..6..1....2..3..7.7..4..3.6..8..4....5..6..9.6..8..7.8..5..3..


Code: Select all
 . . 1 | . . 2 | . . 3
 . 2 . | . 1 . | . 4 .
 5 . . | 6 . . | 1 . .
-------+-------+------
 . . 2 | . . 3 | . . 7
 . 7 . | . 4 . | . 3 .
 6 . . | 8 . . | 4 . .
-------+-------+------
 . . 5 | . . 6 | . . 9
 . 6 . | . 8 . | . 7 .
 8 . . | 5 . . | 3 . .

User avatar
Pat
 
Posts: 3438
Joined: 18 July 2005

Postby Eioru » Wed Aug 06, 2008 11:26 am

Code: Select all
1..4...7.
.2...5...
..3.....8
4...381..
..5.1..2.
...7....9
.7.1..4..
....2...5
..8..6...  ER=7.2


58 x Hidden Single
5 x Pointing
1 x Claiming
3 x Naked Pair
1 x XY-Wing
1 x Bidirectional Y-Cycle
1 x Forcing X-Chain
1 x Bidirectional Cycle
29 x Forcing Chain
Eioru
 
Posts: 182
Joined: 16 August 2006

Postby tarek » Wed Aug 06, 2008 11:37 am

The Superior thread has many examples of puzzles requiring several x-wings, hidden triples.

I posted one with 2 hidden triples & if I recall correctly, gsf posted one with 3 x-wings.

tarek
User avatar
tarek
 
Posts: 2622
Joined: 05 January 2006

PreviousNext

Return to General