Abstract
In this article, we present a new algorithm for the well-known and computationally challenging Sudoku puzzle game. Our ant-colony-optimization-based method significantly outperforms the state-of-the-art algorithm on the hardest, large instances of Sudoku . We provide evidence that—compared to traditional backtracking methods—our algorithm offers a much more efficient search of the solution space, and demonstrate the utility of a novel antistagnation operator. This work lays the foundation for future work on a general-purpose puzzle solver, and establishes Japanese pencil puzzles as a suitable platform for benchmarking a wide range of algorithms.
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.
