Hash Move

From Chessprogramming wiki
Revision as of 09:00, 11 October 2019 by GerdIsenberg (talk | contribs)
Jump to: navigation, search

Home * Chess * Moves * Hash Move

The Hash Move is a Move Ordering related issue.

The Hash Move is a move probed from the transposition table, either a best move of a stored PV-node - a PV-move, or a good enough refutation move to cause a cutoff. This move should most importantly searched first [1] [2]. One may save the move generation at all, if the hash move actually fails high. To guard against rare TT key collisions, one may apply a legality test of the hash move [3].

See also

Collisions

Forum Posts

References

Up one Level