Author: Carlos del Cacho
Date: 14:03:05 08/30/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. The idea is that if you don't fail high searching your first moves you aren't going to fail high in the remaining moves, so you'll have all of them anyway. So why spend time in picking a move (selection sort) if with a 99% probability you'll search all moves? > >>>Right? >> >>Yes. > >I'm sooooo smart ;)
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.