Author: Ricardo Gibert
Date: 16:04:20 09/02/99
Go up one level in this thread
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. Sites with information on computer chess: http://www.xs4all.nl/~verhelst/chess/ http://www.ics.uci.edu/~eppstein/180a/s97.html http://www.maths.nott.ac.uk/personal/anw/G13GT1/compch.html#end http://forum.swarthmore.edu/~jay/learn-game/index.html http://www.npac.syr.edu/copywrite/pcw/node341.html http://www.geocities.com/SiliconValley/Campus/9925/cchess.htm I hope this is helpful. Someone else posted a much more extensive list once. Maybe they will repost.
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.