Author: Robert Hyatt
Date: 11:54:14 11/17/97
Go up one level in this thread
On November 17, 1997 at 14:08:33, Chris Whittington wrote: > >On November 17, 1997 at 13:52:58, Manuel Rodriguez Blanco wrote: > >>I know that a 6 or 7 pieces (including both king) ending database take a >>lot of disk space, but suppose for a moment that disk space is not a >>problem, how much time will take to a especial program for generate this >>database in a fast pc? > >Isn't it the case that each database is 64 times bigger than the N-1 >variety ? > >Therefore 64 times longer, I guess. not quite. It is proportional to distance to mate more than it is to the number of pieces. IE KQQ vs KNN is probably going to be pretty quick to compute, measured in days. While KQP vs KQP or some such might be horrible. > >Divide the time by hardware speed advances, HD access time advances and >so on. > > >>and how much time will take to generate this >>database with DeepBlue ? > >1. Deep Blue probably doesn't do this anyway > >2. It's purpose built hardware would probably be no help to it > >3. So, we shall never know :) > >Chris Whittington > >> >> >>Thanks, >> >>MRB.
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.