Author: Pete Galati
Date: 21:52:47 03/02/01
Go up one level in this thread
On March 02, 2001 at 23:05:02, Robert Hyatt wrote: >On March 02, 2001 at 19:45:03, Pete Galati wrote: > >>Here's what I started yesterday, and this is not an attempt to measure either >>program's strengths, just watching them search for extended times for each move >>and avoid sharing the computer's cpu. > > > > >There is a down-side to this in Crafty. When it uses a normal time >control, it can use more time when it senses trouble (ie on a fail-low). >With st=n, it can't. It will always move in n seconds, period. Even if >it sees the score drop from +1 to -Mate... Ok, I thought there would probably be a time control problem with this. But I figured that probably with longer than normal times for searching each move, that on average that each program would make some pretty good moves. I'm certainly not a good enough Chess player to be able to tell if this has cause either program to play blunders. Pete
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.