Print Version
Solvers
Puzzles
Latest Apps
Str8ts
Other

Discussion...

Post an idea here...

Remember me

Email addresses are never displayed, but they are required to confirm your comments. To state your solve time use the smaller form at the top right of this page." & vbNewLine & _ Line breaks and paragraphs are automatically converted ? no need to use <p> or <br> tags.

... by: R0D

Done in 12 minutes but the timer says 1hr 12mins? Nice puzzles, I seriously enjoy(ed) all of them - please don't ever stop doing these unslvables!

... by: Cenoman

1. Basics: +E6
2. Grouped skyscraper: (4)J4=J2-A2=A56 =>-4B4
3. A General Exocet (1234)G56, J2, H8 can be demonstrated with basics only.
Eliminations from the pattern: -4J2, -4H8 (base digits false in mirror nodes), -6H7 (non base digit in mirror node cell while locked 7H9). Then basics to the end.

Note: it is possible to consider that JE2 criteria are met for digits 1, 2, 3, with column 9 as additional cross-line (3 cover houses per digit). The exocet property has to be demonstrated for digit 4 only: +4G56, -4H8, -4J2 => box 9 void of 4 (contradiction)

... by: numpl_npm

5E6

| _ _ 2 | 5 _ _ | _ _ _ | A
| _ _ _ | _ 1 _ | _ _ _ | B
| _ 5 _ | 7 _ _ | _ 6 4 | C

| 5 _ _ | _ _ _ | _ _ _ | D
| _ _ 3 | _ _ 5 | 4 _ _ | E
| 4 8 _ | 6 _ _ | _ 9 5 | F

| 8 _ _ | 9 _ _ | _ _ _ | G
| _ 9 _ | _ 5 _ | _ _ 7 | H
| _ _ 5 | _ 6 7 | _ 8 9 | J

(u)J7 -> -(u)H13
| 1J7 & 1F3 -> 1C1 -1H13
| 1J7 & 1F6 -> 1H44 -1H13
| 2J7 -> 2C56 2F56 2H4 -2H13
| 3J7 & 3C1 -> -3H13
| 3J7 & 3C56 -> 3F56 3H4 -1H13

(u where u in 123)J4 -> (u)H1
| 4J2 489BCD3 6GH3 -6H1
| (v where v in 123 and v != u) -> (v)J17 -(v)H1 (u)H1

(u where u in 123)J4 -> 6H3 4H8 contra.
| 4J2
| 1J147 -> -1H3 6H3
| (v)J7 -> (v)G23 (v8)H46 4
| (x)J1 -> (x)H7
| 1J1 -> 1H7-C3-F6 contra.
| 2J1 -> 2H7-C56-F56-G56 contra.
| 3J1 -> 3H7-C56-F56-G56 contra.

So 4J4

-123H13 6H1 4H3
| (x)J7 -> (x)G23 - 123H13

Then solved with bascis only.

... by: Frans Goosens

With trial and error

Combination C3=189 and F6=123

************************************************************
C3=1 F6=1 Wrong, Undo calculation

All reset to initial position

************************************************************
C3=1 F6=2 Wrong, Undo calculation

All reset to initial position

************************************************************
C3=1 F6=3 Wrong, Undo calculation

All reset to initial position

************************************************************
C3=8 F6=1 No solution, Fixed

Combination 2-digits cells

E4=2 Wrong, Undo calculation
E4=8 No solution, Fixed
F5=2 Wrong, Undo calculation
F5=3 Wrong, Undo calculation

All reset to initial position

************************************************************
C3=8 F6=2 No solution, Fixed

Combination 2-digits cells

C6=3 No solution, Undo calculation
C6=9 No solution, Undo calculation
E4=1 No solution, Undo calculation
E4=8 No solution, Undo calculation
F3=1 No solution, Undo calculation
F3=7 Wrong, Undo calculation
F3=1 No solution, Fixed
C6=3 No solution, Undo calculation
C6=9 Wrong, Undo calculation
C6=3 No solution, Fixed
B4=4 Wrong, Undo calculation
B4=8 Wrong, Undo calculation

All reset to initial position

************************************************************
C3=8 F6=3 No solution, Fixed

Combination 2-digits cells

C6=2 No solution, Undo calculation
C6=9 Wrong, Undo calculation
C6=2 No solution, Fixed
C5=3 ( H3= ) Solved,

#412--------------------------Solution
002 500 000-------------972 546 831
000 010 000-------------346 819 752
050 700 064-------------158 732 964

500 000 000-------------529 184 673
003 000 400-------------763 295 418
480 600 095-------------481 673 295

800 900 000-------------837 921 546
090 050 007-------------694 358 127
005 067 089-------------215 467 389

Total solving time is : 297 sec.
Number of logical steps is : 25842

... by: numpl_npm

(u where u in 123)J4 & (u)H13 -> contra. with bascis and DFC(Digit Forcing Chains).

... by: numpl_npm

5E6

(u where u in 123)J7 & (u)H13 -> contra. with bascis only, so 46H13.

Then solved with bascis only.

Archive

Each week a new 'unsolvable' will be published and the previous will be accessible here from this archive section. If you like very tough puzzles, these are for you.
Share and Enjoy