Author: Christophe Theron
Date: 09:39:57 04/02/98
Go up one level in this thread
On April 02, 1998 at 03:54:07, Pat Butler wrote:
>
> What is the easiest way to make my java program play a reasonable
>endgame?wihin the limits of very small number of plies and quiescent
>search.
>should i program for specific types of endgame or is an ending book the
>way this problem would be solved.
>is there any obvious research/publication that i should read on this
>subject.??
>pat butler
1) Implement hash tables, if not already done. You'll solve endgames
problem maybe 10 times faster.
2) Take all the time needed to evaluate accurately passed pawns. I took
me one month to have a reasonable one, and it's going to take the rest
of my life to improve it.
3) Use a special dedicated search algorithm in the endgame. The kind of
search we use in middle game doesn't fit well in endgames positions.
Christophe
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.