Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Another Candidate for the Most Difficult Tactical Combo in the World

Author: Roy Eassa

Date: 13:24:16 02/08/02

Go up one level in this thread


On February 08, 2002 at 16:20:02, Roy Eassa wrote:

>On February 08, 2002 at 16:05:22, ALI MIRAFZALI wrote:
>
>>Some of my previous posting on this Topic where solved By some programs;
>>(Like Sjeng)(which I do not think is a good program) this time I am
>>sure That no program in The WORLD will even Come close to Solving
>>this.Theposition is from a game between an IM and a GM (with the GM winning).
>>In my opinion the Position is More difficult than all of THE NOLOT famous
>>test Positions.It should therefore serve an a benchmark.Needless to say finding
>>such positions is no easy matter ;because it requires many hours (days;Months)
>>of research.
>>[D]r1bq1r2/p2np1k1/3p2pR/3pP3/2pP4/5N2/PP2Q1P1/2KR1B2 w
>>Important Note:the solution is not sensative to Extentions!!
>>The solution as played in the actual game is:(in great style):19.Rxg6+!! Kxg6
>>20.Nh4+ Kh6 21.Qe3+ Kh7 22.Bd3+!! cxb3 23.Qxd3+ Kh8 24.Rh1 Nf6 25.exf6 Qc7+
>>26.Kb1 Rxf6 27.Nf3+ Kg8 28.Qh7+ Kf8 29.Qh8+ Kf7 30.Ng5+ Kg6.31.Qh5+ (1-0)
>>What does your program say? For Comparison here is the line given by
>>CM 8000 after 11 hours of furious Computation on a 500 MHZ Computer
>>19.Qe3 Rxf3 20.gxf3 Nf8 21.Bh3 Qb6 22.exd6 Rb8 23.Rd2 Qxd6 (No Cigar).
>
>
>If it's 100% sound, it's a good one.
>
>Trying the position before move 22:
>
>[d] r1bq1r2/p2np2k/3p4/3pP3/2pP3N/4Q3/PP4P1/2KR1B2 w - - 0 22
>Fritz 7 cannot find Bd3+ in 4 minutes (so far) on my Athlon 1.2 GHz.


However, if I force 4.Bd3+, Fritz sees that White is better after 42 seconds:

[d] r1bq1r2/p2np2k/3p4/3pP3/2pP3N/3BQ3/PP4P1/2KR4 b - - 0 1

1...cxd3 2.Qxd3+ Kh8 3.Rh1 Nf6 4.Ng6+ Kg7 5.Nxf8 Qxf8 6.exf6+ Qxf6
  -+  (-1.72)   Depth: 8/27   00:00:00  304kN
1...cxd3 2.Qxd3+ Kh8 3.Rh1 Qc7+ 4.Kb1 Nf6 5.Ng6+ Kg7 6.Nxf8 Ne4 7.Rc1
  -+  (-1.66)   Depth: 9/29   00:00:01  611kN
1...cxd3 2.Qxd3+ Kh8 3.Qg3 Qc7+ 4.Kb1 Nf6 5.Ng6+ Kg7 6.Nxf8+ Kxf8 7.exf6 exf6
  -+  (-1.60)   Depth: 10/32   00:00:04  2434kN
1...cxd3--
  µ  (-1.32)   Depth: 11/31   00:00:07  4330kN
1...cxd3 2.Qxd3+ Kh8 3.Rh1 Rf1+ 4.Qxf1 Qc7+ 5.Kb1 Kg8 6.Nf5 Nxe5 7.dxe5 dxe5
  =  (-0.22)   Depth: 11/39   00:00:20  11767kN
1...cxd3--
  =  (0.00)   Depth: 12/35   00:00:27  15965kN
1...cxd3 2.Qxd3+ Kh8 3.Rh1 Nf6 4.Nf3+ Bh3 5.Rxh3+ Kg7 6.exf6+ Rxf6
  ²  (0.50)   Depth: 12/41   00:00:42  25452kN

so I imagine it would have found 4.Bd3+ in a decent amount of time.  But I agree
that it would have taken a _long_ time to find the complete win from the
original position.



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.