-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathhangman.py
171 lines (151 loc) · 5.51 KB
/
hangman.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
import random
from words import word_list
"""
Hangman game
"""
def get_word():
word= (random.choice(word_list)).upper()
return word #.upper()
def hangman(word):
word_completion = '-' * len(word) #prints the word as dashes (-----)
guessed = False #Has the word been correctly guessed yet?
guessed_letters = [] #letters that have been guessed
guessed_words = [] #words that have been guessed
lives = 6 #number of remaining trials which corresponds to the diagrams
print("\nWelcome to Hangman!")
print("\n\tQuickly. Save him before he disappears!")
print(diagram(6-lives))
print(word_completion)
print("\n")
while not guessed and lives > 0:
guess = input("Please guess a letter or word: ").upper()
# if a letter (which must be in the english alphabet) was guessed
if len(guess) == 1 and guess.isalpha():
if guess in guessed_letters:
print(f"You already guessed the letter {guess} earlier")
elif guess not in word:
print(f"{guess} is not in the word")
lives -= 1
guessed_letters.append(guess)
else: # letter was guessed correctly
print(f"Good job! {guess} is in the word")
guessed_letters.append(guess)
# convert the string to a list so we can index it and edit the contents
word_as_list = list(word_completion)
# find all the indices which the guessed letter occupies
# in the word and make a list out of them
indices = [i for i,letter in enumerate(word) if letter == guess]
# interating through the list and replacing the '-' in the original
# word_completion variable with the appropriate guessed letter
for index in indices:
word_as_list[index] = guess
# convert the list back to a string for printing
word_completion = "".join(word_as_list)
# if the last correct guess completed the word
if '-' not in word_completion:
guessed = True
# if the guess was a word having the right length
# (with all its letters within the alphabet)
elif len(guess) == len(word) and guess.isalpha():
if guess in guessed_words:
print(f"You already guessed the word {guess} earlier")
elif guess != word:
print(f"{guess} is not the word")
guessed_words.append(guess)
else: # whole word was guessed correctly
guessed = True
word_completion = word
# if the guess was neither a letter in the alphabet,
# nor a word with the appropriate length
else:
print("Error! Invalid Guess. Try again")
print(diagram(6-lives))
print(word_completion)
print(f"You have {lives} attempts left and have used " + ', '.join(guessed_letters))
print("\n")
if guessed: #user guesses the word correctly
print("Congrats! You guessed the word correctly. You Win!")
else: #user runs out of lives but couldnt guess correctly
print(f"Sorry, you ran out of attempts. The word was {word}. Maybe next time!")
def diagram(lives):
stages = [ # final state: head, torso, both arms, and both legs
"""
--------
| |
| O
| \\|/
| |
| / \\
-
""",
# head, torso, both arms, and one leg
"""
--------
| |
| O
| \\|/
| |
| /
-
""",
# head, torso, and both arms
"""
--------
| |
| O
| \\|/
| |
|
-
""",
# head, torso, and one arm
"""
--------
| |
| O
| \\|
| |
|
-
""",
# head and torso
"""
--------
| |
| O
| |
| |
|
-
""",
# head
"""
--------
| |
| O
|
|
|
-
""",
# initial empty state
"""
--------
| |
|
|
|
|
-
"""
]
return stages[lives]
def main():
word = get_word()
hangman(word)
while input("\nDo you wish to play again?(Y/N): ").upper() == 'Y':
word = get_word()
hangman(word)
print("\nBye! Come Back Soon.\n")
if __name__ == "__main__":
main()