1st International Conference on Industrial Networks and Intelligent Systems

Research Article

# Work-In-Progress: Solving Sudoku Puzzles Using Hybrid Ant Colony Optimization Algorithm

• ```@INPROCEEDINGS{10.4108/icst.iniscom.2015.258984,
author={Ibrahim Sabuncu},
title={Work-In-Progress: Solving Sudoku Puzzles Using Hybrid Ant Colony Optimization Algorithm},
proceedings={1st International Conference on Industrial Networks and Intelligent Systems},
publisher={ICST},
proceedings_a={INISCOM},
year={2015},
month={4},
keywords={ant colony optimization hybrid algorithm sudoku},
doi={10.4108/icst.iniscom.2015.258984}
}
```
• Ibrahim Sabuncu
Year: 2015
Work-In-Progress: Solving Sudoku Puzzles Using Hybrid Ant Colony Optimization Algorithm
INISCOM
ICST
DOI: 10.4108/icst.iniscom.2015.258984
Ibrahim Sabuncu1,*
• 1: Yalova University
*Contact email: isabuncu@yalova.edu.tr

## Abstract

Sudoku puzzle is a popular logic game since 2005. This puzzle is an NP-Complete problem which means that a very hard problem that is required deep and efficient algorithm to be solved. So it also draws attention of the scientists to develop methods and algorithm in order to solve Sudoku puzzles. In this study I tried to develop a hybrid algorithm which consist both analytical and heuristic steps to solve the Sudoku puzzle. The developed hybrid algorithm includes two analytical steps and one heuristically step. In the first analytical step, basic manual Sudoku solving methods are used to solve the puzzle. If puzzle is not solved completely than improvement analytical step is applied to solve the puzzle. If still puzzle is not solved completely then heuristic step applied to solve the puzzle completely. In the heuristic step ant colony optimization algorithm (ACO) will be applied to the puzzle. Experiments show that this hybrid ACO algorithm can solve the hardest Sudoku puzzles less than one second. As a result, this study shows that ACO is an effective method that can be applied to solve Sudoku puzzles.