Hangman

X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;ds=sidebyside;f=hangman.html;fp=hangman.html;h=c26ca318035463a186eca4cf87e06ea6a3912c1f;hb=4695b053223ab4a5b5a3f4385767bbc8777c4ca8;hp=0000000000000000000000000000000000000000;hpb=98a88e5d7272254b1b1f6172f4c1e5b848634287;p=cas-master-teacher-training.git diff --git a/hangman.html b/hangman.html new file mode 100644 index 0000000..c26ca31 --- /dev/null +++ b/hangman.html @@ -0,0 +1,215 @@ + + + + Hangman + + + + +

+
+# Hangman
+
+1. Set a puzzle
+2. Guess a word
+3. Automatic player
+4. Better strategies
+
+---
+
+layout: true
+
+.indexlink[[Index](index.html)]
+
+---
+# Hangman setter
+
+A fairly traditional hangman game. The computer chooses a word, the (human) player has to guess it without making too many wrong guesses. You'll need to find a list of words to chose from and develop a simple UI for the game (e.g. text only: display the target word with underscores and letters, lives left, and maybe incorrect guesses). 
+
+## Data structures
+
+* What do we need to track?
+* What operations do we need to perform on it?
+* How to store it?
+
+---
+# Data for Hangman
+
+## Creating a game
+* 'List' of words to choose from
+    * Pick one at random
+
+## Game state
+
+<table>
+<tr valign="top">
+<th>Data</th>
+<th>         </th>
+<th>Operations</th>
+</tr>
+<tr valign="top">
+<td>
+
+* Target word
+* Discovered letters
+    * In order in the word
+* Lives left
+* Wrong letters?
+
+</td>
+<td></td>
+<td>
+
+* Get a guess
+* Update discovered letters
+* Update lives
+* Show discovered word
+* Detect game end, report
+* Detect game win or loss, report
+
+</td>
+</tr>
+</table>
+
+---
+# Hangman guesser
+
+The other side of the game. The human choses a word, the computer has to guess it. Again, go for a very simple UI. Perhaps the human just responds with a list of letter positions for a correct guess, or zero for an incorrect guess. 
+
+## Data structures
+
+* What do we need to track?
+* What operations do we need to perform on it?
+* How to store it?
+
+## Need to think about the algorithm first
+
+How will we solve the game?
+
+---
+
+# Guessing strategies
+
+Guess words in order of frequency in English
+
+What is the frequency of letters in English?
+
+Pick a novel, count the letters, list them in frequency order
+
+Hint: four lines of code, two of them are 
+```python
+import collections
+import string```
+
+---
+
+# Building a guesser
+
+Given:
+
+* the discovered word
+* the wrong guesses so far
+* the order of letters to guess
+
+Find:
+
+* The most common unguessed letter
+
+Build one
+
+---
+# Autoplayer
+
+Put step 1 and step 2 together so the computer can play both sides of hangman on its own. You'll need to fix the interface between the two sides: perhaps define a fixed format for the "state" of a hangman game. Get them to play several thousand games together and log the results (how many games can they play overnight?). Do a bit of data analysis: how many games were won, how does the word length affect the win rate and the number of guesses needed to get the word, is the number of guesses per target letter constant, and so on.
+
+---
+# Autoplayer
+
+Tidy things up: encapsulate in objects
+
+Define a class for a game, a class for a player
+
+Run a game by instantiating a game object, passing in a player object
+
+Interface: the `player` must respond to a `guess` method
+
+Make the `game` generate output only if it's not passed a `player` 
+
+---
+# Different player strategies
+
+Develop different strategies for playing hangman and see which is best. Can you order guesses by letter occurrence frequency (in either normal English or the dictionary)? Does a stochastic or deterministic approach work better?
+What counts as a "better" strategy?
+
+* Think of some better players
+* Implement them
+* Test their performance
+* Write records of game to CSV files (look at the standard `csv` library)
+
+

+ + + + + + +