Author: Brian McKinley
Date: 19:00:23 10/15/97
I am writing my first chess program from scratch. At this point the evaluation of a position is based purely on strength. The program does a breadth first search of moves with a limit on the number of moves to search. I am still focused more on the organization of classes than on the algorithms and speed. I give this back ground so that you will take my level of experience into account when answering my question. There are many references to hash tables in the posts here. I am well acquainted with the use of hash tables, but have not been able to infer their application to a chess program from the message contexts. I seem to be missing something which is obvious to everyone else. Could someone take the time to give me a brief overview? Thanks
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.