One can collect statistics from playing out the game randomly to the end many times. This paper proposed a method for a selective collection of higher order statistics, that is, evaluations of some combinations of moves. If the game can be divided into a number of subgames, the proposed system seems to be able to find relevant combinations concentrated on a single subgame at a time. The preliminary experiments did not yet show significant improvement over the first-order approach, but a door has been opened for further improvement.
The paper also gave some analysis on the game of Y. The proof of impossiblity of draws was extended to cover the bent board. A quantitative difference between the straight and the bent board with respect to the importance of the centre was shown. Also, play-out analysis was applied to the games of Hex and Y for the first time.