Understanding the Chess Base analysis window with Fritz as your engine.
|For a more indepth explanation, read the Chess Base Electronic T-Notes article titled "October 11th, 1998 Interpreting Fritz' analysis" on the Chess base site.|
|xx is the brute-force search, in which Fritz looks at every
move, then every possible reply while pruning away what it considers bad moves.
yy is the selective search depth. In this type of search, Fritz evaluates forcing lines such as captures and checks.
|The algebraic notation followed by a number before and after a slash, such as "g2-h3 (4/31)".|
|This is information about the move that Fritz is currently
evaluating. The number after the slash is the number of total possible moves in the
position. In the example there are 31 possible moves. The number before the slash which
move it is considering at the moment.
The most promising lines (those with the best evaluations) are moved to the top of the list, sorting them in order from best to worst from the point of view of the moving side.
|The last entry at the top of the display|
|This is the speed at which Fritz is evaluating. In this
case it reads "60kN/s". The pattern this display always follows is xkN/s:
x = a number
In the example, Fritz is searching at the speed of 60 times 1,000 nodes per second, that is 60,000 positions a second.
|The lower part of the window.|
|The symbols are standard Informant/ECO chess evaluation
The number in parentheses is an exact numerical evaluation of the variation, given in pawn increments down to 1/100th of a pawn.
|Small light in the upper left-hand corner.|
|The light changes to red when the numerical evaluation of
the best line (the one at the top of the list) changes by more than one pawn (1.00).
The moves are the strongest variations with the best possible play for both sides.