Analysis of xx-top500-156-base.sdk

Contents

Original Sudoku

level: deep

Original Sudoku

position: ..6..3....1.....4.....5....2.....3...9.1.....5.........8....1.93...2.......4...5. initial

Autosolve

position: ..6.13....1.....4.....54...2.....3...9.1.....5.........8....1.93...21...1..4...5. autosolve
Autosolve

Pair Reduction Variants

Deep Constraint Pair Analysis

Deep Constraint Pair Analysis

Time used: 0:00:00.000005

List of important HDP chains detected for C8,D8: 9..:

* DIS # D8: 9 # A1: 7,8 => CTR => A1: 4,9
* DIS # D8: 9 + A1: 4,9 # C2: 7,8 => CTR => C2: 2,3,5
* DIS # D8: 9 + A1: 4,9 + C2: 2,3,5 # A3: 7,8 => CTR => A3: 9
* PRF # D8: 9 + A1: 4,9 + C2: 2,3,5 + A3: 9 => SOL
* STA D8: 9
* CNT   4 HDP CHAINS /   4 HYP OPENED

See Appendix: Full HDP Chains for full list of HDP chains.

Details

This sudoku is deep. Here is some information that may be helpful on how to proceed.

Positions

..6..3....1.....4.....5....2.....3...9.1.....5.........8....1.93...2.......4...5. initial
..6.13....1.....4.....54...2.....3...9.1.....5.........8....1.93...21...1..4...5. autosolve

Classification

level: deep

Pairing Analysis

--------------------------------------------------
* CONSTRAINT PAIRS (AUTO SOLVE)
H3,I3: 1.. / H3 = 1  =>  0 pairs (X) / I3 = 1  =>  0 pairs (_)
C4,C6: 1.. / C4 = 1  =>  0 pairs (_) / C6 = 1  =>  0 pairs (_)
C7,H7: 2.. / C7 = 2  =>  0 pairs (X) / H7 = 2  =>  0 pairs (_)
H7,I9: 3.. / H7 = 3  =>  0 pairs (X) / I9 = 3  =>  0 pairs (_)
C2,I2: 3.. / C2 = 3  =>  0 pairs (*) / I2 = 3  =>  0 pairs (X)
C5,E5: 3.. / C5 = 3  =>  0 pairs (X) / E5 = 3  =>  0 pairs (_)
E9,I9: 3.. / E9 = 3  =>  0 pairs (X) / I9 = 3  =>  0 pairs (_)
B3,B6: 3.. / B3 = 3  =>  0 pairs (X) / B6 = 3  =>  0 pairs (_)
D6,D7: 3.. / D6 = 3  =>  0 pairs (X) / D7 = 3  =>  0 pairs (_)
H3,H7: 3.. / H3 = 3  =>  0 pairs (*) / H7 = 3  =>  0 pairs (X)
A1,B1: 4.. / A1 = 4  =>  0 pairs (*) / B1 = 4  =>  0 pairs (X)
A7,C7: 4.. / A7 = 4  =>  0 pairs (X) / C7 = 4  =>  0 pairs (_)
G8,I8: 4.. / G8 = 4  =>  0 pairs (_) / I8 = 4  =>  0 pairs (_)
B1,C2: 5.. / B1 = 5  =>  0 pairs (*) / C2 = 5  =>  0 pairs (X)
B1,B8: 5.. / B1 = 5  =>  0 pairs (*) / B8 = 5  =>  0 pairs (X)
A5,A7: 6.. / A5 = 6  =>  2 pairs (_) / A7 = 6  =>  0 pairs (X)
C8,C9: 9.. / C8 = 9  =>  1 pairs (_) / C9 = 9  =>  2 pairs (_)
C8,D8: 9.. / C8 = 9  =>  1 pairs (_) / D8 = 9  =>  2 pairs (_)
* DURATION: 0:00:25.391247  START: 08:04:50.092060  END: 08:05:15.483307 2017-05-04
* CP COUNT: (18)
* SOLUTION FOUND

--------------------------------------------------
* DEEP CONSTRAINT PAIRS (PAIR REDUCTION)
C8,D8: 9.. / C8 = 9  =>  0 pairs (X) / D8 = 9 ==>  0 pairs (*)
* DURATION: 0:00:28.880997  START: 08:05:15.483850  END: 08:05:44.364847 2017-05-04
* REASONING C8,D8: 9..
* DIS # D8: 9 # A1: 7,8 => CTR => A1: 4,9
* DIS # D8: 9 + A1: 4,9 # C2: 7,8 => CTR => C2: 2,3,5
* DIS # D8: 9 + A1: 4,9 + C2: 2,3,5 # A3: 7,8 => CTR => A3: 9
* PRF # D8: 9 + A1: 4,9 + C2: 2,3,5 + A3: 9 => SOL
* STA D8: 9
* CNT   4 HDP CHAINS /   4 HYP OPENED
* DCP COUNT: (1)
* SOLUTION FOUND

Header Info

Top 500 Minimum 17 156

solution: 456813297813279546972654831247596318698132475531748962784365129365921784129487653
info: 1818     FNBWY    S8.f     46801

http://www.sfsudoku.com/su17ExtremeDiff500.txt from http://www.minimumsudoku.com/

Appendix: Full HDP Chains

A1. Deep Constraint Pair Analysis

Full list of HDP chains traversed for C8,D8: 9..:

* DIS # D8: 9 # A1: 7,8 => CTR => A1: 4,9
* DIS # D8: 9 + A1: 4,9 # C2: 7,8 => CTR => C2: 2,3,5
* DIS # D8: 9 + A1: 4,9 + C2: 2,3,5 # A3: 7,8 => CTR => A3: 9
* PRF # D8: 9 + A1: 4,9 + C2: 2,3,5 + A3: 9 => SOL
* STA D8: 9
* CNT   4 HDP CHAINS /   4 HYP OPENED