Author: Robert Hyatt
Date: 03:37:51 08/05/98
Go up one level in this thread
On August 04, 1998 at 20:32:37, blass uri wrote: > >On August 04, 1998 at 19:55:55, Fernando Villegas wrote: > >>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 >The games do not prove it because maybe deeper blue could play better >with null moves. > >The idea of no extensions is not realistic because sometimes you must see >30 plies and even 60 plies forward to go to the right decision >and even a machine 1000 times faster than deeper blue cannot see >30 plies in the brute force depth. > >Uri I did the math a while back, and concluded that if you take DB at 200M nodes per second, and Crafty at 200K, searching to 12 plies in a normal middlegame, that it should reach 12+log2.5(1000) plies on DB hardware. So yes, I'd love to see what a real null-mover could do on such hardware. ANd one last point... don't forget that DB is not a "no extension" program. They do more than any of the rest of us...
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.