ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Solution of the Bishops in Convocation Problem using a Parallel Genetic Algorithm on a Gpu

Journal: International Journal of Mechanical and Production Engineering Research and Development (IJMPERD ) (Vol.10, No. 5)

Publication Date:

Authors : ;

Page : 187-192

Keywords : Bishops in Convocation; Quadratic Assignment Problem (QAP); Graphics Processing Unit (GPU); CUDA (Compute Unified Device Architecture); Parallel Genetic Algorithms;

Source : Downloadexternal Find it from : Google Scholarexternal


In this article we designed a Parallel Genetic Algorithm and implemented it on a GPU to solve the problem of the maximum number of bishops without attacks (Bishops in Convocation) that can be placed on a chessboard of size k x k. The encoding used to represent an individual in the Genetic Algorithm is a binary encoding which is transformed into an integer encoding that represents a solution to the Quadratic Assignment Problem (QAP). The appropriately defined QAP flow and distance matrices describe the location of the bishops on the chessboard.

Last modified: 2021-03-18 21:54:01