Development and analysis of genetic algorithms: Sudoku case study

Milton, A.; Ortega-Sanchez, Cesar

doi:10.1109/TENCON.2012.6412205

190309_190309.pdf (245.1Kb)

Access Status

Open access

Authors

Milton, A.

Ortega-Sanchez, Cesar

Date

2012

Collection

Curtin Research Publications

Type

Conference Paper

Metadata

Show full item record

Abstract

This paper discusses the design and subsequent analysis of software implementing a configurable genetic algorithm. The genetic algorithm is primarily targeted towards the solving of Sudoku puzzles. Sudoku is regarded as an ideal test-bed for algorithm development due to the fact that it is a constrained optimisation problem that belongs to the NP-complete class of computational problems. The aim of this paper is to outline the various features currently implemented in the software, and to present preliminary results of an analysis of various aspects of the underlying genetic algorithm.

Citation

Milton, Anthony and Ortega-Sanchez, Cesar. 2012. Development and analysis of genetic algorithms: Sudoku case study in Proceedings of the TENICON 2012 – 2012 IEEE Region 10 Conference: Sustainable Development through Humanitarian Technology, Nov 19-22 2012, pp. 1-6. Cebu, Philippines: IEEE.

Source Title

IEEE Region 10 Conference Proceedings

URI

http://hdl.handle.net/20.500.11937/18781

DOI

10.1109/TENCON.2012.6412205

Remarks

Copyright © 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.