The N-Queens benchmark solves the combinatorially hard problem of placing
N queens on a chess board such that no queen attacks another. Recursive
search is used to find a solution.

The program takes one parameter: N, which also indicates the width/height of
the board.
