{'fraction_non_alphanumeric': 0.021148036253776436, 'fraction_numerical': 0.0, 'mean_word_length': 5.978947368421053, '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}}
Computationally intensive and noisy tasks: co-evolutionary learning and temporal difference learning on Backgammon

The most difficult but realistic learning tasks are both noisy and computationally intensive. This paper investigates how, for a given solution representation, co-evolutionary learning can achieve the highest ability from the least computation time. Using a population of Backgammon strategies, this paper examines ways to make computational costs reasonable. With the same simple architecture Gerald Tasauro used for temporal difference learning to create the Backgammon strategy "Pubeval", co-evolutionary learning here creates a better player.