Calculate the number of solutions to place n queens on an n*n chess board, without any queen attacking each other. Options allow using rooks instead of queens, disabling knight attacks and setting the minimum distance between queens.
The project is about turn-based, networked multiplayer, non-cooperative, zero-sum, abstract strategy board games (e.g. Chess, Go, Reversi variants, etc.) on 3D-visualized polyhedra and related recreational (discrete, computational) mathematics.