Difference between revisions of "Hash Move"

From Chessprogramming wiki
Jump to: navigation, search
Line 23: Line 23:
 
* [http://www.talkchess.com/forum/viewtopic.php?t=64093 tt move vs null move] by [[Erin Dame]], [[CCC]], May 27, 2017 » [[Null Move]], [[Null Move Pruning]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=64093 tt move vs null move] by [[Erin Dame]], [[CCC]], May 27, 2017 » [[Null Move]], [[Null Move Pruning]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=65189 Marginal hash move] by [[Harm Geert Muller]], [[CCC]], September 16, 2017
 
* [http://www.talkchess.com/forum/viewtopic.php?t=65189 Marginal hash move] by [[Harm Geert Muller]], [[CCC]], September 16, 2017
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=76887 Hash move ordering vs. Hash cuts: savings in number of nodes visited] by [[Marcel Vanthoor]], [[CCC]], March 16, 2021
 
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=76888 Best move from previous iteration first: still needed with TT?] by [[Marcel Vanthoor]], [[CCC]], March 16, 2021 » [[PV-Move]]
 
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=76888 Best move from previous iteration first: still needed with TT?] by [[Marcel Vanthoor]], [[CCC]], March 16, 2021 » [[PV-Move]]
  

Revision as of 12:05, 20 March 2021

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