Author: Dan Andersson
Date: 12:22:52 10/29/03
Go up one level in this thread
It would be interesting to know the limit where it becomes a real bother. And what other factors might kill the search. If one corrupts the information stored in certain ways like depth and result, what happens? And if one had a more random approach like a P chance for a wrong match would this less deterministic condition disturb the search more? MvH Dan Andersson
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.