Opening books can be different more or less compressed formats depending on the tool used to make t

From the 80s, with the advent of personal computers Chess games programs became available to the general public and have very rapidly in their game levels, features at a price more affordable or even completely free.
In August 2005, the Fruit 2.1 program developed by the French Fabien Letouzey became vice-champion of the world and shows that it remains one of the strongest unit in the world. In July 2007, the author opens to the public the source code of the program. From that moment, everything is accelerating seen appear in the space of a short time and in turn new modules becoming stronger. It is clear that if we have strong programs to date, Fruit there is probably no stranger ...
The originality of Fruit 2.1 due to the fact that this is a very strong cleaning a dishwasher module with a number of line minimalist and powerful programming: Once compiled, it "weighs" cleaning a dishwasher 180 KB! This means algorithmic advances in research of the best moves in the tree of possibilities variants. Protocol between engine and GUI
We must distinguish between engine and interface: The engine contains all the computer code for calculating the best bang for the module in a given position. These programs have a personality, a configurable game style a name. There are all levels of play. They may be commercials or free. The graphical user interface (gui or chess) is the program that will host and operate these engines. We can have them meet in the context of the organization of tournaments between engines. The GUI is managing the entire visible environment by the user as the board and displays information from the calculation modules (animation of the chessboard with each stroke, alternatives, evaluation of the position, the use of tablebases, depth of search, cleaning a dishwasher etc ...)
The main advantage for the programmer is to focus on the performance of the engine in order to improve the level of play instead of having to manage the visual representation of the board and the dialogue with the user.
For this, the engine must speak the same language with the graphical interface cleaning a dishwasher through cleaning a dishwasher a protocol, that is to say a common standard between the GUI and each engine to exchange data such as the blows of a part Chess.
Currently, three types of protocols dominate chess modules: Protocol UCI (Universal Chess Interface) is the most widespread of all (Arena, Rybka Aquarium, ChessGui Jose Chess etc ..) Winboard Protocol, the first free interface (GnuChess, Crafty) Trade protocols (Fritz, Junior, Shredder, Hiarcs, cleaning a dishwasher etc ... with a motor or .eng extension .exe) Opening Books
This is an open directory chosen by the user which modules will be used to play their first shots. cleaning a dishwasher These shots are instantly played by modules and should lead to a balanced position at the end of the book. In a variable length (5, 10, 15, 20 shots, more), these books can be constructed from a single opening or otherwise integrate multiple openings. These opening libraries can occupy considerable space on disk against executable size of the engine.
Opening books can be different more or less compressed formats depending on the tool used to make tournaments for .abk Arena, free interface, .Ctg Fritz is a commercial chess program. Bin for Winboard
The opening books are recommended to prevent the engine chooses a variant refuted. They are essential to any chess engine, providing more varieties in different openings cleaning a dishwasher and do save a lot of time because the opening is the phase where the tree of moves is the largest because the maximum number cleaning a dishwasher of coins. Final tables
In the final, the remaining number of parts is reduced but the sudden shaft must be deeper to consider such as the promotion of a pawn is still at its starting position.
The final tables directly bypassing an extremely deep shaft. It allows to instantly resolve a final 5 rooms (ie 2 Kings + 3 other rooms) and calculate the distance cleaning a dishwasher to the mat for a given position. Thus, the use of tablebases avoids any simulation in a tree or predict faster lay