{'fraction_non_alphanumeric': 0.030685920577617327, 'fraction_numerical': 0.0036101083032490976, 'mean_word_length': 4.606060606060606, '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}}
“Lights Out” and Variants

Abstract In this article, we investigate the puzzle “Lights Out” as well as some variants of it (in particular, varying board size and number of colors).We discuss the complete solvability of such games, i.e., we are interested in the cases such that all starting boards can be solved. We will model the problem with basic linear algebra and develop a criterion for the unsolvability depending on the board size modulo 30. Further, we will discuss two ways of handling the solvability that will rely on algebraic number theory.