Transposition Table | Transposition Table, Computer Chess, Game Tree, Perfect Information, Depth-first Search, Algebraic Chess Notation, Chess, Hash Table

Lambert M. Surhone (u. a.)

ISBN 10: 6130354355 / ISBN 13: 9786130354350

Published by OmniScriptum, 2026

About this Item

Transposition Table | Transposition Table, Computer Chess, Game Tree, Perfect Information, Depth-first Search, Algebraic Chess Notation, Chess, Hash Table | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786130354350 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

Seller Inventory # 101343231

Bibliographic Details

• Title: Transposition Table | Transposition Table, Computer Chess, Game Tree, Perfect Information, Depth-first Search, Algebraic Chess Notation, Chess, Hash Table
• Publisher: OmniScriptum
• Publication Date: 2026
• Language: English
• ISBN 10: 6130354355
• ISBN 13: 9786130354350
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 6D millimeters 220 millimeters width by 150 millimeters height by 6 millimeters depth
• Weight: 155 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer chess and other computer games, transposition tables are used to speed up the search of the game tree. Transposition tables are primarily useful in perfect information games, meaning the entire state of the game is known to all players at all times. Game playing programs work by analyzing millions of positions that could arise in the next few moves of the game. Typically, these programs employ strategies resembling depth-first search, which means that they do not keep track of all the positions analyzed so far. In many games, it is possible to reach a given position in more than one way. These are called transpositions. In chess, for example, the sequence of moves 1. d4 Nf6 2. c4 g6 (see algebraic chess notation) has 4 possible transpositions, since either player may swap their move order. In general, after n moves, an upper limit on the possible transpositions is (n!)². Although many of these are illegal move sequences, it is still likely that the program will end up analyzing the same position several times.