{'fraction_non_alphanumeric': 0.01436265709156194, 'fraction_numerical': 0.0, 'mean_word_length': 5.488372093023256, '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}}
An implementation for algorithmic game solving and its applications in system synthesis

We present our efforts in bringing algorithmic game solving from theoretical results towards concrete applications. We first create the tool GAVS+ which collects most types of games having practical interests with various winning conditions. GAVS+ is the first library which summarizes existing efforts in such a comprehensive way. With the library in hand, we bridge games in theory and concrete applications in synthesis; new algorithms are introduced when required.