Author: blass uri
Date: 12:25:27 08/07/00
Go up one level in this thread
On August 07, 2000 at 15:02:24, leonid wrote: >On August 07, 2000 at 11:03:56, leonid wrote: > >>On August 07, 2000 at 08:30:35, blass uri wrote: >> >>>[D]6k1/6pp/1Q1pn1rr/p1p1p3/2P1P2q/1P3P1P/P2RN1PK/6R1 w - - 0 1 >>> >>>How much time does your program need to find Rxd6? >> >>Four seconds. >> >>Probably this is not the best move but my program see only it in 8 and 10 ply >>brute force search. In 6 plys search it says Rook d2-d6. >> >>After every move by whites black likely to be sure to excute the mate. >> >>AMD 400Mhz. 8 ply - 3.5 second. 10 ply - 2 min. 45 second. > > > >My mistake! Had fixed idea that you indicated move by Queen. > >Exacte time and moves: > >6 plys - Rook d2-d6. 0.4 second. > >8 plys - Queen goes to d6. 3.5 second. > >10 plys - Queen - d6 2 min. 45 second. > >Search by brute force. Average NPS - 288k. Qxd6 is wrong. I believe that after Qxd6 Qf2 your program will do another mistake and play Qb8+(kh1 is the right move) after Qb8+ chessmaster(selevtive search=10) play Kf7 with evaluation of mate in 15 moves Your program have no chance to see the mate because it needs to search 29 plies in order to see it(I assume no extensions) Chessmaster uses extensions so it can see it after 8 minutes on pentiumIII450 I also believe that your program will not see that Qb8 is bad in a few minutes. Part of the top programs need some minutes to see that Qb8+ is bad(chessmaster is an exception and has no problem to see that Kh1 is the best move after Qxd6 Qf2. Your program is weaker because it does no extensions so it probably needs at least some hours. 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.