Computer Chess Club Archives




Subject: Re: The Scalable Search Test / Results of "Der Bringer"

Author: Gian-Carlo Pascutto

Date: 12:12:43 06/18/00

Go up one level in this thread

On June 18, 2000 at 14:55:43, pete wrote:

>Looks pretty impressive to me ; unfortunately you will have to wait for Gerrit
>Reubold to exlain the interesting part of your question :-)

I'm interested for sure. The results you posted beat everything else
hands down.

The maximum effective branching factor (measured by time) is as low as
5 AND it spots the mate quickly.


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.