From Chessprogramming wiki
Jump to: navigation, search

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

Up one Level