Author: Stefano Gemma
Date: 06:58:07 04/28/04
Go up one level in this thread
On April 27, 2004 at 06:30:26, Thorsten Greiner wrote: >On April 27, 2004 at 05:02:11, Stefano Gemma wrote: > >>Yes, i already use move ordering and iterative deepening. In my old programs i >>had used killer moves. In the new one, i'm trying something new (genetical >>algorithm etc). > >Using killer moves can improve your move ordering, but I do not expect it to >give a large performance boost. If you want to single out a technique it is >definitely null move which will drastically improve (i.e. lower) the branching >factor in your search tree, thus allowing deeper searches. Thanks to all. I think that i could start from NM, because it is very simple to implement. Another thing i have to add is quiescent search, because i'm still working with a fixed depth. Ciao!!! Stefano Gemma
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.