zoukankan      html  css  js  c++  java
  • [Algorithm] Dynamic Programming

    Question 1. 

    Problem statement: Consider a row of n coins of values v1 . . . vn, where n is even. We play a game against an opponent by alternating turns. In each turn, a player selects either the first or last coin from the row, removes it from the row permanently, and receives the value of the coin. Determine the maximum possible amount of money we can definitely win if we move first.

    Solution from: http://www.geeksforgeeks.org/dynamic-programming-set-31-optimal-strategy-for-a-game/ by Aashish Barnwal. Accessed on 18th June, 2016.

    There are two choices:
    1. The user chooses the ith coin with value Vi: The opponent either chooses (i+1)th coin or jth coin. The opponent intends to choose the coin which leaves the user with minimum value.
    i.e. The user can collect the value Vi + min(F(i+2, j), F(i+1, j-1) )
    coinGame1

    2. The user chooses the jth coin with value Vj: The opponent either chooses ith coin or (j-1)th coin. The opponent intends to choose the coin which leaves the user with minimum value.
    i.e. The user can collect the value Vj + min(F(i+1, j-1), F(i, j-2) )
    coinGame2

    Following is recursive solution that is based on above two choices. We take the maximum of two choices.

    F(i, j)  represents the maximum value the user can collect from 
             i'th coin to j'th coin.
    
        F(i, j)  = Max(Vi + min(F(i+2, j), F(i+1, j-1) ), 
                       Vj + min(F(i+1, j-1), F(i, j-2) )) 
    Base Cases
        F(i, j)  = Vi           If j == i
        F(i, j)  = max(Vi, Vj)  If j == i+1

    Notes: 'minimisation' occurs because everyone wants to minmimise the opponent's total coin value. So you shall suppose that your opponent always takes a strategy that can minimise your total value of coins and then maximise his total value of coins, when it's your turn to choose the next coin form either the head or the tail of the list.

  • 相关阅读:
    《游戏引擎架构》笔记十二
    《游戏引擎架构》笔记十一
    《游戏引擎架构》笔记十
    《游戏引擎架构》笔记九
    《游戏引擎架构》笔记八
    《游戏引擎架构》笔记七
    2000行代码实现软渲染引擎
    C++ 构造函数或析构函数调用虚函数
    C++ protected访问权限思考
    堆排序
  • 原文地址:https://www.cnblogs.com/skyssky/p/5595966.html
Copyright © 2011-2022 走看看