Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: pruning vs extensions vs qsearch - are these all effectively the sam

Author: David Rasmussen

Date: 01:30:34 12/02/02

Go up one level in this thread


On December 01, 2002 at 20:35:17, Dave Gomboc wrote:

>
>That is where we disagree.  I believe it is sufficient to solve one problem, if
>you solve the right one.
>

It is better to solve one general problem than two specific problems, if you can
do it elegantly, cleanly and orthorgonally. However, I don't believe you can do
that in the case of chess, if you still want to follow the same old scheme of
searching, reaching quiet positions and evaluating. Of course, one can have an
entirely new idea and do things in a different and better way. I am not saying
this can't be done. I am just saying that until you get that very good idea,
separating qsearch and normal search is a good idea. They are _not_ one problem,
as things are now.

/David



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.