Difference between revisions of "Dictionary"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * Dictionary''' This page is intended as a dictionary, glossary or proxy of common chess programming terms. It is intended to facilitate the navigation,...")
 
 
(21 intermediate revisions by the same user not shown)
Line 26: Line 26:
 
* [[Beta-Cutoff]] = Cutoff
 
* [[Beta-Cutoff]] = Cutoff
 
* [[Big-endian]]
 
* [[Big-endian]]
−
* [[Polyglot|BIN]] - [[Polyglot]] [[Opening Book|opening book]] format
+
* [[PolyGlot|BIN]] - [[PolyGlot]] [[Opening Book|opening book]] format
 
* [[Bit]]
 
* [[Bit]]
 
* [[Bitboards]]
 
* [[Bitboards]]
Line 38: Line 38:
 
* [[Candidate Passed Pawn|Candidate]] - Candidate Passed Pawn
 
* [[Candidate Passed Pawn|Candidate]] - Candidate Passed Pawn
 
* [[Castling]]
 
* [[Castling]]
−
* [[Castling rights]]
+
* [[Castling Rights]]
 
* [[CCRL]] - Computer Chess Rating Lists
 
* [[CCRL]] - Computer Chess Rating Lists
 +
* [[Chess Engine Communication Protocol|CECP]] - Chess Engine Communication Protocol
 
* [[CEGT]] - Chess Engines Grand Tournament
 
* [[CEGT]] - Chess Engines Grand Tournament
 
* [[Center]]
 
* [[Center]]
Line 46: Line 47:
 
* [[Checkmate]]
 
* [[Checkmate]]
 
* [[Chessboard]]
 
* [[Chessboard]]
−
* [[Chess Engine Communication Protocol]]
+
* [[Chess Engine Communication Protocol]] (CECP)
 
* [[CHREST]] - Chunk Hierarchy and REtrieval STructures
 
* [[CHREST]] - Chunk Hierarchy and REtrieval STructures
 
* [[CLI]] - Command Line Interface
 
* [[CLI]] - Command Line Interface
Line 54: Line 55:
 
* [[Contempt Factor]]
 
* [[Contempt Factor]]
 
* [[Chess Query Language|CQL]] - Chess Query Language
 
* [[Chess Query Language|CQL]] - Chess Query Language
 +
* [[CSA]] - Computer Shogi Association
 
* [[CSVN]] - Computerschaak Vereniging Nederland
 
* [[CSVN]] - Computerschaak Vereniging Nederland
 
* [[CTG]] - [[ChessBase]] [[Opening Book|opening book]] format
 
* [[CTG]] - [[ChessBase]] [[Opening Book|opening book]] format
Line 88: Line 90:
 
* [[Extended Position Description|EPD]] - Extended Position Description
 
* [[Extended Position Description|EPD]] - Extended Position Description
 
* [[Enhanced Transposition Cutoff|ETC]] - Enhanced Transposition Cutoff
 
* [[Enhanced Transposition Cutoff|ETC]] - Enhanced Transposition Cutoff
−
* [[Evaluation function]]
+
* [[Evaluation Function]]
 
* [[Exact Score]]
 
* [[Exact Score]]
 
==F==  
 
==F==  
Line 112: Line 114:
 
* [[GUI]] - Graphical User Interface
 
* [[GUI]] - Graphical User Interface
 
==H==  
 
==H==  
−
* [[Half-open file]] = Semi-open file
+
* [[Half-open File]] = Semi-open File
 
* [[Hanging Pawns]]
 
* [[Hanging Pawns]]
 
* [[Hanging Piece]]
 
* [[Hanging Piece]]
 +
* [[Evaluation|HCE]] - Hand-Crafted Evaluation
 
* [[Hidden Passed Pawn]] = Sneaker
 
* [[Hidden Passed Pawn]] = Sneaker
 
* [[History Heuristic]]
 
* [[History Heuristic]]
Line 138: Line 141:
 
* [[Leaf Node|Leaf Nodes]]
 
* [[Leaf Node|Leaf Nodes]]
 
* [[Little-endian]]
 
* [[Little-endian]]
 +
* [[Futility Pruning#MoveCountBasedPruning|LMP]] - Late Move Pruning, Move Count Based Pruning
 
* [[Late Move Reductions|LMR]] - Late Move Reductions
 
* [[Late Move Reductions|LMR]] - Late Move Reductions
 
* [[Loose Piece]]
 
* [[Loose Piece]]
 
* [[Lower Bound]]
 
* [[Lower Bound]]
 
* [[Match Statistics#Likelihood%20of%20superiority|LOS]] - Likelihood of Superiority
 
* [[Match Statistics#Likelihood%20of%20superiority|LOS]] - Likelihood of Superiority
−
> [[LOS Table]]
+
: [[LOS Table]]
 
* [[General Setwise Operations#TheLeastSignificantOneBitLS1B|LS1B]] - Least Significant One Bit
 
* [[General Setwise Operations#TheLeastSignificantOneBitLS1B|LS1B]] - Least Significant One Bit
 
==M==  
 
==M==  
Line 164: Line 168:
 
* [[Null Move Observation|NMO]] - Null Move Observation
 
* [[Null Move Observation|NMO]] - Null Move Observation
 
* [[Neural Networks|NN]] - Neural Network
 
* [[Neural Networks|NN]] - Neural Network
 +
* [[NNUE]] - Efficiently Updatable Neural Networks
 
* [[Node]]
 
* [[Node]]
 
* [[Node Types]]
 
* [[Node Types]]
−
* [[Nodes per second|NPS]] - Nodes per second
+
* [[Nodes per Second|NPS]] - Nodes per Second
 
* [[Null Window]]
 
* [[Null Window]]
 
* [[NUMA]] - Non-Uniform Memory Access
 
* [[NUMA]] - Non-Uniform Memory Access
Line 178: Line 183:
 
* [[Pawns Breakthrough]]
 
* [[Pawns Breakthrough]]
 
* [[Passed Pawn]]
 
* [[Passed Pawn]]
−
* [[Proof-Number Search#PDS|PDS]] - Proof-number and Disproof-number Search
+
* [[Proof-Number Search#PDS|PDS]] - Proof-Number and Disproof-Number Search
 
* [[Perft]] - Performance Test
 
* [[Perft]] - Performance Test
 
* [[Pondering|Permanent Brain]] = [[Pondering]]
 
* [[Pondering|Permanent Brain]] = [[Pondering]]
Line 193: Line 198:
 
* [[Pruning]]
 
* [[Pruning]]
 
* [[Oracle|PSH]] = Pre Scan Heuristics, [[Oracle]]
 
* [[Oracle|PSH]] = Pre Scan Heuristics, [[Oracle]]
 +
* [[Christopher D. Rosin#PUCT|PUCT]] - Predictor + [[UCT]]
 
* [[Pursuit]] (perpetual attack)
 
* [[Pursuit]] (perpetual attack)
−
* [[Principal variation|PV]] - Principal variation
+
* [[Principal Variation|PV]] - Principal Variation
 
* [[Node Types#PV|PV-Nodes]]
 
* [[Node Types#PV|PV-Nodes]]
 
* [[Principal Variation Search|PVS]] - Principal Variation '''Search'''
 
* [[Principal Variation Search|PVS]] - Principal Variation '''Search'''
Line 200: Line 206:
 
==Q==  
 
==Q==  
 
* [[Quad Word]]
 
* [[Quad Word]]
−
* [[Quiescence search|QS]] - Quiescence Search
+
* [[Quiescence Search|QS]] - Quiescence Search
 
==R==  
 
==R==  
 
* [[Depth Reduction R|R]] - Depth Reduction R
 
* [[Depth Reduction R|R]] - Depth Reduction R
 
* [[Ranks]]
 
* [[Ranks]]
 +
* [[UCT#RAVE|RAVE]] - Rapid Action Value Estimation ([[UCT]])
 
* [[Razoring]]
 
* [[Razoring]]
 
* [[Reductions]]
 
* [[Reductions]]
Line 213: Line 220:
 
* [[Singular Extensions|SE]] - Singular Extensions
 
* [[Singular Extensions|SE]] - Singular Extensions
 
* [[Static Exchange Evaluation|SEE]] - Static Exchange Evaluation
 
* [[Static Exchange Evaluation|SEE]] - Static Exchange Evaluation
−
* [[Half-open file|Semi-open file]] = Half-open file
+
* [[Half-open File|Semi-open file]] = Half-open File
 
* [[Sentry]]
 
* [[Sentry]]
 
* [[Shannon Trophy]]
 
* [[Shannon Trophy]]
−
* [[Sibling node]]
+
* [[Sibling Node]]
 
* [[Side to move]]
 
* [[Side to move]]
 
* [[SIMD and SWAR Techniques|SIMD]] - Single Instruction Multiple Data
 
* [[SIMD and SWAR Techniques|SIMD]] - Single Instruction Multiple Data
Line 222: Line 229:
 
* [[SMP]] - Symmetric multiprocessing
 
* [[SMP]] - Symmetric multiprocessing
 
* [[Hidden Passed Pawn|Sneaker]] = Hidden Passed Pawn
 
* [[Hidden Passed Pawn|Sneaker]] = Hidden Passed Pawn
−
* [[SOMA#SOMAALGO]] - Swapping Off Material Analyzer
+
* [[SOMA#SOMAALGO|SOMA]] - Swapping Off Material Analyzer
 
* [[SOMA]] - [[John Maynard Smith|Smith]] One-Move Analyzer
 
* [[SOMA]] - [[John Maynard Smith|Smith]] One-Move Analyzer
 
* [[Space Clearance]]
 
* [[Space Clearance]]
Line 231: Line 238:
 
* [[Stalemate]]
 
* [[Stalemate]]
 
* [[Strategy]]
 
* [[Strategy]]
−
* [[Stop square]]
+
* [[Stop Square]]
 
* [[SIMD and SWAR Techniques|SWAR]] - SIMD Within A Register
 
* [[SIMD and SWAR Techniques|SWAR]] - SIMD Within A Register
 
==T==  
 
==T==  
Line 239: Line 246:
 
* [[Transposition Table|TT]] - Transposition Table
 
* [[Transposition Table|TT]] - Transposition Table
 
==U==  
 
==U==  
 +
* [[UCT]] - '''U'''pper '''C'''onfidence bounds applied to '''T'''rees
 
* [[UCI]] - Universal Chess Interface
 
* [[UCI]] - Universal Chess Interface
 
* [[Undermining]]
 
* [[Undermining]]
 
* [[Upper Bound]]
 
* [[Upper Bound]]
 +
* [[USI]] - Universal Shogi Interface
 
==V==  
 
==V==  
 
==W==  
 
==W==  
Line 263: Line 272:
  
 
=External Links=  
 
=External Links=  
−
* [https://xlinux.nist.gov/dads/ Dictionary of Algorithms and Data Structures] from [https://en.wikipedia.org/wiki/National_Institute_of_Standards_and_Technology National Institute of Standards and Technology]
+
* [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]
 
* [https://en.wikipedia.org/wiki/Chess_terminology Glossary of Chess from Wikipedia]
 
* [https://en.wikipedia.org/wiki/Chess_terminology Glossary of Chess from Wikipedia]
−
* [https://en.wikipedia.org/wiki/William_Ross_Ashby William Ross Ashby's] [http://ashby.de/rossashby.info/index.html Digital Archive]  
+
* [http://www.rossashby.info/journal/index/index.html The W. Ross Ashby Digital Archive - Index] from [https://en.wikipedia.org/wiki/William_Ross_Ashby William Ross Ashby's] [http://www.rossashby.info/index.html Digital Archive]
  
 
'''[[Main Page|Up one Level]]'''
 
'''[[Main Page|Up one Level]]'''

Latest revision as of 22:14, 18 November 2020

Home * 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.

Dictionary

Please enter the words in an alphabetical order.

A

B

C

D

E

F

G

H

I

  • IBV - Integrated Bounds and Values
  • ICCA - International Computer Chess Association (until 2002)
  • ICGA - International Computer Games Association
  • ID - Iterative Deepening
  • IEEE - Institute of Electrical and Electronics Engineers
  • Interception
  • Interference
  • IID - Internal Iterative Deepening
  • IPON - Ingo's Ponder On Rating List

J

K

L

LOS Table
  • LS1B - Least Significant One Bit

M

N

O

P

Q

R

S

T

U

V

W

  • WCCC - World Computer Chess Championship
  • WCSC - World Chess Software Championship
  • WinBoard
  • Window
  • WMCCC - World Microcomputer Chess Championship
  • Word - Computer Word

X

Y

  • YBWC - Young Brothers Wait Concept

Z

External Links

Up one Level

Retrieved from "https://www.chessprogramming.org/index.php?title=Dictionary&oldid=22535"