Changes

Binary books have some important advantages, especially for computer chess engines. Opening databases built on all positions are usually more space-efficient and overcome the problem of [[Transposition|transpositions]]. Often these positions are stored as hash values to allow fast access. Some opening database formats store with each position as well as some information about it. (e.g. number of times occurred, number of games won by white/black / drawn with this position, average/maximum Elo of players playing to this opening position, chess program's success with the position). So when a chess program has to decide on a move, it will look up all positions that could arise after moving in the database and then make a decision upon the information given with each position. Depends on designs, an item may take 10 - 16 bytes. To build and/or edit those opening books, users need to use special software.

=Generation=