Solving n-Queens problem by a Hybrid Evaluation Algorithm

Solving n-Queens problem by a Hybrid Evaluation Algorithm

Reza Khorramnia1 Elham Karimi2

1) Marvdasht Branch, Islamic Azad University
2) Safashahr Branch, Islamic Azad University

IOI Code : XYGD-BCKCH
Publication : The 5th International conference of Sciences and Engineering(5icesconf.com)
Abstract :
    N-Queen problem is a checkerboard and mathematical problems which aims to determine the position of queens on a chess board so that the queens will have the least conflict. Since the game of chess a queen is able to move in all directions, including horizontal, vertical and diagonal directions and conflict with other queens, so should set queens position in different length, width and diameter were divided in will be very complicated operation. The aim of this study is solving several N-Queen problem with proposed hybrid algorithm combining particle swarm algorithms and algorithms based learning is formed. The results show the proposed method is superior.

Keywords : n queen problem particle swarm optimization algorithm teaching learning base optimization evolution algorithm