Author: Uri Blass
Date: 14:47:35 08/31/02
Go up one level in this thread
On August 31, 2002 at 16:15:01, Bas Hamstra wrote: >On August 30, 2002 at 12:30:32, Tony Werten wrote: > >>On August 30, 2002 at 11:27:42, David Hanley wrote: >> >>>So, you do: >>> >>>hash >>>killers >>>captures >>> >>>do you sort captures at all? >> >>Yes, MVV/LVA. >> >>so: >>Hash >>Captures >>Killers >>Rest >> >>XiniX isn't really fast so most of the time I get a bestmove from hashtable ( >>not very much overwritten entries ) >>In addition; since I threw out aspiration search as well I seem to be having >>more bestmoves in the table. >> >>Tony > >Heyyy Tony! :-) > >Just for a comparison: > >- Well, aspiration we agree. In other words you always start iterations with search(-infinite,infinite,depth)? >- History I'm not sure, though I still use it. Some say piece square sorting is >a good alternative. What do you mean? Do you mean having a smaller table of piece,square instead of a table of square,square? <snipped> >- FP I don't believe in. You? Is FP forward pruning? I use pruning based on evaluation,remaining depth and other conditions. 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.