Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: Parallel search article RBF

Author: Robert Hyatt

Date: 08:41:13 09/11/02

Go up one level in this thread

On September 11, 2002 at 07:33:56, Gian-Carlo Pascutto wrote:

>On September 11, 2002 at 00:36:21, Dann Corbit wrote:
>
>>Since the speedup was almost linear, I would say it is better than any [other]
>>known method.
>
>It's 7-15 times slower than alphabeta.
>
>If you start out by being 7 times slower, it's not hard to get good speedups.
>
>--
>GCP


that is the point.  And it also takes a huge amount of memory since best-first
has to store the whole tree as it is traversed.

This page took 0.01 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.