Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

13.12 PA4 Q2: Fight! Now we want a way to make our monsters fight! Before two monsters can fight, we need to give 2 new

image text in transcribedimage text in transcribedimage text in transcribed

13.12 PA4 Q2: Fight! Now we want a way to make our monsters fight! Before two monsters can fight, we need to give 2 new class methods that update their stats. Implement a method for "win_fight" and "lose_fight". Win_fight should add 5 to the monster's self.exp and reset their hp to max_hp. "lose_fight" should also reset their hp but only adds 1 exp to self.exp. Now write a function that takes 2 instances of the monster class and makes them fight. This function should be defined outside the Monster class, i.e. it is not a Monster method. A fight goes as follows: 1. The monster that entered as the first function goes first. 2. Each monster takes a turn using one attack move. The monster selects this attack move from the strongest to the weakest in a circular function. For example: A monster has a dictionary of possible attack as follows: ["fire_storm": 3, "double_hit": 4, "earthquake": 2, "ice_storm": 3] Monster will select the following attacks: Round No Move Explanation 1 double_hit Highest hit points 2 fire_storm Same hit points as ice_storm but comes first alphabetically 3 ice_storm 4 earthquake 3 ice_storm 4 earthquake 5 double hit 6 fire_storm 7 ice_storm .... And so on. 3. An attack is always successful and will decrease the opponent's hp by the given number of points in self.attacks dictionary. The monsters continue taking turns until their current hp becomes less than or equal to zero. 4. At this point, the win_fight and lose_fight method should be invoked. Once this complete, return 3 things from the function. o Round_number o Monster that won (return the corresponding Monster object) o List of attacks the monster used Special Edge Case: If both monster only have "wait" as an attack, return -1 (round_number) None (for monster name that won) None (for list of attack that monster use) 299672.1716720.qx3zqy? None (for list of attack that monster use) 299672 1716720.qx3zay7 LAB ACTIVITY 13.12.1: PA4 Q2: Fight! 0/30 main.py Load default template... 1 class Monster(): 2 def __init__(self, name, hp-20): 3 Self.exp = 0 4 #your code here 5 def add_attack(self, attack_name): 6 pass #your code here 7 def remove_attack(self, attack_name): 8 pass #your code here 9 def win_fight(self): 10 pass #your code here 11 def lose_fight(self): 12 pass #your code here 13 14 def monster_fight(monsteri, monster 2): 15 pass #your code here 16 Develop mode Submit mode Run your program as often as you'd like, before submitting for grading. Below, type any needed input values in the first box, then click Run program and observe the program's output in the second box

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Inductive Databases And Constraint Based Data Mining

Authors: Saso Dzeroski ,Bart Goethals ,Pance Panov

2010th Edition

1489982175, 978-1489982179

More Books

Students also viewed these Databases questions

Question

Are the rules readily available?

Answered: 1 week ago

Question

Have ground rules been established for the team?

Answered: 1 week ago

Question

Is how things are said consistent with what is said?

Answered: 1 week ago