Welcome to the CS314 hangman game.

1 0
2 0
3 0
4 9
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 0
20 0
21 0
22 0
23 0
24 0
What length word do you want to use? 4
How many wrong answers allowed? 5
What difficulty level do you want?
Enter a number between 1(EASIEST) and 3(HARDEST) : 3
guesses left: 5
DEBUGGING: words left : 9
guessed so far : []
current word : ----
Your guess? e

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 3 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 3
pattern: ---e, number of words: 1
pattern: --e-, number of words: 2
pattern: -e--, number of words: 2
pattern: e--e, number of words: 1
END DEBUGGING

Sorry, there are no e's

guesses left: 4
DEBUGGING: words left : 3
guessed so far : [e]
current word : ----
Your guess? i

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 3 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 3
END DEBUGGING

Sorry, there are no i's

guesses left: 3
DEBUGGING: words left : 3
guessed so far : [e, i]
current word : ----
Your guess? o

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: -oo-. New family has 2 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 1
pattern: -oo-, number of words: 2
END DEBUGGING

Yes, there are 2 o's

guesses left: 3
DEBUGGING: words left : 2
guessed so far : [e, i, o]
current word : -oo-
Your guess? g

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: -oo-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: -oo-, number of words: 1
pattern: goo-, number of words: 1
END DEBUGGING

Sorry, there are no g's

guesses left: 2
DEBUGGING: words left : 1
guessed so far : [e, g, i, o]
current word : -oo-
Your guess? m

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: -oo-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: -oo-, number of words: 1
END DEBUGGING

Sorry, there are no m's

guesses left: 1
DEBUGGING: words left : 1
guessed so far : [e, g, i, m, o]
current word : -oo-
Your guess? n

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: -oo-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: -oo-, number of words: 1
END DEBUGGING

Sorry, there are no n's

answer = cool
Sorry, you lose

Another game? Enter y for another game, anything else to quit: y
What length word do you want to use? 4
How many wrong answers allowed? 3
What difficulty level do you want?
Enter a number between 1(EASIEST) and 3(HARDEST) : 3
guesses left: 3
DEBUGGING: words left : 9
guessed so far : []
current word : ----
Your guess? i

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 8 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 8
pattern: i---, number of words: 1
END DEBUGGING

Sorry, there are no i's

guesses left: 2
DEBUGGING: words left : 8
guessed so far : [i]
current word : ----
Your guess? e

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 3 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 3
pattern: ---e, number of words: 1
pattern: --e-, number of words: 1
pattern: -e--, number of words: 2
pattern: e--e, number of words: 1
END DEBUGGING

Sorry, there are no e's

guesses left: 1
DEBUGGING: words left : 3
guessed so far : [e, i]
current word : ----
Your guess? u

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 3 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 3
END DEBUGGING

Sorry, there are no u's

answer = cool
Sorry, you lose

Another game? Enter y for another game, anything else to quit: y
What length word do you want to use? 4
How many wrong answers allowed? 10
What difficulty level do you want?
Enter a number between 1(EASIEST) and 3(HARDEST) : 3
guesses left: 10
DEBUGGING: words left : 9
guessed so far : []
current word : ----
Your guess? i

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 8 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 8
pattern: i---, number of words: 1
END DEBUGGING

Sorry, there are no i's

guesses left: 9
DEBUGGING: words left : 8
guessed so far : [i]
current word : ----
Your guess? o

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 5 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 5
pattern: -o--, number of words: 1
pattern: -oo-, number of words: 2
END DEBUGGING

Sorry, there are no o's

guesses left: 8
DEBUGGING: words left : 5
guessed so far : [i, o]
current word : ----
Your guess? u

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 5 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 5
END DEBUGGING

Sorry, there are no u's

guesses left: 7
DEBUGGING: words left : 5
guessed so far : [i, o, u]
current word : ----
Your guess? a

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 2 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 2
pattern: ---a, number of words: 1
pattern: --a-, number of words: 1
pattern: a---, number of words: 1
END DEBUGGING

