Dictionary

[[toc]]
**[[Home]] * Dictionary**

=Dictionary= 
This page is intended as a dictionary, glossary or proxy of common chess programming terms. It is intended to facilitate the navigation, especially for the pages that do not have a clearly defined ancestor, and as a cross-reference between the pages containing similar material covered from the different angles. The latter situation might indicate that some kind of merging or re-editing is necessary.

Please enter the words in an alphabetical order.

==A== 
* [[AAAI]] - Association for the Advancement of Artificial Intelligence
* [[ABDADA]] - Alpha-Bêta Distribué avec Droit d'Anesse
* [[ABK]] - [[Arena|Arena's]] [[Opening Book|opening book]] format
* [[ACCA]] - Americas' Computer Chess Association
* [[ACM]] - Association for Computing Machinery
* [[Node Types#ALL|All-Nodes]]
* [[Alpha]]
* [[Alpha-Beta]]
* [[Neural Networks|ANN]] - Artificial Neural Network
* [[Annihilation of Defense]]
* [[Anti-Computerchess]]
* [[Anti-Diagonals]]
* [[Attacks]]
==B== 
* [[Battery]]
* [[Best-First]]
* [[Beta]]
* [[Beta-Cutoff]] = Cutoff
* [[Big-endian]]
* [[Polyglot|BIN]] - [[Polyglot]] [[Opening Book|opening book]] format
* [[Bit]]
* [[Bitboards]]
* [[BitScan]]
* [[Blockade]]
* [[Brute-Force]]
* [[Bound]]
* [[Butterfly Boards]]
* [[Byte]]
==C== 
* [[Candidate Passed Pawn|Candidate]] - Candidate Passed Pawn
* [[Castling]]
* [[Castling rights]]
* [[CCRL]] - Computer Chess Rating Lists
* [[CEGT]] - Chess Engines Grand Tournament
* [[Center]]
* [[Centipawns]]
* [[Check]]
* [[Checkmate]]
* [[Chessboard]]
* [[Chess Engine Communication Protocol]]
* [[CHREST]] - Chunk Hierarchy and REtrieval STructures
* [[CLI]] - Command Line Interface
* [[Conspiracy Numbers|cn]] - Conspiracy Numbers
* [[Color]]
* [[Combination]]
* [[Contempt Factor]]
* [[Chess Query Language|CQL]] - Chess Query Language
* [[CSVN]] - Computerschaak Vereniging Nederland
* [[CTG]] - [[ChessBase]] [[Opening Book|opening book]] format
* [[Node Types#CUT|Cut-Nodes]]
* [[Beta-Cutoff|Cutoff]] = Beta-Cutoff
==D== 
* [[Decoying]]
* [[Deflection]]
* [[Demolition of Pawns]]
* [[Depth]] - Search depth
* [[Depth-First]]
* [[Diagonals]]
* [[Depth#DiminishingReturns|Diminishing Returns]]
* [[Discovered Attack]]
* [[Discovered Check]]
* [[Double]]
* [[Double Attack]]
* [[Double Check]]
* [[Double Word]]
* [[Draw]]
* [[Endgame Tablebases#DTC|DTC]] - Depth to Conversion
* [[Endgame Tablebases#DTM|DTM]] - Depth to Mate
* [[Dynamic Tree Splitting|DTS]] - Dynamic Tree Splitting
* [[Endgame Tablebases#DTM|DTZ]] - Depth to Zeroing
==E== 
* [[Branching Factor#EffectiveBranchingFactor|EBF]] - Effective Branching Factor
* [[ECO|ECO - Encyclopaedia of Chess Openings]]
* [[Endgame Bitbases|EGBB]] - Endgame Bitbases
* [[Endgame Tablebases|EGTB]] - Endgame Tablebases
* [[Endianness]]
* [[En passant]]
* [[En prise]]
* [[EPAM]] - Elementary Perceiver and Memorizer
* [[Extended Position Description|EPD]] - Extended Position Description
* [[Enhanced Transposition Cutoff|ETC]] - Enhanced Transposition Cutoff
* [[Evaluation function]]
* [[Exact Score]]
==F== 
* [[Fail-Hard]]
* [[Fail-High]]
* [[Node Types#CUT|Fail-High Nodes]] = Cut-Nodes
* [[Fail-Low]]
* [[Node Types#ALL|Fail-Low Nodes]] = All-Nodes
* [[Fail-Soft]]
* [[Faker]]
* [[Algebraic Chess Notation#FAN|FAN]] - Figurine Algebraic Notation
* [[Forsyth-Edwards Notation|FEN]] - [[David Forsyth|Forsyth]]-[[Steven Edwards|Edwards]] Notation
* [[Fifty-move Rule|Fifty-move rule]]
* [[Fail-High Reductions|FHR]] - Fail-High Reductions
* [[Fianchetto]]
* [[Files]]
* [[Chess960|FRC]] - Fischer Random Chess, also known as Chess960
* [[Frontier Nodes|Frontier Node]]
* [[Futility pruning]]
==G== 
* [[G 6]] - Gruppo Scacchi e Informatica (gsei)
* [[Graph History Interaction|GHI]] = [[Graph History Interaction]]
* [[GUI]] - Graphical User Interface
==H== 
* [[Half-open file]] = Semi-open file
* [[Hanging Pawns]]
* [[Hanging Piece]]
* [[Hidden Passed Pawn]] = Sneaker
* [[History Heuristic]]
* [[Horizon Effect]]
==I== 
* [[Integrated Bounds and Values|IBV]] - Integrated Bounds and Values
* [[ICCA]] - International Computer Chess Association (until 2002)
* [[ICGA]] - International Computer Games Association
* [[Iterative Deepening|ID]] - Iterative Deepening
* [[IEEE]] - Institute of Electrical and Electronics Engineers
* [[Interception]]
* [[Interference]]
* [[Internal Iterative Deepening|IID]] - Internal Iterative Deepening
* [[IPON]] - Ingo's Ponder On Rating List
==J== 
* [[Jamboree]]
==K== 
* [[KCEC]] - Kirr's Chess Engine Comparison
* [[Killer Heuristic|Killer Move]] - [[Killer Heuristic]]
==L== 
* [[Algebraic Chess Notation#LAN|LAN]] - Long Algebraic Notation
* [[Last Best Reply|LBR]] - Last Best Reply
* [[Leaf Node|Leaf Nodes]]
* [[Little-endian]]
* [[Late Move Reductions|LMR]] - Late Move Reductions
* [[Loose Piece]]
* [[Lower Bound]]
* [[Match Statistics#Likelihood%20of%20superiority|LOS]] - Likelihood of Superiority
> [[LOS Table]]
* [[General Setwise Operations#TheLeastSignificantOneBitLS1B|LS1B]] - Least Significant One Bit
==M== 
* [[MAPP]] - Memory-aided Pattern Perceiver
* [[Checkmate|Mate]] = [[Checkmate]]
* [[Monte-Carlo Tree Search|MCTS]] - Monte-Carlo Tree Search
* [[Millipawns]]
* [[Minimax]]
* [[Moves]]
* [[ProbCut#MPC|MPC]] - Multi–ProbCut
* [[General Setwise Operations#TheMostSignificantOneBitMS1B|MS1B]] - Most Significant One Bit
* [[MTD(f)]] - Memory-enhanced Test Driver
* [[MVV-LVA]] - Most Valuable Victim - Least Valuable Aggressor
==N== 
* [[Negamax]]
* [[NegaScout]]
* [[Nibble]]
* [[NIC-Key]] - New In Chess opening classification
* [[Null Move Pruning|NMH]] - Null Move Heuristic
* [[Neural MoveMap Heuristic|NMMH]] - Neural MoveMap Heuristic
* [[Null Move Observation|NMO]] - Null Move Observation
* [[Neural Networks|NN]] - Neural Network
* [[Node]]
* [[Node Types]]
* [[Nodes per second|NPS]] - Nodes per second
* [[Null Window]]
* [[NUMA]] - Non-Uniform Memory Access
==O== 
* [[Open File]]
* [[Opening Book]]
* [[Opposition]]
* [[Oracle]]
* [[Overloading]]
==P== 
* [[Pawns Breakthrough]]
* [[Passed Pawn]]
* [[Proof-Number Search#PDS|PDS]] - Proof-number and Disproof-number Search
* [[Perft]] - Performance Test
* [[Pondering|Permanent Brain]] = [[Pondering]]
* [[Pieces]]
* [[Piece-Square Tables]]
* [[Pin]]
* [[Portable Game Notation|PGN]] - Portable Game Notation
* [[Ply]]
* [[Proof-Number Search|PNS]] - Proof-Number Search (PnS, Pn-Search)
* [[Pondering]]
* [[Pre Frontier Node]]
* [[Piece-Square Tables#Preprocessing|Pre-processing]] [[Piece-Square Tables]]
* [[Oracle|Pre Scan Heuristics]] - Oracle
* [[Pruning]]
* [[Oracle|PSH]] = Pre Scan Heuristics, [[Oracle]]
* [[Pursuit]] (perpetual attack)
* [[Principal variation|PV]] - Principal variation
* [[Node Types#PV|PV-Nodes]]
* [[Principal Variation Search|PVS]] - Principal Variation **Search**
* [[Parallel Search#PrincipalVariationSplitting|PVS]] - Principal Variation **Splitting**
==Q== 
* [[Quad Word]]
* [[Quiescence search|QS]] - Quiescence Search
==R== 
* [[Depth Reduction R|R]] - Depth Reduction R
* [[Ranks]]
* [[Razoring]]
* [[Reductions]]
* [[Root]]
==S== 
* [[Sacrifice]]
* [[Algebraic Chess Notation#SAN|SAN]] - Standard Algebraic Notation
* [[Scout]] - Scout-Algorithm
* [[Singular Extensions|SE]] - Singular Extensions
* [[Static Exchange Evaluation|SEE]] - Static Exchange Evaluation
* [[Half-open file|Semi-open file]] = Half-open file
* [[Sentry]]
* [[Shannon Trophy]]
* [[Sibling node]]
* [[Side to move]]
* [[SIMD and SWAR Techniques|SIMD]] - Single Instruction Multiple Data
* [[Skewer]]
* [[SMP]] - Symmetric multiprocessing
* [[Hidden Passed Pawn|Sneaker]] = Hidden Passed Pawn
* [[SOMA#SOMAALGO]] - Swapping Off Material Analyzer
* [[SOMA]] - [[John Maynard Smith|Smith]] One-Move Analyzer
* [[Space Clearance]]
* [[Squares|Square]]
* [[SSDF]] - Svenska schackdatorföreningen
* [[SSE2|SSE]] - Streaming SIMD Extensions
* [[State Space Search|SSS]] = State Space Search like [[SSS* and Dual*]]
* [[Stalemate]]
* [[Strategy]]
* [[Stop square]]
* [[SIMD and SWAR Techniques|SWAR]] - SIMD Within A Register
==T== 
* [[Tactics]]
* [[Temporal Difference Learning|TD]] - Temporal Difference [[Learning]]
* [[Triangulation]]
* [[Transposition Table|TT]] - Transposition Table
==U== 
* [[UCI]] - Universal Chess Interface
* [[Undermining]]
* [[Upper Bound]]
==V== 
==W== 
* [[World Computer Chess Championship|WCCC]] - World Computer Chess Championship
* [[World Chess Software Championship|WCSC]] - World Chess Software Championship
* [[WinBoard]]
* [[Window]]
* [[World Microcomputer Chess Championship|WMCCC]] - World Microcomputer Chess Championship
* [[Word]] - Computer Word
==X== 
* [[x86]]
* [[x86-64]]
* [[XBoard]]
* [[X-ray]]
==Y== 
* [[Young Brothers Wait Concept|YBWC]] - Young Brothers Wait Concept
==Z== 
* [[Zobrist Hashing]]
* [[Zugzwang]]
* [[Zwischenzug]]

=External Links= 
* [[http://www.itl.nist.gov/div897/sqg/dads/|Dictionary of Algorithms and Data Structures]] from [[http://www.nist.gov/index.html|National Institute of Standards and Technology]]
* [[http://en.wikipedia.org/wiki/Chess_terminology|Glossary of Chess from Wikipedia]]
* [[http://www.rossashby.info/journal/index/index.html|The W. Ross Ashby Digital Archive - Index]] from [[http://en.wikipedia.org/wiki/William_Ross_Ashby|William Ross Ashby's]] [[http://www.rossashby.info/index.html|Digital Archive]]

**[[Home|Up one Level]]**