ChessBoard, Problem & Solution

This project aims to place chess pieces of five teams on a chess board of different sizes.

The problem can be counted as a multi$-$objective approach on the N$-$Queens problem.

In the N$-$Queens problem, the objective is to place N queens on an NxN chessboard so

that none of the queens can attack each other. In N$-$Queens problem, all the pieces can

be though as belonging to different teams. Our changes over the problem are; allowing

the pieces to belong to same team and including also the other type of chess pieces. The

only change for the other pieces is about pawn$$s attacking areas. In our problem, pawn

is assumed to treat all pieces at its four corners.