A Variable Neighborhood Search for Solving Sudoku Puzzles

Khorshid Adel Hamza, Aise Zulal Sevkli

2014

Abstract

Sudoku is a well-known puzzle that has achieved international popularity in the latest decade. Recently, there are explosive growths in the application of metaheuristic algorithms for solving Sudoku puzzles. In this paper, an algorithm based on Variable Neighborhood Search (VNS) is proposed to solve the Sudoku problem and the details of the implementation such as problem representation, neighbourhood structures are explained. The proposed algorithm is tested with Sudoku benchmarks which have been used in previous studies. The experimental results indicate that VNS is able to produce competitive results in easy level puzzles and promising results in medium and hard level puzzles.

Paper Citation

in Harvard Style

Hamza K. and Sevkli A. (2014). A Variable Neighborhood Search for Solving Sudoku Puzzles . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014) ISBN 978-989-758-052-9, pages 326-331. DOI: 10.5220/0005154903260331

in Bibtex Style

@conference{ecta14,
author={Khorshid Adel Hamza and Aise Zulal Sevkli},
title={A Variable Neighborhood Search for Solving Sudoku Puzzles},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014)},
year={2014},
pages={326-331},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005154903260331},
isbn={978-989-758-052-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014)
TI - A Variable Neighborhood Search for Solving Sudoku Puzzles
SN - 978-989-758-052-9
AU - Hamza K.
AU - Sevkli A.
PY - 2014
SP - 326
EP - 331
DO - 10.5220/0005154903260331