Use python to solve this alpha beta pruning problemproblem statement is 1st pictureoutput 1 explanation is 2nd picture . Problem StatementAssume that there are two teams and they are team attacker and team defender. Therefore, at a state of the gameone agent in each team is left alive respectively. Here, the defender is given a lifeline called HP which will beassigned randomly. Furthermore, the attacker agent will try to give maximum negative HP to the defender agentto decrease his(d) chances of survival in the game. On the other hand, the defender agent will try to protecthimself by receiving the lowest negative HP possible from the attacker agent. Furthermore, the attacker canhave a choice from a number of bullets from his gun and the optimal moves will cost a certain maximumnegative HP (chosen from randomly assigned values within the range of minimum and maximum negative HP).Here, are the following things you need to do using Alpha-Beta Pruning algorithm:Sample Input 1:1.2.Enter your student id:17301106Minimum and Maximum value for the range of negative HP:1 30Note: Here, the second input is a space separated single line input string.Sample Input 1 Explanation:Ex. 30 (1 30)Ex. 1 (17301106)(Use 1st digit of your bracu student id)Ex. 60 (17301106)(Use last 2 digits of your bracu student id in reverse)Ex. 3 (17301106)(Use semester code-3rd digit of your bracu student id)Ex. 1 (130)Sample Output 1:# Number of turns for the attacker agent[Assume that both of them will get equal number ofchances]# Initial lifeline (HP) for the defender at initial stateof the game# Number of bullets from which the final choice hasto be made by the attacker.# Minimum value for the range of negative HPvalues# Maximum value for the range of negative HPvalues1. Depth and Branches ratio is 2:32. Terminal States (leaf node values) are 19,22,9,2,26,16,16,27,16.3. Left life (HP) of the defender after maximum damage caused by the attacker is 444. After Alpha-Beta Pruning Leaf Node Comparisons 7 MAXΜΙΝSample Output 1 Explanation:Hint:- Level 0Leaf Nodes - Level 2- Level 1Note:(Application of Alpha-Beta Pruning Algorithm)Attacker's Turn / Initial StartDefender's TurnTerminal stateMAX utility/Best Choice3 branches(Left lifeline/HP)Left Life (60 - 16) = 44So, Left life(HP) of the defender after maximum damage caused by the attacker is 443^2=9 Leaf Nodes(Random States)[19, 22, 9, 2, 26, 16, 16, 27, 16]1. Apply Alpha-Beta Pruning algorithm for sample output line 3 and line 42. Formula: Left life HP-Initial life HP-MAX negative HPTerminal nodes are randomly generated values within the given range of negative HP (sample output line 2).

Question

Accepted Answer

You can use code like this for a fighting game import randomclass Fight(object):  def enter(self):…