{'fraction_non_alphanumeric': 0.016265912305516265, 'fraction_numerical': 0.0, 'mean_word_length': 5.490825688073395, '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}}
Multiple strategy generation for wargaming

In this paper we present a framework for the automated generation of strategies that accounts for the multiple kinds of uncertainty found in war games, provides for a domain independent approach to strategy generation, and results in robust strategies. Our approach is to sample over multiple trials for varying victory conditions, different threat profiles, and variable system performance to achieve a degree of independence in the resulting strategy. This allows a search for robust strategies versus those that are effective only under specific conditions. War games have uncertainty in what is needed to achieve victory, in system performance, and in threat behavior. There are multiple options for forces, employment, and warfare styles. All these factors combine to produce a large, complex space of possible solutions or strategies. Through the use of powerful search techniques like evolutionary computation and modern computing assets it has become practical to search this space for strategies with robust performance. Our framework is modular in nature, allowing a variety of search techniques, warfare scenarios, system models, and other parameters to be interchanged. In the paper the framework described above is demonstrated using an antisubmarine warfare scenario. Evolutionary programming techniques are used to search the space of possible strategies.