Author: Vincent Vega
Date: 22:38:02 02/11/00
Go up one level in this thread
On February 11, 2000 at 20:32:31, Albert Silver wrote: >It's still very complicated even where computers are concerned. I am presuming >this is a project of your own as you did not mention any names of third parties >doing the analysis, in which case I'd like to ask how these conclusions will be >reached. No, I read it right here, maybe about a month ago. Sorry, I don't remember who's doing it, maybe somebody else does. I hope the results will be posted here or published. >Add an 11th ply to a program that knows nothing and >it's importance will be far greater to it than to a program that has a very > large evaluation function. Are you sure? I'm not. In fact I've seen arguments that CSTAL gains more with increased time than fast searchers. Yes, there are a lot of complications and I could be wrong. But I think this experiment could start answering some questions (and posing new ones).
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.