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

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

Couverture souple

ISBN 10 : 6130354355 ISBN 13 : 9786130354350

Editeur : Betascript Publishing, 2010

Afficher les exemplaires de cette �dition comportant l?ISBN

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.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.