Appendix 4. Output files

The files that show the tree structure of the game are made by using tabs to show the ply depth. After the specified amount of tabs, the move made is recorded and then after that the values of the evaluation function are recorded. The moves without a tab in front are the ones that were actually used and the corresponding evaluation is the next row beneath it. Note the example here is not from an actual game.

f2-f3


f2-f3 0 -1 1 0 

e7-e5 

e7-e5 0 11 0 0 

f3-f4 

f3-f4 0 -10 0 0 

Nb1-a3


a7-a6 0 10 0 0.1 

b7-b5


Ra1-b1 0 -13 0 0


Na3-b1 CHECKMATE


Na3xb5 1 -6 0 0.2


Na3-c4


a7-a6 CHECKMATE

The lists that are used in the inference programs place this information into a struct that holds the evaluation of each attribute, the move, the ply and the value of the checkmate if there is one.