Author: Melvin S. Schwartz
Date: 20:32:56 02/02/99
You stated that Selective Search looks deeper but with intrinsic error. Then you said Brute Force takes longer but will get to the same depth without the errors. Now, how could you say Selective Search looks deeper and then say Brute Force takes longer but gets to the same depth? Also, are you saying that one method results in a higher chess rating? If so, which do you feel would have a higher chess rating? The SSDF (Swedish Rating System) always rates the chess computers with Selective Search. From my limited experience playing against both methods, I find that Selectve Search does on some occasions make a better move than Brute Force. So far I have not found the reverse to be as common. Although I must admit the occasions where there is a difference in the move seems to be rather infrequent. It appears from the limited response to this controversy that it has not really stirred up much of an interest from other club members. Mel
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.