So in this DP problem, what is mean by f(i,j)?
Optimal Game Strategy Concept Doubt
What I was asking that what is f(i,j) mean in this recurrence relation according to this problem where,
f(i,j)=max( a[i]+min(f(i+2,j),f(i+1,j-1)) , a[j]+min(f(i,j-2),f(i+1,j-1)) )
Like what is f(1,2)?
Is it mean that player 1 will take first coin and player 2 will take second coin?
we have already discussed this, check ur dm history
You mean, in chain matrix multiplication thread?
no,u have asked this question before as well ,in dm
Haan Bhaiya, you’re right. 16th March 2020.