TIPS FOR MORE ADVANCED USERS
Many chess engines will use your computer ' s RAM( Random Access Memory) as temporary storage for positions which it has already evaluated; if that same position comes up by a different move order elsewhere in the search, the engine won ' t have to evaluate it again-- it will“ remember” the previous analysis. These evaluations are stored in something known as a“ hash table”, and many chess engines will let you set the size of the hash tables used in an analysis session. As a quick rule of thumb, setting the hash size for one-half to two-thirds of your computer ' s total RAM should do nicely.
If your chess engine can use the Nalimov endgame tablebases( which are special endgame databases that allow a chess engine to play or analyze simple endgames perfectly), and you have these tablebases available( through download or purchase – several commercial tablebase packages are available), you should consult your chess program ' s documentation to learn how to connect the engine to the tablebases. Not only will the tablebases provide perfect analysis, but they ' ll also often shorten the time required for the engine to analyze a game, since the endgame evaluations are already contained in the tablebases.
Most chess programs also come with an opening book( also known as an opening tree) for its chess engine. Make sure you load the proper opening book for the chess engine you ' re using; this, too, often shortens the time of an analysis session because many engines won ' t bother analyzing moves which are already in the chess tree. Many software vendors also offer larger, more comprehensive opening books as a separate“ add-on” purchase; if you have one of these, use it instead of the book which came with the program.
WHAT YOU CAN EXPECT TO SEE AFTER A GAME ANALYSIS
Here again, the analysis output of different chess engines will vary from program to program, but the basics of what you ' ll see should be about the same between them. You should see variations inserted into the game score at the places in the game where a player could have made a significantly better move than what he played. You ' ll also see numerical evaluations of what was actually played and of the suggested variation( so that you can determine exactly how much better the engine ' s suggested move would have been). In some cases, an engine might even provide a numeric evaluation for every move of the game.
98 chessking. com