Harmony search algorithm for solving Sudoku

  • Authors:
  • Zong Woo Geem

  • Affiliations:
  • Johns Hopkins University, Environmental Planning and Management Program, Rockville, Maryland

  • Venue:
  • KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

Harmony search (HS) algorithm was applied to solving Sudoku puzzle. The HS is an evolutionary algorithm which mimics musicians' behaviors such as random play, memory-based play, and pitch-adjusted play when they perform improvisation. Sudoku puzzles in this study were formulated as an optimization problem with number-uniqueness penalties. HS could successfully solve the optimization problem after 285 function evaluations, taking 9 seconds. Also, sensitivity analysis of HS parameters was performed to obtain a better idea of algorithm parameter values.