PV-Move

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

=Forum Posts=
 * Best move from previous iteration first: still needed with TT? by Marcel Vanthoor, CCC, March 16, 2021 » Hash Move
 * PV-move ordering necessary if you have TT-move ordering? by Marcel Vanthoor, CCC, July 01, 2021

Up one Level