Author: Drexel,Michael
Date: 10:29:32 09/15/03
Go up one level in this thread
On September 15, 2003 at 13:23:14, Drexel,Michael wrote: >On September 15, 2003 at 12:55:53, Tord Romstad wrote: > >>On September 15, 2003 at 12:29:52, Drexel,Michael wrote: >> >>>On September 15, 2003 at 12:25:25, Tord Romstad wrote: >>> >>>>On September 14, 2003 at 17:58:56, Roy Eassa wrote: >>>> >>>>>[d] 4r1k1/p4ppp/1p1q1n2/1Pb1n3/8/1N4P1/PB3PBP/2RQ2K1 b - - 0 1 >>>>>Brutus played ...Bxf2+ >>>>> >>>>>1... Bxf2+!? >>>> >>>>Like Will Singleton, I think many (perhaps even most) programs will >>>>play Bxf2, but I think finding a win for white will take a very long >>>>time. >>>> >>>>Gothmog 0.3.0 plays Bxf2 after less than 4 seconds, but it's a purely >>>>speculative sacrifice. The score is not at all convincing: >>> >>>It is not speculative, it is almost forced. Everything else is very bad for >>>white. >> >>Sorry, I should have been clearer. I meant that Gothmog plays Bxf2 as >>a speculative sacrifice, from a subjective point of view. It does not >>see a win for black, but just gambles that black's attacking chances will >>be sufficient to compensate for the piece. >> >>Tord > >You are the programmer ... > >But if your program also sees in less than 4 seconds that >1... Nd3 is bad because of the forced >2. Nxc5 bxc5 3. Bf1 Re1 4. Qd2 Rxc1 5. Bxc1 c4 6. Qc3 Qd5 7. Bxd3 Qxd3 >8. Qxd3 cxd3 (with clearly better endgame for white) then it would be quite an >achievement. >All top programs need at least several minutes to find it. > >Michael All that I have tested Dont know about Junior :)
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.