Neuro-Symbolic Sudoku Solver
Ashutosh Hathidara, Lalit Pandey

TL;DR
This paper demonstrates that Neural Logic Machines can effectively solve Sudoku puzzles with high accuracy, showcasing their potential for complex problem-solving tasks where traditional neural networks struggle.
Contribution
The study extends NLMs to solve Sudoku, achieving 100% accuracy, and compares their convergence with backtracking algorithms, highlighting the importance of symbolic learning.
Findings
NLMs achieve 100% accuracy on Sudoku puzzles with 3-10 empty cells.
NLMs outperform traditional neural networks in solving complex combinatorial problems.
Comparison shows NLMs have competitive convergence times with backtracking algorithms.
Abstract
Deep Neural Networks have achieved great success in some of the complex tasks that humans can do with ease. These include image recognition/classification, natural language processing, game playing etc. However, modern Neural Networks fail or perform poorly when trained on tasks that can be solved easily using backtracking and traditional algorithms. Therefore, we use the architecture of the Neuro Logic Machine (NLM) and extend its functionality to solve a 9X9 game of Sudoku. To expand the application of NLMs, we generate a random grid of cells from a dataset of solved games and assign up to 10 new empty cells. The goal of the game is then to find a target value ranging from 1 to 9 and fill in the remaining empty cells while maintaining a valid configuration. In our study, we showcase an NLM which is capable of obtaining 100% accuracy for solving a Sudoku with empty cells ranging from 3…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems
Methodsfail
