Computer Chess Club Archives

Search

Messages

Subject: Ignorant Question: What are "Search Rules"?

Author: Bob Durrett

Date: 06:58:06 12/06/02

Go up one level in this thread

On December 06, 2002 at 09:34:16, Uri Blass wrote:

<snp>

>Improvement in search rules can help also in non tactical positions.
>Searching deeper helps also when there is no combination.
>
>Uri

Please realize that I am currently a user and not a programmer.  To be more
accurate, I am an obsolete archaic Fortran programmer, sort of.  Hence the words
"Ignorant Question."

There have been many "tricks," such as alpha/beta, discussed here.  The
*primary* purpose of these tricks seems to be to avoid evaluation of unimportant
portions of the tree of moves [with root at the position of the last move
played].

But, to the best of my recollection, this is the first time I have seen the
words "search rules" used here at CCC.  What are they, and what are they good
for?

Bob D.

• Re: Ignorant Question: What are "Search Rules"? Uri Blass 07:27:44 12/06/02
  • Re: Ignorant Question: What are "Search Rules"? Bob Durrett 07:54:32 12/06/02
    • Re: Ignorant Question: What are "Search Rules"? Uri Blass 08:51:32 12/06/02
      • Re: Ignorant Question: What are "Search Rules"? Bob Durrett 09:23:21 12/06/02
        • Re: Ignorant Question: What are "Search Rules"? Uri Blass 09:54:12 12/06/02

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.