Author: Dave Gomboc
Date: 00:01:33 07/18/99
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
This page took 0.01 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.