Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Parallel search article RBF

Author: Robert Hyatt

Date: 08:40:19 09/11/02

Go up one level in this thread


On September 10, 2002 at 23:56:26, Dann Corbit wrote:

>http://www.math.tau.ac.il/~ysh/RBF.pdf


It is interesting, but not for chess.  Best-first is not alpha/beta
and the trees are generally huge...

It also has a _large_ memory complexity.



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.