Live briefing
Everything about Transposition table
Cache of previously seen positions, and associated evaluations in a game tree
A transposition table is a cache of previously seen positions, and associated evaluations, in a game tree generated by a computer game playing program. If a position reoccurs via a different sequence of moves, the value of the position is retrieved from the table, avoiding re-searching the game tree below that position. Transposition tables are primarily useful in perfect-information games. The usage of transposition tables is essentially memoization applied to the tree search and is a form of dynamic programming. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Transposition tableA 5-minute orientation
- Pick up a classic book: Abstract algebraThe most-reprinted book on the subject
- Read the landmark paper: Definitions of Cytomegalovirus Infection and Disease in Transplant Patients for Use in Clinical Trials: Table 1.Cited 900 times
- Go sideways: Glossary of computer chess termsA closely related topic
- Go sideways: Board representation (computer chess)A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Definitions of Cytomegalovirus Infection and Disease in Transplant Patients for Use in Clinical Trials: Table 1.
A performance analysis of transposition-table-driven work scheduling in distributed search
SOLVING KRIEGSPIEL-LIKE PROBLEMS: EXPLOITING A TRANSPOSITION TABLE
A LOCKLESS TRANSPOSITION-TABLE IMPLEMENTATION FOR PARALLEL SEARCH
A Chess Program that Uses its Transposition Table to Learn from Experience
Transposition of Values in Table
Transposition of Table Heads, Stubs, and Positive Predictive Value
Pengaruh Global Transposition Table dan Algoritma Pvs dan Negascout Pada Puzzle Games
📚 Books worth reading
Abstract algebraDavid S. Dummit · 1991
Intelligent Technologies and Engineering SystemsJengnan Juang · 2013- 📕Treatise on the imposition of formsGeorge H. Bidwell · 1865
Kasparov versus Deep BlueMonty Newborn · 1997
Evaluating Versions of the New TestamentEverett W. Fowler · 1981
Twelve-tone tonalityGeorge Perle · 1977- 📕HermesArlene Allan · 2018
- 📕Traité de chimie organiqueVictor Grignard · 1933
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Glossary of computer chess terms The glossary of computer chess terms explains commonly used terms in computer chess, in alphabetical order. For terms used in chess in general, see Glossary…
- Board representation (computer chess) Board representation in computer chess is a data structure in a chess program representing the position on the chessboard and associated game state. Board…
- Alpha–beta pruning Alpha–beta pruning is a tree search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree…
- Zobrist hashing Zobrist hashing (also referred to as Zobrist keys or Zobrist signatures ) is a hash function construction used in computer programs that play abstract…
- Negamax Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game. This algorithm relies on the fact that min(a…
- SSS* SSS* is a search algorithm introduced by George Stockman in 1979. It conducts a state space search traversing a game tree in a best-first fashion similar…
- Move ordering Move ordering refers to the practice of selecting the most promising moves first during game-tree search (especially in computer chess). In minimax searches…
- Tree traversal In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting…