{'fraction_non_alphanumeric': 0.02593010146561443, 'fraction_numerical': 0.010146561443066516, 'mean_word_length': 4.803921568627451, '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 Chess Composer of Two-Move Mate Problems

Computerized chess composers of mate problems are rare. Moreover, so far they do not produce either impressive or creative new mate problems. In this paper, we describe a model called CHESS COMPOSER. This model uses a 64-bit representation, an ordered version of Iterative-Deepening DepthFirst Search, and a quality function built with the help of two international masters in chess-problem composition. The result is applied on 100 known problems. It shows that the quality of 97 problems has been improved. Some of the improvements are rather impressive considering that most of the tested problems were composed by experienced composers. The new, improved problems can be regarded as creative from the viewpoint of experts in chess compositions, because (1) they seem to be better, and (2) they are not too similar to the original problems.