Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: High NPS vs. Low NPS

Author: Michael Borgstaedt (GOLIATH CHESS)

Date: 07:45:44 11/26/01

Go up one level in this thread


On November 26, 2001 at 10:19:17, Steve Maughan wrote:

>Michael,
>
>>Less than 5% of the evaluation in Goliath (Light 1.5) is done by "piece-table
>>evaluation". Besides, nearly no prescanning is done. The latest version (which
>>won the blitz tournament during the WM/Maastricht) comes without any type of
>>prescanning or piece-table evaluation. Little/Light Goliath uses much (!) more
>>chess knowledge than many users would expect. But Goliath is still extremely
>>fast and the only "secret" is the way, how I realized the cooperation between
>>search and knowledge. This has nothing to do with "lazy evaluation". Goliath
>>uses a special "oracle" which decides, how much and what type of knowledge will
>>be used for the reached leaf position. And, of course, the essential parts of
>>the program (search, make/unmake move and so on) are highly optimized for
>>speed.
>
>I stand corrected!!
>
>Impressive speed indeed if you are doing mostly leaf node evaluation.  A couple
>of questions: are you defining nodes as all legal move calls to AlphaBeta and
>QSearch?

Yes, the usual way.

>And, is Goliath written in 'C', assembler or a mixture?

A mixture. Many time critical parts are written in assembler (e.g. make/unmake
move, hashtable management, threat-detection and so on), parts which change
often (e.g. evaluation functions) in pure "C".

Best regards
Michael

>
>Regards,
>
>Steve Maughan



This page took 0.05 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.