Author: Pierre Bourget
Date: 07:31:16 02/09/02
Go up one level in this thread
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). Who are the players ? Pierre
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.