sorry, it should be "in the end, Y is equal to Z", thank you! On Sat, Nov 27, 2010 at 6:02 PM, fenghuang <fenghaungyuyi...@gmail.com>wrote:
> 1) it is 12. > > it's a game, a game of Game Theory. > > assum both A(lok) and B(hanu) are very clever, when A chooses which > variable to be substituted, he must maximize his payoff. and B know this > fact, so they must choice a number, which must minimize > A's maximum payoff, so in the end, X is equal to Y. then the answer is 12. > > the same to other questions > > On Sat, Nov 27, 2010 at 5:38 PM, srinivas reddy > <srinivaseev...@gmail.com>wrote: > >> @youngboy >> >> you have to choose one value for variable only >> this is un specified condition otherwise the problem will become silly >> problem >> >> >> On Sat, Nov 27, 2010 at 2:09 PM, youngboy <vamsiachy...@gmail.com> wrote: >> >>> some one cracked answer for N=X-Y-Z As 2 and they given explination as >>> follow >>> exp: >>> • 0-9 digits.... The basic idea is to get maximum value.... so if >>> alok >>> chooses anything more than or equal to 3 then he going to end up only >>> with a maximum of 1... example if he takes 3 and banu will choose >>> either y or z coz if she chooses ...x then alok will suggest remaining >>> values as 0 and 0... now for the second try he has to choose a value >>> more than 3 or else bhanu will choose that value for x and N will >>> become negative at the end.... if he chooses 4 then banu will assign >>> it to x thus keeping the value of X to 1.. and if chooses 5 then she >>> ll assign it z.. Thus value is kept to maximum of 1.... >>> Now lets say alok chooses 2.... banu will try to put it to y or z.... >>> now alok chooses 4.. then she ll choose it for x.. thus keeping the >>> value of N to 2.. if alok chooses 5 on second try then she ll assign >>> for z thus again keeping the value down to 2..... >>> >>> So only 2 can be Achieved as maximum value for N if they both play >>> optimally..... >>> • >>> >>> >>> On 27 Nov, 13:30, youngboy <vamsiachy...@gmail.com> wrote: >>> > 1) Alok and Bhanu play the following min-max game. Given the >>> > expression, >>> > >>> > N = 12 + 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. Towards this end, >>> > Alok chooses >>> > a single digit number and Bhanu substitutes this for a variable of her >>> > choice (X, Y or >>> > Z). Alok then chooses the next value and Bhanu, the variable to >>> > substitute the value. >>> > Finally Alok proposes the value for the remaining variable. Assuming >>> > both play to their >>> > optimal strategies, the value of N at the end of the game would be >>> > >>> > a)12 >>> > b)30 >>> > c)93 >>> > d)-69 >>> > >>> > 2) same question N=X-Y-Z >>> > >>> > 3)same question N=N = 38 + X*(Y – Z) >>> > >>> > plz provide me clear explination >>> >>> -- >>> You received this message because you are subscribed to the Google Groups >>> "Algorithm Geeks" group. >>> To post to this group, send email to algoge...@googlegroups.com. >>> To unsubscribe from this group, send email to >>> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >>> . >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >>> >> >> >> -- >> www.tcyonline.com >> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algoge...@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.