Optimal game strategy-1

[dhairya16 (Dhairya Savlekar)]

piyush picks 4, then nimit picks 1, then piyush can pick 3
so piyush will have value 7
then why in sample test case 6 given?

[O17LPOLA020023 (Abhijeet Jha)]

hi @dhairya16 , here both player will play optimally(Playing optimally means that both players will have insight into all possible next moves and will play in such a way to maximize their chance of winning without making a mistake.) so nimit will choose the coin that will result in less value left for piyush .

so coming to the giving example it means he has choice to choose between 1 and 3 so out of which he will choose the option which is good for him .
if he had chosen 1 then piyush would have 7 with him that’s why he choose 3 thus piyush getting 6 coins

In case of any doubt feel free to ask
mark your doubt as resolved If you got the answer

[dhairya16 (Dhairya Savlekar)]

How to solve using recursion?
Don’t know any approach

[O17LPOLA020023 (Abhijeet Jha)]

Hi @dhairya16, you can refer to this explaination i have provided the code with explanation

Optimal Game Strategy-1

@saarthakrox29,you are thinking of greedy approach i.e. taking the bigger of two, there might be some cases when this approach fails eg imagine this is nimit turn and the coins present are [5 4 8 6 ] then according to your code nimit will choose 6 as 6>5 and piyush will be left with [5 4 8] thus he can choose 8 , now if nimit would have chosen 5 then piyush would be left of [4 8 6] thus piyush have option of 4 and 6 . thus we can see that nimit is better of choosing 5 so , what can be the app…