Sorry, there are no a's

guesses left: 6
DEBUGGING: words left : 2
guessed so far : [a, i, o, u]
current word : ----
Your guess? e

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: --e-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: --e-, number of words: 1
pattern: e--e, number of words: 1
END DEBUGGING

Yes, there is one e

guesses left: 6
DEBUGGING: words left : 1
guessed so far : [a, e, i, o, u]
current word : --e-
Your guess? b

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: --e-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: --e-, number of words: 1
END DEBUGGING

Sorry, there are no b's

guesses left: 5
DEBUGGING: words left : 1
guessed so far : [a, b, e, i, o, u]
current word : --e-
Your guess? c

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: --e-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: --e-, number of words: 1
END DEBUGGING

Sorry, there are no c's

guesses left: 4
DEBUGGING: words left : 1
guessed so far : [a, b, c, e, i, o, u]
current word : --e-
Your guess? f

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: f-e-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: f-e-, number of words: 1
END DEBUGGING

Yes, there is one f

guesses left: 4
DEBUGGING: words left : 1
guessed so far : [a, b, c, e, f, i, o, u]
current word : f-e-
Your guess? l

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: fle-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: fle-, number of words: 1
END DEBUGGING

Yes, there is one l

guesses left: 4
DEBUGGING: words left : 1
guessed so far : [a, b, c, e, f, i, l, o, u]
current word : fle-
Your guess? w

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: flew. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: flew, number of words: 1
END DEBUGGING

Yes, there is one w

answer = flew
You beat me

Another game? Enter y for another game, anything else to quit: y
What length word do you want to use? 4
How many wrong answers allowed? 8
What difficulty level do you want?
Enter a number between 1(EASIEST) and 3(HARDEST) : 3
guesses left: 8
DEBUGGING: words left : 9
guessed so far : []
current word : ----
Your guess? e

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 3 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 3
pattern: ---e, number of words: 1
pattern: --e-, number of words: 2
pattern: -e--, number of words: 2
pattern: e--e, number of words: 1
END DEBUGGING

Sorry, there are no e's

guesses left: 7
DEBUGGING: words left : 3
guessed so far : [e]
current word : ----
Your guess? s

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 3 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 3
END DEBUGGING

Sorry, there are no s's

guesses left: 6
DEBUGGING: words left : 3
guessed so far : [e, s]
current word : ----
Your guess? u

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 3 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 3
END DEBUGGING

Sorry, there are no u's

guesses left: 5
DEBUGGING: words left : 3
guessed so far : [e, s, u]
current word : ----
Your guess? a

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 2 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 2
pattern: a---, number of words: 1
END DEBUGGING

Sorry, there are no a's

guesses left: 4
DEBUGGING: words left : 2
guessed so far : [a, e, s, u]
current word : ----
Your guess? e
You already guessed that

guesses left: 4
DEBUGGING: words left : 2
guessed so far : [a, e, s, u]
current word : ----
Your guess? i

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 2 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 2
END DEBUGGING

Sorry, there are no i's

guesses left: 3
DEBUGGING: words left : 2
guessed so far : [a, e, i, s, u]
current word : ----
Your guess? o

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: -oo-. New family has 2 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: -oo-, number of words: 2
END DEBUGGING

Yes, there are 2 o's

guesses left: 3
DEBUGGING: words left : 2
guessed so far : [a, e, i, o, s, u]
current word : -oo-
Your guess? n

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: -oo-. New family has 2 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: -oo-, number of words: 2
END DEBUGGING

Sorry, there are no n's

guesses left: 2
DEBUGGING: words left : 2
guessed so far : [a, e, i, n, o, s, u]
current word : -oo-
Your guess? m

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: -oo-. New family has 2 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: -oo-, number of words: 2
END DEBUGGING

Sorry, there are no m's

