Development and analysis of genetic algorithms: Sudoku case study
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 constra...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IEEE
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/18781 |
| _version_ | 1848749844048379904 |
|---|---|
| author | Milton, A. Ortega-Sanchez, Cesar |
| author2 | P. Naval |
| author_facet | P. Naval Milton, A. Ortega-Sanchez, Cesar |
| author_sort | Milton, A. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T07:27:23Z |
| format | Conference Paper |
| id | curtin-20.500.11937-18781 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T07:27:23Z |
| publishDate | 2012 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-187812017-09-13T13:46:03Z Development and analysis of genetic algorithms: Sudoku case study Milton, A. Ortega-Sanchez, Cesar P. Naval computational intelligence sudoku solver genetic algorithms 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. 2012 Conference Paper http://hdl.handle.net/20.500.11937/18781 10.1109/TENCON.2012.6412205 IEEE fulltext |
| spellingShingle | computational intelligence sudoku solver genetic algorithms Milton, A. Ortega-Sanchez, Cesar Development and analysis of genetic algorithms: Sudoku case study |
| title | Development and analysis of genetic algorithms: Sudoku case study |
| title_full | Development and analysis of genetic algorithms: Sudoku case study |
| title_fullStr | Development and analysis of genetic algorithms: Sudoku case study |
| title_full_unstemmed | Development and analysis of genetic algorithms: Sudoku case study |
| title_short | Development and analysis of genetic algorithms: Sudoku case study |
| title_sort | development and analysis of genetic algorithms: sudoku case study |
| topic | computational intelligence sudoku solver genetic algorithms |
| url | http://hdl.handle.net/20.500.11937/18781 |