Author: Bas Hamstra
Date: 01:42:10 07/11/00
Go up one level in this thread
Thanks for the interesting info. Is there a website? Bas. On July 10, 2000 at 16:37:09, Pierre Bourget wrote: >Yes great performance by P. ConNers in this tournament , beating Dautov (2606) >today .I remember that it score 4.5/7 at Paderborn earlier this year.This is a >brief description i found but don't know if it is still valid as for hardware >equipment: > >P.ConNerS >P.ConNerS stands for 'Parallel Controlled Conspiracy Number Search'. It has been >written by Ulf Lorenz, who is a member of Prof. Dr. Burkhard Monien's research >group at the University of Paderborn. U. Lorenz mainly works on the research >fields of domain independent selective search in game trees, and on the field of >efficient parallel algorithms for optimization problems. P.ConNerS uses a >variant of the so called 'Controlled Conspiracy Number Search' algorithm. As a >result it examines highly selective and irregular game trees. Evaluations are >done by the help of depth 2 alphabeta searches. When it runs on a parallel >machine with 60 Pentium 300 MHz processors, P.ConNerS reaches a rate of about >1.2 million nodes per second. In February 1999 it won the 8th International >Paderborn Computer Chess Championship. > >Pierre
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.