Add a short explanation to the README.HEADmaster

1 files changed, 5 insertions, 2 deletions

diff --git a/README.md b/README.md
index 1f379a4..479706a 100644
--- a/README.md
+++ b/README.md
@@ -1,9 +1,12 @@
 # Bananagrams solver
 
-This program creates a Scrabble-like grid from some given letters and a word list.
+This program creates a Scrabble-like grid from some given letters and a word
+list. The problem is that all the given letters have to appear exactly as often
+as they are given, and no letters can be left over at the end.
 
 The Haskell and Python versions both use the same algorithm. I wrote the Python
-version first and then rewrote it in Haskell for speed.
+version first and then rewrote it in Haskell for speed, as the algorithm isn't
+particularly smart (it's pretty much brute force).
 
 Both executables take a word list and, optionally, some letters to lay out. If
 no letters are given, random letters are chosen.