Summary: The classical \(n\)-queen problem has been used as a benchmark for goal searching in a solution space by the artificial intelligence community. The original problem was confined to 8 queens on a regular chessboard. Over the years, it has transformed into many forms.
In this paper, we talk about yet another variation of the \(n\)-queen problem, the modular \(n\)-queen problem, and ask if the readers are able to answer the open problems.