Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Best Algorithm Variation

Author: Pat King

Date: 13:25:19 04/27/04

Go up one level in this thread


On April 27, 2004 at 15:37:39, Ed Trice wrote:


>Large hash tables will be of help, but the history hueristic and move sorting
>really work synergistically with good leaf node evaluation routines.

This can NOT be understated! EVERYTHING works better with good move ordering. It
should be one of your first priorities - MVV/LVA for captures and history for
quiet moves are easy to implement and a great place to start.

Pat King



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.