Author: Pat King
Date: 05:02:43 09/20/98
Go up one level in this thread
On September 19, 1998 at 11:14:40, Guillem Barnolas wrote: > > I am currently developing a pascal chess program which I think will be >quite weak, because to generate legal moves I'm generating all the moves and >then discarding the ones that leave the king in check... Generating only legal >ones seems quite tough. I do my chess programming in pascal as well, and so far it's pretty weak, too. But not for the above reason. I think it saves time NOT looking for check when generating moves, as there's a good chance that many of those moves will never get played. Checks get caught automatically in the search (as do stalemates and checkmates, I have no explicit code for this). Don't let the C nazis get to you. We Pascal types have to stick together ;) Pat
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.