Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12358/25136
Title | β-hill climbing algorithm for Sudoku game |
---|---|
Untitled | |
Abstract |
In this paper, β-Hill Climbing algorithm, the recent local search-based meta-heuristic, are tailored for Sudoku puzzle. β-Hill Climbing algorithm is a new extended version of hill climbing algorithm which has the capability to escape the local optima using a stochastic operator called β-operator. The Sudoku puzzle is a popular game formulated as an optimization problem to come up with exact solution. Some Sudoku puzzle examples have been applied for evaluation process. The parameters of the β-Hill Climbing is also studied to show the best configuration used for this game. β-Hill Climbing in its best parameter configuration is able to find solution for Sudoku puzzle in 19 iterations and 2 seconds. |
Type | Journal Article |
Date | 2017 |
Published in | Information and Communication Technology (PICICT), 2017 Palestinian International Conference on |
Publisher | IEEE |
Citation | |
Item link | Item Link |
License | ![]() |
Collections | |
Files in this item | ||
---|---|---|
Alijla, Basem O_5.pdf | 284.1Kb |