G
Guest
Guest
Archived from groups: rec.games.chess.computer (More info?)
The transposition table normally stores (in addition to other things) a
'best move found' and an indentifier indicating whether the entry is an
upper bound, lower bound, or an exact score.
When I am ordering moves, I use the move found in the TT first. It
seems, though, that in the case of upper bounds, the move stored isn't
very good and actually slows down the search by trying it first. Does
anyone know: is the 'best move found' on upper bounds not useful? Or
does this indicate that I have some other bug?
Thanks!
-Greg
The transposition table normally stores (in addition to other things) a
'best move found' and an indentifier indicating whether the entry is an
upper bound, lower bound, or an exact score.
When I am ordering moves, I use the move found in the TT first. It
seems, though, that in the case of upper bounds, the move stored isn't
very good and actually slows down the search by trying it first. Does
anyone know: is the 'best move found' on upper bounds not useful? Or
does this indicate that I have some other bug?
Thanks!
-Greg