Constructing constrained-version of magic squares using selection hyper-heuristics

Kheiri, Ahmed and Özcan, Ender (2014) Constructing constrained-version of magic squares using selection hyper-heuristics. Computer Journal, 57 (3). pp. 469-479. ISSN 0010-4620

Full text not available from this repository.


A square matrix of distinct numbers in which every row, column and both diagonals have the same total is referred to as a magic square. Constructing a magic square of a given order is considered a difficult computational problem, particularly when additional constraints are imposed. Hyper-heuristics are emerging high-level search methodologies that explore the space of heuristics for solving a given problem. In this study, we present a range of effective selection hyper-heuristics mixing perturbative low-level heuristics for constructing the constrained version of magic squares. The results show that selection hyper-heuristics, even the non-learning ones deliver an outstanding performance, beating the best-known heuristic solution on average.

Item Type:
Journal Article
Journal or Publication Title:
Computer Journal
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
29 Apr 2019 16:16
Last Modified:
16 Sep 2023 01:56