Author: Uri Blass
Date: 03:33:24 07/27/02
Go up one level in this thread
On July 27, 2002 at 03:44:33, Uri Blass wrote: >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 > >You do not need top software for it. > >A buggy version of Movei on p800 >finds it in less than 2 minutes. > >9 119 9479 10292575 a2a4 b5b4 c2c4 b6c5 d4c2 d5b6 b3b4 a8c8 c1b1 b6c4 d1d7 a7a8 >d7f7 >9 120 9691 10550697 d4b5 >9 296 10974 11876964 d4b5 a6b5 b3b5 b6c6 d1d5 e6d5 e2e7 a7a6 b5b3 c6b6 b3b6 a6b6 >e7d6 b6a7 d6d5 Hopefully less buggy version of movei solves it faster. 69.93 seconds and 8258070 nodes to fail high 9550160 nodes to solve the fail high. It still have bugs because I found that it can have a wrong pv in the qsearch (a pv of mate in 3 when it says mate in 2 but can find the right moves) but at least it solves every position that I tried faster and I hope that it does not return wrong scores from the qsearch. Uri
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.