Author: Horace Ho
Date: 23:40:35 01/01/99
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?
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?
3. What's the best sorting algorithm for a move
list (in a memory limited environment)?
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.