Difference between revisions of "PV-Move"
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...") |
GerdIsenberg (talk | contribs) |
||
| Line 12: | Line 12: | ||
* [[PV Extensions]] | * [[PV Extensions]] | ||
* [[Threat Move]] from [[Null Move Pruning|null move]] refutations | * [[Threat Move]] from [[Null Move Pruning|null move]] refutations | ||
| + | |||
| + | =Forum Posts= | ||
| + | * [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 » [[Hash Move]] | ||
'''[[Moves|Up one Level]]''' | '''[[Moves|Up one Level]]''' | ||
Revision as of 13:04, 20 March 2021
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
