The files grey16_16_92.dat (resp. grey8_8_13.dat) may be used to create many
other instances. Let m be a positive integer lower than 256 (resp. 64).
The first matrix of these files is replaced by a matrix with coefficients :

f[i,j] = 1 if i<=m and j<=m (i, j = 1, ..., m)
       = 0 otherwise

These new problems are named grey16_16_m (grey8_8_m).

Good solutions of many of these generic problems are given in the files
grey8_8.txt and grey16_16.txt.

The format of these file is :
m, solution value, solution (i.e. permutation)