Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How can moveordering efficiency be measured?

Author: Benny Antonsson

Date: 05:32:46 12/31/01

Go up one level in this thread


On December 31, 2001 at 07:43:43, Michel Langeveld wrote:

>On December 31, 2001 at 07:25:09, Benny Antonsson wrote:
>
>>Will this work ?
>>
>>if (value >= beta)
>>{
>>   betaCounter++;
>>
>>   if (isFirstMove == true)
>>   {
>>      firstMoveWasBest++;
>>   }
>>}
>>
>>The efficiency would then be: (firstMoveWasBest / betaCounter) * 100
>>
>>Right ?
>
>Right... but be very sure isFirstMove is only true.

Yes... this is an obvious condition :)

>Because I can't look this up in your code.
>
>By the way: In C/C++ you can also say:
>
>if (isFirstMove)

I'm well aware of the C++ language since I'm a professional programmer. The ==
true is the design rules of our company.. made to invrease readability.

>
>Michel



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.