| |||||||||||||||||||||||||
The results in Table 1 are clearly quite similar to the Actual values and this demonstrates that this method of inference is solid and that it finds correct values. The next thing to note is that the inference from the strategy used through hill climbing could be a reason for the better approximations of the actual
values.
The next question is whether the results for the Grandmaster games were similar, and the answer is yes. The two grandmasters selected in Jansen et al.'s paper were Robert J. Fischer and Garry Kasparov [17][18]. As Jansen et al. used the entire database and since inference works better with more information, entire databases for each player were again used. The same particular games could not be found as they were not specified in the Jansen et al. paper but the most complete databases established were used. The results can be seen in Table 2, which shows the number of games in each grandmaster database, the inferred weights, and the past results of Jansen. The past results showed that the inference obtained with the simple model is not as accurate as it could be, but that a simple model can in fact have the capacity to model the play of Grandmasters. The results in duplicating these experiments verify these conclusions. The compression is measured as the percentage of the random game that the inferred game represents.
|