Recurrence Relation

#1

I solved the question Optimal Game strategy. Can anyone tell me the recurrence of this question

#2

hello @rishabh_garg1,
hint -> this problem is modified version of knapsack.

dp[i][j] = dp[i][j] || ! (dp[i-1][j-v[i] ] )

dp[i][j] = true if taro can win when only first i elements is considered and total j stones are there otherwise false.