Any idea for algorithm that as parameters get dimension of
crossword (width and height) and dictionary file.
The result should be a file with crossword.
The crossword should have fewest empty squares.

Only idea I have was to write recurency algorithm put word,
then try next until no more words can fit into crossword.
Check the number of empty squares, and save that crossword if
it is the best.

If anyone have any idea about other solutions or some simplification of recurency search please write.