Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

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

Kheiri, Ahmed ORCID: and Ozcan, Ender 2014. Constructing constrained-version of magic squares using selection hyper-heuristics. Computer Journal 57 (3) , pp. 469-479. 10.1093/comjnl/bxt130

[thumbnail of TheComputerJournal2014.pdf]
PDF - Accepted Post-Print Version
Download (227kB) | Preview


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: Article
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher: Oxford University Press
ISSN: 0010-4620
Date of First Compliant Deposit: 23 June 2016
Last Modified: 09 Nov 2023 16:33

Citation Data

Cited 5 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics