                     (frequencies (str/join words)) )
     avail-chars   (set/difference all-letters guessed-chars)
     best-char     (apply max-key #(get char-freqs % -1) avail-chars) 
-  ] 
-    best-char 
-  ))
+  ] best-char ))
 
 (defn do-tests []
   ; Test regex stuff
   (assert (= (complement-char-class #{})         "."      ))
   (assert (= (complement-char-class #{\a \b})    "[^ab]"  ))
   (let [words           ["abcd" "xbcd" "xxcd" "xxxd"]
-        letters         [\a \b \c \d] 
         guessed-chars   #{\b \s}
         clue-str        "-b--"
         not-char-class  (complement-char-class    guessed-chars)

         (take show-info-size (map #(str \" % \") string-seq)) ))

(defn make-clue
  "Returns a clue string given the target word and a vec of guessed letters. The
  clue is a string the length of the target word consisting of either letters
  (for correctly guessed letters) or hyphens (for incorrect guesses)."
  [tgt-word guessed-chars]

    (HangmanUtils/isKeepGuessing hangmanGame ) "keep-guessing" ))

(defn get-game-guessed-chars
  "Returns a Clojure set of chars that have been guessed so far in the
  HangmanGame."
  [hangmanGame]
  ; NOTE:  str/lower-case expects and returns a string. Hence we must use (apply
  ; str ...) on the java HashSet returned by hangmanGame.getAllGuessedLetters()
  ; in order to generate a single (possibly zero-length) string before calling
  ; str/lower-case.  Since set expects a collection, it is used instead of
  ; (apply hash-set ...).
  (let [guessed-chars  (->> (.getAllGuessedLetters hangmanGame)
                            (apply str )
                            (str/lower-case )
