Author: Mike S.
Date: 17:55:36 05/24/02
Go up one level in this thread
On May 24, 2002 at 20:29:32, K. Burcham wrote: >Looking for test positons that programs will not play in a reasonable time, but >a GM has played in a game and won material or position. Benjamin - Xu Jun, Seattle 2001: [D]4qrk1/3nppb1/R1Np2p1/3P2P1/1Pr5/4B3/5Q1P/5R1K w - - bm Ra8; id Quick-04; Karpov - Shirov, Biel 1992: [D]r5k1/Rb4p1/2q2pBp/1pp5/1b4QN/1P2P2P/5PP1/6K1 w - - bm Rxb7; id Quick-07; Karpov - Kortschnoj, Moskow 1974: [D]2r3k1/pp1bpp1p/3p1npQ/q1r5/4P1P1/2NR1P2/PPP1N3/2K4R w - - bm g5; id Quick-10; Fischer - Gligoric, Candidates 1959: [D]2r3k1/pp1b1p2/1q1pp1p1/2r3Pn/4P3/1BN2Q2/PPP5/1K1R3R w - - bm Rxh5; id "Mike's Test 2.2, Nr. 23"; The engine's performances are different at these positions, as always... so it may happen that some solve one quickly (and don't find the next at all). It's difficult to find positions which *no* engine will solve in reasonable time (and which are correct :o). Regards, M.Scheidl
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.