Solve Min-Max Game

max=18
min=9

max=27
min=9

  1 User has rated as useful.

  

Login to rate this answer.

max=27

Since Alok is choosing the numbers he chooses for the maximum sum.

  1 User has rated as useful.

  

Login to rate this answer.

Alok and Bhanu play the the following min-max game.Given the expression N=ARE VARIAB 19+X*(Y-Z),WHERE X,Y AND Z are variables representing single digits (0 to 9),Alok would like to maximize N while Bhanu would like to minimize it.towords this end,Alok choose a single digit number and Bhanu substitutes this for a variable of her choice(X,Y,Z).Alok then choose the next value and Bhanu, the variable to substitute the value .Finally Alok proposes the value for the remaining variables. Assuming both play to their optimal strategies ,the value of N at the end of the game would be

It is question of Artificial Intelligence, and solved by various modular steps. But the simplest logic for answering these type of questions is

If ((X) (operator)(expression))
then if(operator=="+")
then answer= X+11
if(operator=="-")
then answer= X+2
if(operator=="*")
then answer= X+18.

It is 100% sure answer because I am an IT student so AI is my subject plus I have cracked the TCS .

For these type of ques, remember dis thumb rule..
X*Y-Z=18
X+Y-Z=11
X-Y-Z=2

so
N = 9 + X + Y - Z
N= 9+11=20