Meerkat Clan Algorithm for Solving N-Queen Problems

  • Sura Mazin Ali Political Science College, Mustansiriyah University, Baghdad, Iraq
  • Noor Thamer Mahmood Computer Science Department, College of Science, Mustansiriyah University, Baghdad, Iraq
  • Samer Amil Yousif Computer Science Department, College of Science, Mustansiriyah University, Baghdad, Iraq
Keywords: Swarm Intelligence, N-Queen problem, MCA, PSO, GA, NP

Abstract

The swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environment is a directed graph, called the search space, produced for the efficient search of valid n-queens’ placement, in a way that they do not cause harm to one another. This paper also presents the development of an intelligent heuristic function which is helpful to find the solution with high speed and effectiveness. This study includes a detailed discussion of the problem background, problem complexity, Meerkat Clan Algorithm, and comparisons of the problem solution with the Practical Swarm Optimization (PSO) and Genetic Algorithm (GA. It is an entirely review-based work which implemented the suggested designs and architectures of the methods and a fair amount of experimental results.

Published
2021-07-01
How to Cite
Ali, S. M., Mahmood , N. T., & Yousif , S. A. (2021). Meerkat Clan Algorithm for Solving N-Queen Problems. Iraqi Journal of Science, 62(6), 2082-2089. https://doi.org/10.24996/ijs.2021.62.6.33
Section
Computer Science