Problem 470
Super Ramvok
Consider a single game of Ramvok:
Let t represent the maximum number of turns the game lasts. If t = 0, then the game ends immediately. Otherwise, on each turn i, the player rolls a die. After rolling, if i < t the player can either stop the game and receive a prize equal to the value of the current roll, or discard the roll and try again next turn. If i = t, then the roll cannot be discarded and the prize must be accepted. Before the game begins, t is chosen by the player, who must then pay an up-front cost ct for some constant c. For c = 0, t can be chosen to be infinite (with an up-front cost of 0). Let R(d, c) be the expected profit (i.e. net gain) that the player receives from a single game of optimally-played Ramvok, given a fair d-sided die and cost constant c. For example, R(4, 0.2) = 2.65. Assume that the player has sufficient funds for paying any/all up-front costs.
Now consider a game of Super Ramvok:
In Super Ramvok, the game of Ramvok is played repeatedly, but with a slight modification. After each game, the die is altered. The alteration process is as follows: The die is rolled once, and if the resulting face has its pips visible, then that face is altered to be blank instead. If the face is already blank, then it is changed back to its original value. After the alteration is made, another game of Ramvok can begin (and during such a game, at each turn, the die is rolled until a face with a value on it appears). The player knows which faces are blank and which are not at all times. The game of Super Ramvok ends once all faces of the die are blank.
Let S(d, c) be the expected profit that the player receives from an optimally-played game of Super Ramvok, given a fair d-sided die to start (with all sides visible), and cost constant c. For example, S(6, 1) = 208.3.
Let F(n) = ∑4≤d≤n ∑0≤c≤n S(d, c).
Calculate F(20), rounded to the nearest integer.
超级Ramvok
Ramvok是这样一个游戏：
t表示这个游戏最多进行的轮数，如果t = 0，那么游戏立刻停止。如果游戏没有停止，在第i轮时，玩家需要掷一个骰子，当i < t时，玩家要么停止游戏并获得当前掷出的点数，要么放弃点数进入下一轮；当i = t时，玩家将不能放弃点数。游戏进行的轮数t由玩家在游戏开始前选定，并且玩家必须为此付出ct，其中c是某个给定的常数。如果c = 0，那么t可以选择为无穷，此时付出视为0。对于一个公平的d面骰子以及给定的常数c，记R(d, c)是玩家在Ramvok游戏中始终选择最优策略时的期望收益，例如R(4, 0.2) = 2.65。假定玩家有足够的钱来付出进行游戏的开销ct。
现在我们再来看另一个游戏，超级Ramvok：
在超级Ramvok游戏中，玩家要重复的玩Ramvok，但在每次Ramvok结束后，骰子会被做如下的改动：再掷出一次骰子，如果朝上的面仍然有点数，那就把这个点数改成空白；如果这个面已经是空白了，那就恢复其原来的点数。改动之后，游戏继续（注意在游戏中，玩家如果掷出空白的面将可以接着掷，直至朝上的面有点数为止）。玩家始终知道哪些面上有点数，而哪些面是空白。当所有的面都是空白的时候，超级Ramvok游戏结束。
对于一个公平的d面骰子以及给定的常数c，记S(d, c)是玩家在超级Ramvok游戏中始终选择最优策略时的期望收益，例如S(6, 1) = 208.3。
记F(n) = ∑4≤d≤n ∑0≤c≤n S(d, c)。
求F(20)并四舍五入到整数。