Author: José de Jesús García Ruvalcaba
Date: 14:19:00 07/18/99
Go up one level in this thread
On July 18, 1999 at 03:01:33, Dave Gomboc wrote: >In the past, people have discussed how difficult it can be to debug a chess >program due to non-deterministic behavior. Clearly, this can arise from a >multi-threaded search. If, however, the search is single-threaded (and >discounting the play from the start of the game until the end of the opening >book), what factors, if any, might allow a program to still not play identically >each time? > >Dave Even the same search, looking at exactly the same nodes, in the same computer, will not always take the same time (of course the difference should be small). It is highly improbable for a specific position, but it is posible that one time the engine decides to begin a deeper search and the other time it decides to move. And when you play thousands of position, I think this will eventually happen. José.
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.