Abstract
Solving logic puzzles using selected algorithms is an interesting problem in which the efficiency of the methods is essential. One such task is solving nonograms, where board fields should be filled to meet the conditions for rows and columns, respectively. The number of methods possible to use opens the possibility to compare their efficiency and quality of operation.In this paper, we decided to analyze two algorithms belonging to different groups of methods to determine their effectiveness. A modified Depth-First Search (DFS) method and a soft computing method based on permutations generation were chosen and used to solve selected nonograms. The research was conducted on four board sizes, and the results showed that the effectiveness of the used methods mainly depends on the level of nonogram complexity. The algorithm results with permutations were stable, while in contrast to the DFS method, it did not always guarantee a complete solution.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
