Author: Vincent Diepeveen
Date: 06:45:25 07/19/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 multiprocesses in my case. >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? If i force my program to search always to a depth n, then DIEP plays a completely deterministic game, when running at 1 processor. Of course it might take a lot of milliseconds more sometimes to finish a certain depth, as the hardware+OS is obviously non-deterministic. But assumed that it isn't forced to search to a depth n, then as a lot of arrays do not get cleaned (such as hashtables), even mouse movement of the user takes care for non-deterministich behaviour. >Dave
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.