{'fraction_non_alphanumeric': 0.020752269779507133, 'fraction_numerical': 0.0012970168612191958, 'mean_word_length': 4.893129770992366, '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}}
A nondominated adversarial search algorithm for a three-player chess game

Three-player (3P) chess is a variation of chess game specially designed for three players. The winning condition that the first player will wins if the player captures any of the other's King, arises the playing strategies that a player can form a temporarily alliance with another player or a player can take advantage from the other's attacking to defeat either two of the opponents. This paper proposes a search algorithm called the nondominated adversarial search (NAS) for the three-player chess game which does not only maximize the own score but also minimize the opponents' scores. The experiment shows that the NAS algorithm can take advantage from the other's attacking to win the game.