{'fraction_non_alphanumeric': 0.024390243902439025, 'fraction_numerical': 0.0, 'mean_word_length': 4.8655462184873945, '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}}
Using Conspiracy Numbers for Improving Move Selection in Minimax Game-Tree Search

In a two-person perfect-information game, Conspiracy Number Search (CNS) was invented as a possible search algorithm but did not find much success. However, we believe that the conspiracy number, which is the core of CNS, has not been used to its full potential. In this paper, we propose a novel way to utilize the conspiracy number in the minimax framework. Instead of using conspiracy numbers separately, we combine them together. An example way of combining conspiracy numbers with the evaluation value is suggested. Empirical results obtained for the game of Othello show the potential of the proposed method.