alpha bound in hash table

[xr_a_y]

Tests I ran tonight show that storing alpha bound is very bad in terms of elo (-200).
I guess there is a mistake somewhere.
The actual mini source code

Code: Select all

 if ( skipMove==INVALIDMOVE && alphaUpdated) TT::setEntry({bestMove,bestScore,hashBound,depth,computeHash(p)});
 

removing the && alphaUpdated lose 200 elo ...

I am lost !

[RubiChess]

Tests I ran tonight show that storing alpha bound is very bad in terms of elo (-200).

I will test how Rubi works without storing "bestmove not raising alpha" (which of course may not be the real best move) but I fear it won't win 200 ELO

Andreas

[RubiChess]

Tests I ran tonight show that storing alpha bound is very bad in terms of elo (-200).

I will test how Rubi works without storing "bestmove not raising alpha" (which of course may not be the real best move) but I fear it won't win 200 ELO

Andreas

Ran the test. Rubi loses about 10 elo if I don't store the "bestmove" at fail low.

Andreas

[xr_a_y]

Ok thanks for the test. Re-running another myself with Minic...

[xr_a_y]

Ok thanks for the test. Re-running another myself with Minic...

Unfortunatly I can confirm that in Minic, setting a alpha bound hash entry give very bad result, -200 elo in gauntlet with many other variations:

Code: Select all

   0 minic_dev                      95      15    1367   63.3%   37.2%
   ...
  12 minic_test                   -113      54      86   34.3%   47.7%

I'll run a 1versus1 selfplay to be sure...