Author: Fernando Villegas
Date: 16:55:55 08/04/98
Go up one level in this thread
Hi both: Sorry if a miserable non programmer intervenes, but usefulnes of full width search does not depend on how much nodes your machine can calculate? I presume that with an ideal, infinitely fast machine, the best you can do is to calculate absolutely all, no null move, no extensions, no prunning. In less than ideally fast machines equation alters very much, but Deep Blue, although not infinetly fast, is enough fast for being near the area of validity of that reasonning. Maybe if you surpass certain threshold in speed, the old technique recover some sense. In fact, DB games against K are a prooof of it. Excuse me :-) Fernando
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.