Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Best Algorithm Variation

Author: Thorsten Greiner

Date: 03:30:26 04/27/04

Go up one level in this thread


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.



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.