Author: Kolss
Date: 01:01:49 07/27/02
Go up one level in this thread
On July 27, 2002 at 03:24:26, Terry McCracken wrote:
>http://www.chessbase.com/events/games/2002_dortmund/dort10b.htm
>
>
>(2) Topalov,V (2745) - Bareev,E (2726) [C11]
>Sparkassen sf Playoff Dortmund GER (2), 17.07.2002
>
>.e4 e6 2.d4 d5 3.Nc3 Nf6 4.Bg5 dxe4 5.Nxe4 Nbd7 6.Nf3 Be7 7.Nxf6+ Bxf6 8.h4 c5
>9.Qd2 cxd4 10.Nxd4 h6 11.Bxf6 Nxf6 12.Qb4 Nd5 13.Qa3 Qe7 14.Bb5+ Bd7 15.Bxd7+
>Kxd7 16.Qa4+ Kc7 17.Rh3 a6 18.Rb3 Qc5 19.0-0-0 b5 20.Qa5+ Qb6 21.Qe1 Kb7 22.Qe2
>Ka7 23.Nxb5+ axb5 24.Rxb5 Qc6 25.Rdxd5 exd5 26.Qe7+ Ka6 27.Rb3 1-0
>
>After 22...Ka7
>
>[D]r6r/k4pp1/pq2p2p/1p1n4/3N3P/1R6/PPP1QPP1/2KR4 w
>
>
>How quickly does fast hardware and top software, find this combination?
>
>Terry
We had this position a while ago. I stated that it is not very difficult for
computers to find. But of course, I would be more than proud to ever find such a
comnination in a real game!
Ikarus (K6/2-475MHz, 8MB Hash => rather slow hardware, mediocre software...)
finds the correct move in 14 seconds:
9 11 +0.85 1. a4 b4 2. c4 Qc5 3. Nc2 Nb6 4. Rxb4 Rad8 5. b3
9 14 FailHigh 1. Nxb5+! axb5 2. Rxb5 Qc6 3. Rdxd5 exd5 4. Qe3+ Ka6 5.
Rb4 Qc7 6. Qd3+
9 15 +2.12 1. Nxb5+ axb5 2. Rxb5 Qd6 3. Rd4 Nc3 4. Qd2 Nxb5 5. Rxd6
Nxd6
10 17 FailHigh 1. Nxb5+! axb5 2. Rxb5 Qd6 3. Rd4 Nc3 4. Qe3 Ne2+ 5. Qxe2
Qxd4 6. Qf3
10 22 +2.98 1. Nxb5+ axb5 2. Rxb5 Qc6 3. Rdxd5 exd5 4. Qe7+ Ka6 5.
Rb3 Qb6 6. Rxb6+ Kxb6 7. Qd6+ Ka7
11 34 +3.06 1. Nxb5+ axb5 2. Rxb5 Qc6 3. Rdxd5 exd5 4. Qe3+ Ka6 5.
Rb4 Qb5 6. Rxb5 Kxb5 7. Qd3+ Kc5
I expect many commercials to be even a lot faster, but I leave that to others to
find out...
Regards, Munjong.
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.