{'fraction_non_alphanumeric': 0.016645326504481434, 'fraction_numerical': 0.0, 'mean_word_length': 4.546099290780142, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Learning to Forecast by Explaining the Consequences of Actions

I explain a method to learn to achieve goals in games. In very complex games, such as the game of Go, a search intensive approach is intractable. A knowledge intensive approach is best suited. I represent knowledge using the combinatorial game theory and first order logic. I give a method to learn to predict the consequences of some moves. Each rule is learned using a single example, by explaining the transformations involved by the move. This learning method has been implemented in Gogol, a Go playing system. It learns to evaluate games representing the achievement of some interesting goals of the game of Go. This method is presently applied to other games and to decision making in the management of a firm.