PLEASE BE QUICK SIR 30min deadline want to be sure of my answer.

In each stage, one of the different options will be selected and A of every final situation that can be chosen from the perspective of the player shows the score. At the stage with the MAX mark, the player ultimately for himself the option to reach the highest score, in the stage with the MIN mark, the opponent the player tries to make sure that the other side reaches the lowest score. For example, if the state comes to N after 3 moves, the first move (MAX)

the player who makes it will reach 10 points, on the contrary, if T-state comes after 3 moves The player who makes the first move will have 1 point. Using the Alpha-Beta method, With the "MiniMax Algorithm", you can increase the Alpha and Beta values at every stage of the game. stating which movement the player at point A made what Find that going to the point would be optimal for him.

MAX MIN E H [51 K M MAX [1] [3] 1241 N S MIN Q 151 R [6] V103 [3] [11 MAX MIN E H [51 K M MAX [1] [3] 1241 N S MIN Q 151 R [6] V103 [3] [11