11. In this problem you need to simulate part of a Yahtzee game. This turns out to be more complicated than I expected. To solve it, l created a dictionary (I called it "count") where the key is the number on the die and the value is the number of times that number is rolled. So, if you roll a Yahtzee of 3's, your dictionary would have the single entry count[3] = 5. You can get a list of the keys by using keys = list(count.keys()) and a list of the values using values = list(count.values()). With these, you can use the Wikipedia entry to logic things out. If there is a 5 in values, for instance, you have a Yahtzee; a 4 means you have 4 of a kind; a 3 is three of a kind if there is no 2, otherwise, it is a Full House. To get the straights, use the information in the boxes on the Wikipedia entry - if len(values) == 5, you have five different die values, but it's only a large straight if you're missing either a 1 or a 6. The small straight is a bit more complicated but similar. After you find all these, calculate the chance score as the sum of the rolls - then return either a score you've already calculated or the chance value, whichever is larger. Wheh!
11. In this problem you need to simulate part of a Yahtzee game. This turns out to be more complicated than I expected. To solve it, l created a dictionary (I called it "count") where the key is the number on the die and the value is the number of times that number is rolled. So, if you roll a Yahtzee of 3's, your dictionary would have the single entry count[3] = 5. You can get a list of the keys by using keys = list(count.keys()) and a list of the values using values = list(count.values()). With these, you can use the Wikipedia entry to logic things out. If there is a 5 in values, for instance, you have a Yahtzee; a 4 means you have 4 of a kind; a 3 is three of a kind if there is no 2, otherwise, it is a Full House. To get the straights, use the information in the boxes on the Wikipedia entry - if len(values) == 5, you have five different die values, but it's only a large straight if you're missing either a 1 or a 6. The small straight is a bit more complicated but similar. After you find all these, calculate the chance score as the sum of the rolls - then return either a score you've already calculated or the chance value, whichever is larger. Wheh!
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
I need help on my python assignment. The first screenshot is the question being asked and the second screenshot is of some hints that were given to us.
![11. In this problem you need to simulate part of a Yahtzee game. This turns out to be more complicated than I expected. To solve it, I created a
dictionary (I called it "count") where the key is the number on the die and the value is the number of times that number is rolled. So, if you roll a
Yahtzee of 3's, your dictionary would have the single entry count[3] = 5. You can get a list of the keys by using keys = list(count.keys()) and a list of the
values using values = list(count.values()). With these, you can use the Wikipedia entry to logic things out. If there is a 5 in values, for instance, you
have a Yahtzee; a 4 means you have 4 of a kind; a 3 is three of a kind if there is no 2, otherwise, it is a Full House. To get the straights, use the
information in the boxes on the Wikipedia entry - if len(values) == 5, you have five different die values, but it's only a large straight if you're missing
either a 1 or a 6. The small straight is a bit more complicated but similar. After you find all these, calculate the chance score as the sum of the rolls -
then return either a score you've already calculated or the chance value, whichever is larger. Wheh!](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9beb5ab6-4fd3-4e9c-8c6c-c4109f4c868c%2F23750638-d3c4-441f-bbcf-132540fc6168%2Ffasc4ps_processed.png&w=3840&q=75)
Transcribed Image Text:11. In this problem you need to simulate part of a Yahtzee game. This turns out to be more complicated than I expected. To solve it, I created a
dictionary (I called it "count") where the key is the number on the die and the value is the number of times that number is rolled. So, if you roll a
Yahtzee of 3's, your dictionary would have the single entry count[3] = 5. You can get a list of the keys by using keys = list(count.keys()) and a list of the
values using values = list(count.values()). With these, you can use the Wikipedia entry to logic things out. If there is a 5 in values, for instance, you
have a Yahtzee; a 4 means you have 4 of a kind; a 3 is three of a kind if there is no 2, otherwise, it is a Full House. To get the straights, use the
information in the boxes on the Wikipedia entry - if len(values) == 5, you have five different die values, but it's only a large straight if you're missing
either a 1 or a 6. The small straight is a bit more complicated but similar. After you find all these, calculate the chance score as the sum of the rolls -
then return either a score you've already calculated or the chance value, whichever is larger. Wheh!
Transcribed Image Text:11. Write a function that simulates the rolling of 5 dice at a time. Calculate and print the highest possible score of the five dice using the lower section of the
game "Yatzee".
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education