guesses left: 1
DEBUGGING: words left : 2
guessed so far : [a, e, i, m, n, o, s, u]
current word : -oo-
Your guess? g

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: -oo-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: -oo-, number of words: 1
pattern: goo-, number of words: 1
END DEBUGGING

Sorry, there are no g's

answer = cool
Sorry, you lose

Another game? Enter y for another game, anything else to quit: y
What length word do you want to use? 4
How many wrong answers allowed? 8
What difficulty level do you want?
Enter a number between 1(EASIEST) and 3(HARDEST) : 1
guesses left: 8
DEBUGGING: words left : 9
guessed so far : []
current word : ----
Your guess? a

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 6 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 6
pattern: ---a, number of words: 1
pattern: --a-, number of words: 1
pattern: a---, number of words: 1
END DEBUGGING

Sorry, there are no a's

guesses left: 7
DEBUGGING: words left : 6
guessed so far : [a]
current word : ----
Your guess? e

DEBUGGING: Picking second longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: --e-. New family has 2 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 2
pattern: ---e, number of words: 1
pattern: --e-, number of words: 2
pattern: e--e, number of words: 1
END DEBUGGING

Yes, there is one e

guesses left: 7
DEBUGGING: words left : 2
guessed so far : [a, e]
current word : --e-
Your guess? i

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: --e-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: --e-, number of words: 1
pattern: i-e-, number of words: 1
END DEBUGGING

Sorry, there are no i's

guesses left: 6
DEBUGGING: words left : 1
guessed so far : [a, e, i]
current word : --e-
Your guess? o

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: --e-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: --e-, number of words: 1
END DEBUGGING

Sorry, there are no o's

guesses left: 5
DEBUGGING: words left : 1
guessed so far : [a, e, i, o]
current word : --e-
Your guess? c

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: --e-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: --e-, number of words: 1
END DEBUGGING

Sorry, there are no c's

guesses left: 4
DEBUGGING: words left : 1
guessed so far : [a, c, e, i, o]
current word : --e-
Your guess? f

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: f-e-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: f-e-, number of words: 1
END DEBUGGING

Yes, there is one f

guesses left: 4
DEBUGGING: words left : 1
guessed so far : [a, c, e, f, i, o]
current word : f-e-
Your guess? l

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: fle-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: fle-, number of words: 1
END DEBUGGING

Yes, there is one l

guesses left: 4
DEBUGGING: words left : 1
guessed so far : [a, c, e, f, i, l, o]
current word : fle-
Your guess? w

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: flew. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: flew, number of words: 1
END DEBUGGING

Yes, there is one w

answer = flew
You beat me

Another game? Enter y for another game, anything else to quit: y
What length word do you want to use? 4
How many wrong answers allowed? 8
What difficulty level do you want?
Enter a number between 1(EASIEST) and 3(HARDEST) : 1
guesses left: 8
DEBUGGING: words left : 9
guessed so far : []
current word : ----
Your guess? s

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 8 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 8
pattern: --s-, number of words: 1
END DEBUGGING

Sorry, there are no s's

guesses left: 7
DEBUGGING: words left : 8
guessed so far : [s]
current word : ----
Your guess? r

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 8 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 8
END DEBUGGING

Sorry, there are no r's

guesses left: 6
DEBUGGING: words left : 8
guessed so far : [r, s]
current word : ----
Your guess? t

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 7 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 7
pattern: --t-, number of words: 1
END DEBUGGING

Sorry, there are no t's

guesses left: 5
DEBUGGING: words left : 7
guessed so far : [r, s, t]
current word : ----
Your guess? e

DEBUGGING: Picking second longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: --e-. New family has 2 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 3
pattern: ---e, number of words: 1
pattern: --e-, number of words: 2
pattern: -e--, number of words: 1
END DEBUGGING

Yes, there is one e

guesses left: 5
DEBUGGING: words left : 2
guessed so far : [e, r, s, t]
current word : --e-
Your guess? f

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: --e-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: --e-, number of words: 1
pattern: f-e-, number of words: 1
END DEBUGGING

Sorry, there are no f's

