Sudoku Solver Using Minigrid Based Backtracking Algorithm

Authors

  • M. Prabha Assistant Professor-III, Department of Information Technology, Velammal College of Engineering and Technology, Madurai, India
  • S. Radha Student, Department of Information Technology, Velammal College of Engineering and Technology, Madurai, India
  • P. M. Priya Student, Department of Information Technology, Velammal College of Engineering and Technology, Madurai, India
  • B. S. Dhivya Student, Department of Information Technology, Velammal College of Engineering and Technology, Madurai, India

Keywords:

Sudoku puzzle, Minigrid, Backtracking algorithm

Abstract

Sudoku is a famous Japanese puzzle game. It helps to enhances our logical thinking. Most of the people have a habit of solving sudoku puzzle in a daily routine. It consists of number ranging from 1 to 9. This has to be done in such a way that each number appears only once per row, once per column and once per zone. Solving sudoku puzzles are helpful in the fields such as steganography, secret image sharing with necessary reversibility, encrypting messages and image authentication. In this application, we used minigrid based backtracking algorithm for solving sudoku puzzles which is less time consuming.

Downloads

Download data is not yet available.

Downloads

Published

18-06-2022

Issue

Section

Articles

How to Cite

[1]
M. Prabha, S. Radha, P. M. Priya, and B. S. Dhivya, “Sudoku Solver Using Minigrid Based Backtracking Algorithm”, IJRESM, vol. 5, no. 6, pp. 138–140, Jun. 2022, Accessed: Apr. 26, 2024. [Online]. Available: https://journal.ijresm.com/index.php/ijresm/article/view/2180