Author: Igor V. Korshunov
Date: 20:56:43 11/17/03
Go up one level in this thread
On November 17, 2003 at 07:28:28, martin fierz wrote: >On November 17, 2003 at 05:28:19, macaroni wrote: > >>What programs use this method for evuation? (perhaps varying it at the start of >>each search). At the moment my program uses this, and a bit of king safty done >>in-search. Is it a viable method? or before I re-write my fairly bad SetMaps() >>function, should I change the whole system? >>cheers >>tor > >piece-square-tables have the advantage that you have a really fast evaluation >thanks to incremental eval updating. I don't do PST incrementally. I have no complex evaluation. An experiment: Speed of my engine: - with PST - 749 kNp/s - without PST - 753 kNp/s - only material evaluation - 1083 kNp/s PST is very small part of simple evaluator. Do you still think that incremental updates of PST is able to make your program faster? i'm certain that a good >evaluation will do better than PST. Of course, good evaluation is better than bad. But can you offer something to replace PST?
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.