Author: Robert Hyatt
Date: 07:47:21 08/31/00
Go up one level in this thread
On August 30, 2000 at 14:59:52, Severi Salminen wrote: > >>>So is this what basically happens: >>>1. you generate pseudo-moves >>>2. you give captures a big priority plus >> >>Or, generate just capture moves and search the good ones (whatever that means) >>first. > >So, now I'd like to know whether to start directly using bitboards, or rotated >bitboards or not (using simple array)? Where could I find info on different >methods and benefits? > >>Or, >>generate remaining moves >>scan the new part of the move list and select the move with the highest history >>score. >>repeat 3-4 times. > >Didn't get that one. Repeat _what_ 3-4 times? We already generated all the >moves, captures first then the others. You make a pass through the move list and choose the move with the highest history counter. Search that. Make another pass thru the move list and choose the move with the highest history counter. Search that. Do this maybe 4 times total (do not sort based on history counter, as the sort is expensive and the first history move may well give you a cutoff. > >>>Right? >> >>Yes. > >I'm sooooo smart ;)
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.