PV-Move
Revision as of 12:19, 12 May 2018 by GerdIsenberg (talk | contribs) (Created page with "'''Home * Chess * Moves * PV-Move''' A '''PV-Move''' is part of the principal variation and therefor a best move f...")
Home * Chess * Moves * PV-Move
A PV-Move is part of the principal variation and therefor a best move found in the previous iteration of an Iterative deepening framework. It is either a hash move of a stored PV-node inside the transposition table, or - if a triangular PV-Table is applied, a move from that array.
While starting a new iteration, the most important move ordering technique is to try PV-Moves first at leftmost PV-nodes.
See also
- Hash Move
- Killer Move
- Mate Killers
- Move Ordering
- PV Extensions
- Threat Move from null move refutations