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

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.