Author: Robert Hyatt
Date: 21:35:09 06/28/98
Go up one level in this thread
On June 28, 1998 at 22:19:39, jonathan Baxter wrote: >On June 28, 1998 at 21:24:10, Robert Hyatt wrote: > >>null-move is speculative. Cray Blitz is tactically stronger than any >>program I know of today excepting Deep Blue, based on things like the >>Win At Chess results I have posted here before. It uses null-move, R=1, >>non-recursive (only one null move in any single path). > >So where can I find these Win At Chess results? On this note, >I did an experiment with KnightCap the other day on some winatchess problems >(Andrew has them in the KnightCap source code directory but I don't know where >they came from . the file is called "difficult.fin"). I changed the evaluation >function to just material and tested on the problems with 30s to find a >solution. KnightCap gets 78% correct, compared to only about 30% with the full >eval. > >Jonathan Baxter Good question. But I just got some of the latest results from my chess partner at Livermore Labs... CB (running on a T932 (32 processor T90, 2 gigawords (16 gigabytes) of memory) gets 297 in under 1 second (it reports the time as 0 seconds, but only displays whole seconds. two take 1 second, and 1 takes 7 seconds. An older version didn't have that 7 second spike, not sure what caused it. This was on the last version we did of Cray blitz, called Cray Blitz version 43i. It is *very* fast, the output says it averaged just over 11M nodes per sec on the 300 positions.
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.