Author: Engin Üstün
Date: 10:38:46 08/17/02
Go up one level in this thread
i want not to discuss about fast bitboards or bit operations! my title is why write a fast chess program, and not a selective search program like a human chess player. i positions if alpha > beta cuts the program, but if not is searching all moves. i am thinking about the program picked some 1-5 possible canditate moves in a position and search only them.
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.