View the model
Download the model

On an N by N chessboard place N Queens so that there is at most one queen in each row, each column, and each diagonal. This version solves it using the optimizer. There are direct methods of solution that take time proportional to N.