============================================================================
     Title: Weighted N-Queens
   Authors: L. Liu <lliu1@cs.uky.edu> and M. Truszczynski <mirek@cs.uky.edu>
            Department of Computer Science, University of Kentucky
	    Lexington, KY, USA
   Version: 0.1
  Category: OPT
# of files: 15
============================================================================
Let D be a n by n chess board. Each square (i, j) on D is associated with
a non-negative integer weight denoted by w(i, j). A solution to the problem
is a placement of n queens on the board so that none of them attack each
other. Two queens attack each other if and only if:
1. They are in the same row; or
2. They are in the same column; or
3. They are in the same ascending diagonal; or
4. They are in the same descending diagonal.

The objective function we want to minimize is the sum of the weights
of the squares that contain queens.

We generated 15 random 100 by 100 chess boards. The weights of the squares
are between 1 and 99.