Author: Rory Nolan
Date: 23:49:28 09/27/01
Go up one level in this thread
On September 27, 2001 at 18:13:57, Roy Eassa wrote: >On September 27, 2001 at 18:03:43, Uri Blass wrote: > >>On September 27, 2001 at 17:45:03, Roy Eassa wrote: >> >>>I thought all programs searched everthing one ply first, then two ply, then >>>three, etc. If there's a MATE at one ply, then it would find it in a tiny >>>fraction of a second, no matter which order it chose to look at the moves, no? >>>Or is it doing extensions on other moves, even at ply 1? >> >>yes >>it does a lot of extensions in this kind of positions. >>it extend all the logical captures. >>usually the number of captures is not big so it can finish the job very fast but >>it is not the case in the relevant position. >> > >Would it be reasonable, then, for modern programs to avoid doing extensions on >the first several ply? Or for the first 1% of the allotted time? Or something >like this? Junior 7 results Junior 7 - Nolan,R 8/8/pppppppK/NBBR1NRp/nbbrqnrP/PPPPPPPk/8/Q7 w - - 0 1 Analysis by Junior 7: 1.axb4 Qxf3 2.Rxg4 Rxd5 3.gxf4 +- (4.27) Depth: 3 00:00:00 3kN 1.Qh1# +- (#1) Depth: 3 00:00:00 16kN +- (#1) Depth: 3 00:00:00 16kN ( 28.09.2001) take care Rory
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.