![]() So when a chess program has to decide on a move, it will look up (by using binary-search) using the hash value of the current position to collect all information come with that hash value and then make a decision upon it. Items of a book should be sorted by their hash. For example, PolyGlot uses 16 bytes for each item, including hash, move, weight, learning values. To save space those extra information typically about 2-8 bytes. Often each position is stored as a hash value (8 bytes) and some extra information such as the 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. ![]() However, the major number of top books is built and worked with hash values from transpositions. At the most simple form, they are just a conversion of above text-opening books into binary, in the ready form for software and save text-binary converting steps.
0 Comments
Leave a Reply. |