Python In this assignment, a game called treasure hunt will be written object oriented. There are 3 types of treasures in the game. Diamond, Emerald and Gold. Diamond is 100 points, Emerald 70 points and Gold is 50 points. There are thieves in the game that will prevent you from hunting for treasure. Encountering a thief they steal some of your treasure. You will randomly generate which thief will steal from which treasure and how much. At the beginning of the game, the player has no treasure. X, Y, Z and H will be randomly identified at the start of the game. Define X Diamonds, a random number between X -> 100-200. Let a random number be defined between Y Emerald Y -> 100-200. Define a random number between Z Gold Z -> 100-200. You will define H thieves. Let it be defined between H -> 5-20. It will collect these randomly selected treasures to the player. For example: 1- Diamond 2-Emerald 3-Diamond 4-Gold 5-Thief (k = treasure to steal, n = how many pieces he can steal) 6-Gold .... In this way, there is a sample ranking. 1. The treasure point of the player to whom the message came from Diamond will be 100, 2. With the message Emerald, this treasure point will be 170, 3. The treasure point will be 270, from which the diamond came again. 4. for their sites encountered with thieves; It will decrease by k (diamond or emerald or gold?) by n. In this way, until the end of the game, how much gold, how many diamonds and how many emeralds the player has collected and the treasure points will be written.

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
icon
Related questions
Question

Python

In this assignment, a game called treasure hunt will be written object oriented.
There are 3 types of treasures in the game. Diamond, Emerald and Gold. Diamond is 100 points, Emerald 70 points and Gold is 50 points.
There are thieves in the game that will prevent you from hunting for treasure. Encountering a thief they steal some of your treasure. You will randomly generate which thief will steal from which treasure and how much.
At the beginning of the game, the player has no treasure. X, Y, Z and H will be randomly identified at the start of the game.


Define X Diamonds, a random number between X -> 100-200.
Let a random number be defined between Y Emerald Y -> 100-200.
Define a random number between Z Gold Z -> 100-200.
You will define H thieves. Let it be defined between H -> 5-20.


It will collect these randomly selected treasures to the player.
For example:
1- Diamond
2-Emerald
3-Diamond
4-Gold
5-Thief (k = treasure to steal, n = how many pieces he can steal)
6-Gold
....


In this way, there is a sample ranking.
1. The treasure point of the player to whom the message came from Diamond will be 100, 2. With the message Emerald, this treasure point will be 170, 3. The treasure point will be 270, from which the diamond came again. 4. for their sites encountered with thieves; It will decrease by k (diamond or emerald or gold?) by n. In this way, until the end of the game, how much gold, how many diamonds and how many emeralds the player has collected and the treasure points will be written.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Data members
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education