Show simple item record

dc.contributor.authorMilton, A.
dc.contributor.authorOrtega-Sanchez, Cesar
dc.contributor.editorP. Naval
dc.identifier.citationMilton, 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.

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.

dc.subjectcomputational intelligence
dc.subjectsudoku solver
dc.subjectgenetic algorithms
dc.titleDevelopment and analysis of genetic algorithms: Sudoku case study
dc.typeConference Paper
dcterms.source.titleIEEE Region 10 Conference Proceedings
dcterms.source.seriesIEEE Region 10 Conference Proceedings
dcterms.source.conferenceIEEE Region 10 Conference
dcterms.source.conference-start-dateNov 19 2012
dcterms.source.conferencelocationCebu, Philippines

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.

curtin.accessStatusOpen access

Files in this item


This item appears in the following Collection(s)

Show simple item record