05/12/07 tough puzzle from sudoku.com.au

A complete proof

1) First eliminations : b4=9%block, c3=9%block, h3=3%block, c6=8%col, c5=5%col lead to 26 filled cells.

2) Now :
Look at only possibles g3=2,g1=2 in their block. They forbid{g9=2, g5=2, g7=2}.
Look at only possibles i2=7,h2=7 in their block. They forbid{e2=7, d2=7, b2=7, a2=7}.
Look at only possibles e6=5,e4=5 in their block. They forbid{e3=5, e2=5, e7=5, e8=5}.
Look at only possibles a6=2,a6=1 in their cell. Whether a6=1 (in which case b6=2%cell) or a6=2, in both cases, we have no more {i6=2, h6=2, b5=2}.
Look at only possibles a6=1,a6=2 in their cell. Whether a6=2 (in which case b6=1%cell) or a6=1, in both cases, we have no more {e6=1, i6=1, a4=1, h6=1, b5=1}.
Look at only possibles h8=5,f8=5 in their row. Whether f8=5 (in which case h8=9%row) or h8=5, in both cases, we have no more {h8=4, h8=6}.
Look at only possibles f8=5,h8=5 in their row. Whether h8=5 (in which case f8=9%row) or f8=5, in both cases, we have no more {f8=6, f8=8, f8=2}.
Now easy fillings up to 39 filled cells. (If needed, i8=8%row, g4=8%block, g7=5%col, f8=5%block, f7=9%block, h8=9%block, g2=9%block, h7=4%block)

3)
Look at only possibles h9=1,h9=6 in their cell. Whether h9=6 (in which case g9=1%cell) or h9=1, in both cases, we have no more {c9=1, i7=1, i9=1}.
Look at only possibles h9=6,h9=1 in their cell. Whether h9=1 (in which case g9=6%cell) or h9=6, in both cases, we have no more {f9=6, d9=6}.
Look at only possibles i2=1,i2=7 in their cell. Whether i2=7 (in which case h2=1%cell) or i2=1, in both cases, we have no more {e2=1, a2=1, g3=1, g1=1, b2=1}.
Now easy fillings up to 54 filled cells. (If needed, e2=6%cell, a2=5%cell, d3=5%block, f5=6%block, e4=1%block, g5=1%block, e6=5%block, h4=5%block, h6=6%block, g9=6%block, d7=6%block, i4=7%block, i2=1%cell, h2=7%cell, h9=1%block)

Next chain was found by mark from ny.
4) Here is the hardest step, so as suggested by _unknown, I highlighted the vertices of the heptagon involved !
Look at only possibles e3=7,e3=2 in their cell. Whether e3=7 (in which case d1=4%cell) or e3=2 (in which case g3=4%cell), in both cases, we have no more {g1=4}.
Now easy fillings up to 81 filled cells. (If needed, g3=4%block, g1=2%block, f1=1%cell, c7=1%col, c9=7%block, e7=7%block, e8=3%block, f9=2%block, d9=8%block, f3=8%block, i7=2%block, i9=3%block, b7=3%block, c1=3%block, d2=4%cell, b1=4%block, b2=8%cell, c8=4%block, a1=6%block, b3=1%cell, a3=7%cell, e3=2%cell, b8=6%block, a8=2%block, b6=2%block, d1=7%block, a6=1%block)

Short hints for a proof

Beware, 6-FC needed here:

1) easy to 26 filled.
2) Looking at 2 in Bg2, at 7 in Bg2, at 5 in Be5, at 12 in a6b6, at 59 in f8h8, eliminate some possibles, then easy to 39 filled.
3) Looking at 17 in h2i2, at 16 in g9h9, eliminate some possibles, then easy to 54 filled.
4) Looking at e3, eliminate g1=4 (beware, heptagon). Then easy to unique solution.

Forbidding-chain-like proof

The 6-FC is needed here :

around 26 filled
(g3=2)==(g1=2) forbids {g9=2, g7=2, g5=2}
(i2=7)==(h2=7) forbids {d2=7, e2=7, a2=7, b2=7}
(e6=5)==(e4=5) forbids {e7=5, e8=5, e3=5, e2=5}
(a6=2)==(a6=1)--(b6=1)==(b6=2) forbids {b5=2, h6=2, i6=2}
(a6=1)==(a6=2)--(b6=2)==(b6=1) forbids {a4=1, e6=1, i6=1, h6=1, b5=1}
(h8=5)==(f8=5)--(f8=9)==(h8=9) forbids {h8=2, h8=4, h8=6}
(f8=5)==(h8=5)--(h8=9)==(f8=9) forbids {f8=8, f8=2, f8=6}
around 39 filled
(h9=1)==(h9=6)--(g9=6)==(g9=1) forbids {i9=1, i7=1, c9=1}
(h9=6)==(h9=1)--(g9=1)==(g9=6) forbids {d9=6, f9=6}
(i2=1)==(i2=7)--(h2=7)==(h2=1) forbids {g1=1, g3=1, e2=1, b2=1, a2=1}
around 54 filled
(d1=4)==(d1=7)--(e3=7)==(e3=2)--(g3=2)==(g3=4) forbids {g1=4}

Equivalence with 2005/09/28

Now applying the same "dictionary" (renaming numbers, replacing cells) to proof of 05/09/28 you will mechanically get a proof of today's. E.g. first filled cell in 05/09/28 was h2=8%block; in today's it becomes h3=3%block. Try it ! Or see the method explained step by step on 10/08 example.
In case that you be lazy enough not to find it by yourself, see hints for today's proof (automatically derived from 05/09/28's proof).