guesses left: 4
DEBUGGING: words left : 1
guessed so far : [e, f, r, s, t]
current word : --e-
Your guess? l

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: --e-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: --e-, number of words: 1
END DEBUGGING

Sorry, there are no l's

guesses left: 3
DEBUGGING: words left : 1
guessed so far : [e, f, l, r, s, t]
current word : --e-
Your guess? w

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: --e-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: --e-, number of words: 1
END DEBUGGING

Sorry, there are no w's

guesses left: 2
DEBUGGING: words left : 1
guessed so far : [e, f, l, r, s, t, w]
current word : --e-
Your guess? b

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: -be-. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: -be-, number of words: 1
END DEBUGGING

Yes, there is one b

guesses left: 2
DEBUGGING: words left : 1
guessed so far : [b, e, f, l, r, s, t, w]
current word : -be-
Your guess? x

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: -bex. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: -bex, number of words: 1
END DEBUGGING

Yes, there is one x

guesses left: 2
DEBUGGING: words left : 1
guessed so far : [b, e, f, l, r, s, t, w, x]
current word : -bex
Your guess? i

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ibex. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ibex, number of words: 1
END DEBUGGING

Yes, there is one i

answer = ibex
You beat me

Another game? Enter y for another game, anything else to quit: y
What length word do you want to use? 4
How many wrong answers allowed? 8
What difficulty level do you want?
Enter a number between 1(EASIEST) and 3(HARDEST) : 2
guesses left: 8
DEBUGGING: words left : 9
guessed so far : []
current word : ----
Your guess? u

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 9 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 9
END DEBUGGING

Sorry, there are no u's

guesses left: 7
DEBUGGING: words left : 9
guessed so far : [u]
current word : ----
Your guess? i

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 8 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 8
pattern: i---, number of words: 1
END DEBUGGING

Sorry, there are no i's

guesses left: 6
DEBUGGING: words left : 8
guessed so far : [i, u]
current word : ----
Your guess? a

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ----. New family has 5 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 5
pattern: ---a, number of words: 1
pattern: --a-, number of words: 1
pattern: a---, number of words: 1
END DEBUGGING

Sorry, there are no a's

guesses left: 5
DEBUGGING: words left : 5
guessed so far : [a, i, u]
current word : ----
Your guess? e

DEBUGGING: Picking second longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ---e. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ----, number of words: 2
pattern: ---e, number of words: 1
pattern: --e-, number of words: 1
pattern: e--e, number of words: 1
END DEBUGGING

Yes, there is one e

guesses left: 5
DEBUGGING: words left : 1
guessed so far : [a, e, i, u]
current word : ---e
Your guess? t

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ---e. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ---e, number of words: 1
END DEBUGGING

Sorry, there are no t's

guesses left: 4
DEBUGGING: words left : 1
guessed so far : [a, e, i, t, u]
current word : ---e
Your guess? b

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ---e. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ---e, number of words: 1
END DEBUGGING

Sorry, there are no b's

guesses left: 3
DEBUGGING: words left : 1
guessed so far : [a, b, e, i, t, u]
current word : ---e
Your guess? c

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ---e. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ---e, number of words: 1
END DEBUGGING

Sorry, there are no c's

guesses left: 2
DEBUGGING: words left : 1
guessed so far : [a, b, c, e, i, t, u]
current word : ---e
Your guess? m

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ---e. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ---e, number of words: 1
END DEBUGGING

Sorry, there are no m's

guesses left: 1
DEBUGGING: words left : 1
guessed so far : [a, b, c, e, i, m, t, u]
current word : ---e
Your guess? n

DEBUGGING: Picking longest list. (tie broken by fewest chars revealed)
DEBUGGING: New pattern is: ---e. New family has 1 words.


DEBUGGING: Based on guess here are resulting patterns and number
of words in each pattern: 
pattern: ---e, number of words: 1
END DEBUGGING

Sorry, there are no n's

answer = hope
Sorry, you lose

Another game? Enter y for another game, anything else to quit: n