Refutation Move

From Chessprogramming wiki
Jump to: navigation, search

Home * Chess * Moves * Refutation Move

The Refutation Move is a Move Ordering related issue.

A Refutation Move in the context of search algorithms like Alpha-Beta or Principal Variation Search is a move which fails high at Cut-nodes. It is not necessarily the best move, but good enough to refute opponents previous move. Since it is the best move found so far, in the context of transposition table, it is often flippant mentioned as best move as well.

See also

Up one Level