Author: Chris
Date: 14:06:39 08/13/02
Go up one level in this thread
Game stats: N.Short - J.Timman (Tilburg, 1991): > >1.e4 Nf6 2.e5 Nd5 3.d4 d6 4.Nf3 g6 5.Bc4 Nb6 6.Bb3 Bg7 7.Qe2 Nc6 8.0-0 0-0 9.h3 >a5 10.a4 dxe5 11.dxe5 Nd4 12.Nxd4 Qxd4 13.Re1 e6 14.Nd2 Nd5 15.Nf3 Qc5 16.Qe4 >Qb4 17.Bc4 Nb6 18.b3 Nxc4 19.bxc4 Re8 20.Rd1 Qc5 21.Qh4 b6 22.Be3 Qc6 23.Bh6 Bh8 >24.Rd8 Bb7 25.Rad1 Bg7 26.R8d7 Rf8 27.Bxg7 Kxg7 28.R1d4 Rae8 29.Qf6+ Kg8 30.h4 >h5 > >4rrk1/1bpR1p2/1pq1pQp1/p3P2p/P1PR3P/5N2/2P2PP1/6K1 w - a6 0 31 > >Does any program find Shorts 31. Kh2? > >31.Kh2! Rc8 32.Kg3 Rce8 33.Kf4 Bc8 34.Kg5 with the idea Kh6 and mate.. > > >The idea of mating with the king in the middle game is very unusual, but maybe >the programs can find it anyway by using brute force?
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.