Image Detection and Digit Recognition to solve Sudoku as a Constraint Satisfaction Problem

05/25/2019
by   Aditya Narayanaswamy, et al.
0

Sudoku is a puzzle well-known to the scientific community with simple rules of completion, which may require a com-plex line of reasoning. This paper addresses the problem of partitioning the Sudoku image into a 1-D array, recognizing digits from the array and representing it as a Constraint Sat-isfaction Problem (CSP). In this paper, we introduce new fea-ture extraction techniques for recognizing digits, which are used with our benchmark classifiers in conjunction with the CSP algorithms to provide performance assessment. Experi-mental results show that application of CSP techniques can decrease the solution's search time by eliminating incon-sistent values from the search space.

READ FULL TEXT
research
06/21/2013

3-SAT Problem A New Memetic-PSO Algorithm

3-SAT problem is of great importance to many technical and scientific ap...
research
01/18/2014

Local Consistency and SAT-Solvers

Local consistency techniques such as k-consistency are a key component o...
research
10/11/2020

Segmenting Epipolar Line

Identifying feature correspondence between two images is a fundamental p...
research
09/27/2019

SAT vs CSP: a commentary

In 2000, I published a relatively comprehensive study of mappings betwee...
research
04/04/2022

Reducing SAT to Max2XOR

Representing some problems with XOR clauses (parity constraints) can all...
research
01/15/2014

A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability

Literature on Constraint Satisfaction exhibits the definition of several...
research
05/31/2021

Multidimensional Included and Excluded Sums

This paper presents algorithms for the included-sums and excluded-sums p...

Please sign up or login with your details

Forgot password? Click here to reset