Research Cell: An International Journal of Engineering Sciences

Open Access Open Access  Restricted Access Subscription Access

An Efficient Approach to Solve Sudoku Problem by Harmony Search Algorithm


Affiliations
1 Dept. of I.T, Kalyani Govt. Engg College, Kalyani, Nadia(W.B), India
2 Dept. of CSE, Kalyani Govt. Engg College, Kalyani, Nadia(W.B), India
 

Harmony Search Algorithm originally came from the analogy between the music improvisation and optimization process. The harmony search algorithm is searching the optimal solution using the novel stochastic derivative equation. The equation is based on density information of multiple solution vectors, instead of calculus based gradient information of single solution vector. In other words, if a certain value frequently appears in multiple vectors, then the value has higher chance to be selected rather than the other candidate values. In this paper, an algorithm has been proposed to solve the Sudoku problem based on harmony search. A comparative study has been made with the proposed algorithm with the existing solution of Sudoku problem by harmony search. It has been proved that the proposed algorithm minimized the iterations to solve the Sudoku problem.
User
Notifications
Font Size

Abstract Views: 97

PDF Views: 2




  • An Efficient Approach to Solve Sudoku Problem by Harmony Search Algorithm

Abstract Views: 97  |  PDF Views: 2

Authors

Satyendra Nath Mandal
Dept. of I.T, Kalyani Govt. Engg College, Kalyani, Nadia(W.B), India
Soumi Sadhu
Dept. of CSE, Kalyani Govt. Engg College, Kalyani, Nadia(W.B), India

Abstract


Harmony Search Algorithm originally came from the analogy between the music improvisation and optimization process. The harmony search algorithm is searching the optimal solution using the novel stochastic derivative equation. The equation is based on density information of multiple solution vectors, instead of calculus based gradient information of single solution vector. In other words, if a certain value frequently appears in multiple vectors, then the value has higher chance to be selected rather than the other candidate values. In this paper, an algorithm has been proposed to solve the Sudoku problem based on harmony search. A comparative study has been made with the proposed algorithm with the existing solution of Sudoku problem by harmony search. It has been proved that the proposed algorithm minimized the iterations to solve the Sudoku problem.