Author: Tom Kerrigan
Date: 17:54:15 09/03/99
Go up one level in this thread
All of the functions that comprise the move generator are in board.c and are fairly well commented, IMHO. Is there one that you don't understand in particular? I never actually measured how many NPS TSCP searches. Other people on this group know much more about it than I do, oddly enough. :) -Tom On September 02, 1999 at 18:39:41, Nicolas Carrasco wrote: >Dear Tom, > >I is a pleasure to talk with you. Your chess program is the most readable I have >seen, but the problem I have is that your move_generation functions are too >divided. For example captures and promotions. I also can´t understand how you >use Min-Max and all search algorims. Can u explain me how the gen works >(summary)? and the search algorims? > >Every night before getting to bed to sleep. I study your program. > >Thanks > >PS: How many Nodes per seccond your Simple Chess Program can make per seccond in >a 32 bits mode.
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.