Skip to main content
Home
Basics
Getting Started
Board Representation
Search
Evaluation
Principle Topics
Chess
Programming
Artificial Intelligence
Knowledge
Learning
Testing
Tuning
User Interface
Protocols
Dictionary
Lists
Arts
Cartoons
CC Forums
Conferences
Dedicated CC
Engines
Games
Hardware
History
Organizations
Papers
People
Periodical
Samples
Software
Timeline
Tournaments and Matches
Videos
Misc
Acknowledgments
On New Pages
Recommended Reading
Snapshot of chessprogramming.wikispaces.com (2018-04-17)
Refutation Move
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
Best Move
Countermove Heuristic
Hash Move
Killer Move
Last Best Reply
PV-Move
Refutation Table
Threat Move
from
null move
refutations
What links here?
Page
Date Edited
Abyss
Aug 5, 2017
Alpha-Beta
Jan 28, 2018
Best Move
May 15, 2017
Beta-Cutoff
Oct 22, 2017
Duck
Dec 12, 2016
Encoding Moves
Mar 28, 2016
Hash Move
Oct 4, 2017
Iterative Deepening
Jun 23, 2017
Killer Move
Feb 16, 2017
Last Best Reply
Jul 6, 2013
Moves
Feb 20, 2018
Null Move
Aug 9, 2017
Refutation Move
May 13, 2013
Refutation Table
Mar 27, 2015
Touch
Dec 12, 2016
Transposition Table
Saturday
Waxman
Aug 18, 2014
Up one Level
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
What links here?
Up one Level