Update readme.

This commit is contained in:
Gonçalo S. Martins 2016-05-19 10:05:51 +01:00
parent 526e26c4b8
commit 77045b576e

View file

@ -13,6 +13,12 @@ I purposefully designed and implemented this little project without performing r
3. The technique expands the list of words into a list of possibilities, where each possibility encodes a possible starting location for a word, as well as its direction. This essentially constitutes all possible words that can be placed into the grid.
4. A new word is taken from the list of possibilities and placed on the grid. This makes it so a number of possibilities are now invalid, and these are removed from the list. Steps 3 and 4 are repeated until the grid is as full as we want it to be.
Output
---
The script depends on LaTeX for producing the PDF output. However, the grid can be (and is, by default) printed to the screen. The PDF is print-ready, and includes both the puzzle (with the needed words) and the solution, making the output of each run completely self-contained.
Performance Considerations
---