Author: Cristian Zaslo
Date: 14:10:07 10/05/98
Hi everybody! One day I made a comparison between some ZX Spectrum chess programs (Colossus 4.0, Superchess 3.5) and some medium - level PC programs (K-Chess, Now, Gnu Chess) and found that these ZX programs use a pretty strange searching algorithm (for me) , as follows : 1. It seems to me that entire searching tree is built round the PV which is often longer than current depth and it may contain “positional moves” (no captures or checks) everywhere including in the Q-search part. 2. The other branches are cut-of very quickly, sometimes just from the root, and so, can overlook. good moves. I now that many programs (mine too) grow branches this way: (Depth + Extension) + Q-Search I’d like to now a little bit more about the search-engine (cut-off techniques) used by these “old fashioned programs” and if this approach still (no)works on any PC programs. Much obliged to you, Cristian Zaslo
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.