Constructing constrained-version of magic squares using selection hyper-heuristics
Kheiri, Ahmed; Özcan, Ender
Date: 11 November 2013
Article
Journal
The Computer Journal
Publisher
Oxford University Press for BCS, The Chartered Institute for IT
Publisher DOI
Abstract
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 ...
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.
Computer Science
Faculty of Environment, Science and Economy
Item views 0
Full item downloads 0