{'fraction_non_alphanumeric': 0.023231256599788808, 'fraction_numerical': 0.004223864836325237, 'mean_word_length': 5.076923076923077, '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}}
Solving the puzzle problem using Hopfield neural network in conjunction tree search algorithm

In this paper, a new approach based on artificial neural networks for solving the puzzle problem in conjunction with the tree search algorithm, is presented. For this purpose, a Hopfield neural network is used in a certain constraint satisfaction problem of the puzzle so that the energy values indicate a good level of constraint satisfaction of the puzzle problem. Also, another criterion known as "tree search algorithm", is used to solved the puzzle problem. At the end, based on the appropriate behaviors of each of the presented algorithms, these two algorithms are combined so that they generate a much more powerful algorithm than each of them individually. Finally, a comparison is made for the actual performance of the proposed algorithm and the Hopfield neural network optimizer formerly presented in [N. Sadati, J. Tahri, Australia, 1999].