Author: Uri Blass
Date: 15:56:52 08/31/02
Go up one level in this thread
On August 31, 2002 at 18:04:27, Tony Werten wrote: >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. >>- History I'm not sure, though I still use it. Some say piece square sorting is >>a good alternative. > >I don't use that right now but am quite suprised of my good branching factor. >There still must be some room for improvement. > >>- FP I don't believe in. You? > >FP by definition can only save nodes when it's incorrect, so I threw it out. I do not understand. Do you mean that pruning based on evaluation,remaining depth and other conditions is not FP. If it is not FP then what is FP? Uri
This page took 0.01 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.