From 2fcc387ebbc9bc5ef98e5aa78bae11678fc614d3 Mon Sep 17 00:00:00 2001 From: Nick Johnson Date: Mon, 7 Dec 2015 07:36:27 +0000 Subject: [PATCH] Fixed typo --- book.html | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/book.html b/book.html index e2ff9f2..d7c0fc6 100644 --- a/book.html +++ b/book.html @@ -220,7 +220,7 @@

How this book was written

Next, take each word and pick out just the 'e's to make a pattern. So, eel becomes ee_, and flame becomes ____e. If the word doesn't contain any 'e's, the pattern is all blanks - so cabin is _____. Group each word by the pattern it makes, so both smile and flame are grouped under ____e.

Now we've got enough information to build section 1: we know what letter to guess, and we know the groups that the words in our dictionary form, which make up the entries in the table.

To generate the next set of sections, we use recursion: we take each group of words we identified in the previous step, and repeat the whole process all over again: pick a letter to guess, and group the words again based on that letter. This process repeats over and over for each group, sub-group, sub-sub-group, and so on, until we've processed the entire set of words into sections. Print and bind it into a book, and you're done!

-

If you'd like to experiement with this yourself, the source code and word lists we used to generate this book are available online, at https://github.com/arachnidlabs/hangman/. Enjoy!

+

If you'd like to experiment with this yourself, the source code and word lists we used to generate this book are available online, at https://github.com/arachnidlabs/hangman/. Enjoy!

Start here