Author: Francois Bertin
Date: 06:03:33 09/12/99
Go up one level in this thread
On September 11, 1999 at 18:48:37, Fernando Villegas wrote: >Hi: >I am not programmer, but I have the suspicious that that kind of thing is doable >and possible and meaningful only with old programs with old algorythms. Now >programs are very sophisticated in the way they search and so, time counting is >too much flexible, I mean, they cannot know in advance how much time they will >take as much even in the very end of the tree examination they can discover a >new condition that changes dramatically the score and so they take more time. Effectively. For example, recently I had Rebel 10's "warroom" activated during an autoplay match between Rebel 10c and Rebel 9, where the minimum and maximum time taken for thinking a move were displayed. During a given move, these values could change several times, even at short time controls like 5 sec/move.
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.