Learn More
The queen graph coloring problem consists in covering a n × n chessboard with n 2 queens, so that two queens of the same color cannot attack each other. When the size, n, of the chessboard is a multiple of 2 or 3, it is hard to color the queen graph with only n colors. We have developed an exact algorithm which is able to solve exhaustively this problem for(More)