Author: Stuart Cracraft
Date: 16:20:15 12/22/05
Go up one level in this thread
On December 22, 2005 at 18:18:02, Stuart Cracraft wrote: >The only selectivity of which I am aware is progressive, >narrowing of # of moves searched at each ply as the tree >deepens - disadvantages can include throwing out good moves. >Requires lots of knowledge and sophisticated evaluation >to avoid that and even then it does. We're back in the A. >vs. B arena. This is 40+ year-old concept from looking >at MacHack. > >But about 20-25 years ago, selectivity of a different sort >(I think) started making its rounds. I remember Larry Kaufman >and John Stanback talking about it quite a bit and saying >they'd get somewhat deeper searches and improved results >even though it was ostensibly less accurate. > >So I want to ask EXACTLY how you are implementing selectivity >in your program. > >I threw together something and it did far poorer in a tactical >suite - so obviously my conception of selectivity is poor itself. > >I seek enlightenment from the august programmer members of this >board in "What is selectivity?" > >Stuart I am discounting null move search, extensions, and reductions. I am interested in other types of selective. Are there any that work?
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.