Author: Keith Evans
Date: 21:27:54 04/09/02
When Hsu designed the move generator for Deep Blue he added extra hardware so that he could generate checking (even discovered checks) and check evasion moves more quickly than his first move generator could. (Compare the diagrams for the square transmitters and receivers in the IEEE micro article to those in his thesis and to those describing the Belle generator.) He could have generated these moves without the extra hardware and design time by iterating through moves and throwing away moves which didn't meet the criteria, but apparently he thought that the performance of the move generator was important enough in these cases to justify adding the complexity. What's the general opinion on this? Was this time well spent, or was it a waste of time? I searched for information on what programs typically do during qsearch and couldn't find much of anything directly related. It seems like he would have simulated this before commiting to design, and perhaps discussed it publicly with some top programmers. Is there some time other than qsearch where this would be of interest? Thanks, Keith
This page took 0.01 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.