Author: Brian Richardson
Date: 12:16:01 12/12/01
Go up one level in this thread
On December 12, 2001 at 14:25:34, Uri Blass wrote: >On December 12, 2001 at 13:43:17, Christophe Theron wrote: > >>On December 12, 2001 at 03:17:30, Uri Blass wrote: >> >>>My guess is that a piece square table program with good search rules can get >>>2200-2300 ssdf rating on A1200 >> >> >> >>Much more than that. At least 2400 SSDF elo. >> >> >> >> Christophe > >It may be interesting if you can release also an engine with only piece square >table evaluation. > >I am not talking about relative simple evaluation like the idea to check gerbil. >Gerbil is not optimized for speed and it has not optimal search rules. >Gerbil also does not use only piece square table evaluation. Gerbil version 0 or 1 was material and piece squares only, as I recall. The source is still available, if you want to do some tests. It is also a very fast program (in terms of raw NPS). It hit about 2300 on a system about half the speed of an A1200. Not sure there are "optimal search rules". What is good for a limited PCSQ based evaluation may be poor with a richer evaluation funcion. > >I am also talking about tournament time control and I suspect that piece square >table program is going to earn less from time. For sure. > >I believe that the 2400 can be correct for blitz. > >I know that your opinion is that only the branching factor is important here >and it may be interesting if you release an engine with only piece square table >evaluation so people can test it. > >Uri
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.