Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Brute Force vs. Selective Search Re: Fernando & Jim

Author: Paulo Soares

Date: 15:16:37 01/24/99

Go up one level in this thread


On January 24, 1999 at 17:31:15, Melvin S. Schwartz wrote:

>I contacted a technical advisor from Saitek in Hong Kong who assured me that
>Brute Force was superior to Selective Search. His reason was that Brute Force
>searches more extensively and therefore minimizes the risk of an occasional
>oversight. Apparently the Selective Search is quicker but not as thorough. So,
>from this I would assume that IM Larry Feldman was wrong or misinformed. It is a
>shame that he has not responded to my query. However, it does appear he was not
>correct in what was stated in his review.


Melvin,
I did not read the news article that IM the Larry Feldman
wrote.  Also I did not read his question to IM Larry, for this
reason I am asking:  which the amount of brute force?  which the degree
of selective search?
Thanks

Paulo Soares



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.