Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Best Algorithm Variation

Author: Stefano Gemma

Date: 02:02:11 04/27/04

Go up one level in this thread


On April 27, 2004 at 03:57:40, Volker Böhm wrote:

>do u have move ordering allready?
>
>IMHO hash with best move for move ordering will give best results.

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).

I think it could be interesting to quantify the gains of the various technics,
just to see wich one should be surely implemented in a competitive chess engine.

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.