Author: pete
Date: 14:12:57 06/22/00
On June 22, 2000 at 17:06:40, Chessfun wrote: >>> >>>SS = Selective Search Unless told to do otherwise, the computer >>>considers every possible play and its implications to an infinite number of >>>plays before making its next move. This makes for slow and, therefore >>>relatively weak, play by the computer. The default here is 6, which means >>>that the computer selectively disregards unpromising lines for the first six >>>plies of the search. Beyond the selective search, it does a brute force >>>Search of all possible remaining moves. >>> >> >>This sounds a little messed up to my ignorant self ; after being selective in >>the 1st 6 plies you suddenly do brute force in the far away regions of the tree >>? >> >>I suppose I have yet _way_ to go ; this is nearly the opposite I would have >>expected from a selective search . > >Maybe, but was cut and pasted out of CM6K. >Thanks. So it was probably written by someone who knows what he/she is talking about . I would definitely like to understand this as it is probably a major misunderstanding on my side . Maybe one of you chessprogrammers has a minute for some very basic explanation ? thanks in advance. pete
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.