Author: Tom Kerrigan
Date: 16:25:55 01/23/00
Go up one level in this thread
On January 23, 2000 at 19:20:14, Jeremiah Penery wrote: >>If you can give me an exact description of DB's eval function, I will pay you >>$100 (possibly more), and I will release a program using that function in less >>than a month. >We don't have an exact description, but we do know a lot of what it does. Why >aren't _any_ of the programs now doing certain things that DB _was_ doing? Like what? Please, just give one example. >>I suspect that CS Tal's evaluation function does more work than DB's. I actually >>have evidence. >So, what is the evidence? Hsu's estimate of 40k instructions per node. >> And so far, nobody's been able to prove me wrong. Also, there's >>no reason why you can't use the DB eval function with a search function that's >>more appropriate for a PC. >Then it wouldn't quite be DB, now would it? No, but my original suggestion was just to implement the DB evaluation function, which is supposed to be spectacular. Over the course of this argument, I have suggested in passing that it would be possible to implement the entire DB algorithm on a PC. I never thought this was a particularly good idea, but I definitely think it's possible. -Tom
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.