Author: blass uri
Date: 08:51:30 12/18/98
Go up one level in this thread
On December 18, 1998 at 04:42:30, Komputer Korner wrote: >On December 17, 1998 at 06:18:39, Tom Kerrigan wrote: > >>I don't do this in my program and I've never heard of anything remotely like it >>until now. With every program that I know anything about, a node is a node is a >>node. >> >>-Tom >> >> >>On December 17, 1998 at 03:59:00, Komputer Korner wrote: >> >>>yes, I was assuming that pondering was disabled. The reason that I say that >>>there always will be a bias in non strict brute forcers is that pruning allows a >>>program to skip nodes. The pruning is different depending on the exact time >>>control and not on the 2 relative time controls, so that 1 program will be >>>following certain algorithms that the other program won't be because of the >>>different time control. >>>-- >>>Komputer Korner > > >Sorry, I should not have used the word "nodes". Substitute "variations". >-- >Komputer Korner I do not understand I assumed that the only difference between the fast computer and the slow computer is that the program in the slower computer does the same actions slower and all you have to do is to give the slower computer more time. Do you say that the program does not do the same actions in the slower and the faster computer and if it does not what is the reason?
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.