Hangman (again)

X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;ds=sidebyside;f=hangman2.html;fp=hangman2.html;h=0a092a1b2add55facdc4d3cdd5e09b100e6e4a25;hb=e9dc0617257c291664c41f2583aafaf6035217da;hp=0000000000000000000000000000000000000000;hpb=dbcf4c0acaf308c6147b6ed34852136c78cecbea;p=cas-master-teacher-training.git diff --git a/hangman2.html b/hangman2.html new file mode 100644 index 0000000..0a092a1 --- /dev/null +++ b/hangman2.html @@ -0,0 +1,173 @@ + + + + Hangman (again) + + + + +

+
+# Hangman
+
+1. **Set a puzzle** <== here
+2. Guess a word
+3. Automatic player
+4. Better strategies
+
+---
+
+layout: true
+
+.indexlink[[Index](index.html)]
+
+---
+# 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>
+
+---
+
+# Next steps
+
+We've got a list of valid words. 
+
+* How to pick one?
+    * look in the `random` module
+
+* Once we have a word, how to represent what's been guessed?
+
+---
+
+# Representing the game state
+
+Three data items:
+
+* `target`, the target word: a `string`
+* `discovered`, what's been found so far: a `list` of letters (each a length-one `string`)
+    * unguessed letters are `_`
+* `guess`, the letter that's just been guessed: a length-one `string`
+* `lives`, the lives remaining: an `int`
+* `wrong_letters`, the incorrect guesses: a `list` (optional)
+    * (but it makes the automated players easier if they don't have to track wrong guesses and therefore be made stateless)
+
+---
+
+# Challenges
+
+1. Print a `discovered` word
+2. Read a letter
+3. Check if the `guess`ed letter is in the `target`
+4. Update `discovered` word with the newly-`guess`ed letter
+5. Update `lives` and `wrong_letters` if the guess is wrong
+
+## Hints
+
+1. Remember `<string>.join(<list>)` ?
+2. `input('prompt')` (or `input('prompt').strip().lower()[0]` )
+3. Walk over `target`, looking for `guess`. Explicit iteration (`for letter in target:`) or with a comprehension (`enumerate(target)`)
+4. `target[n] = guess`. Note that you need the numerical position, and you need all the positions for repeated words.
+5. How do you know the guess is wrong?
+
+
+

+ + + + + + +