Author: Robert Hyatt
Date: 14:28:12 01/02/99
Go up one level in this thread
On January 02, 1999 at 02:40:35, Horace Ho wrote: >Hi, > > I am new to chess programming and have started >a simple chess program. > > I have some questions (please point me to a FAQ >if these are some of them): > > 1. What's the alternative to a hash table to > eliminate repeated board position? I want my > program to run on a limit memory device, say, > only 32k max for a hash table. Is such a small > hash table meaningful? there isn't an alternative. You can live without one, but move ordering and endgames will really suffer badly as a result. > > 2. When should I return from a quiesce search? > Sometimes there is a long capture, recapture > path down the tree. Should I return at certain > depth? nothing special to do, other than to handle the "stand pat" case which will stop most capture sequences (ie it is your move, and the current score is already > beta, there is no need to try to improve the score further since it can't be > beta in the AB search... > > 3. What's the best sorting algorithm for a move > list (in a memory limited environment)? PV move from last search. captures that appear to win material or break even killer moves rest of moves. if you have 4K for counters, the history heuristic is another good move ordering idea... > >Thanks >horace
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.