  Hadamard's maximal determinant problem consists in finding the maximal value
of the determinant of a square $n\times n$ matrix whose entries are plus or
minus ones. This is a difficult mathematical problem which is not yet solved.
In the present paper a simplified version of the problem is considered and
studied numerically.
