...
首页> 外文期刊>Discrete Applied Mathematics >Recursive method to solve the problem of 'gambling with God
【24h】

Recursive method to solve the problem of 'gambling with God

机译:解决“与上帝赌博”问题的递归方法

获取原文
获取原文并翻译 | 示例
           

摘要

Suppose Alice gambles with God who is the dealer. There are n total rounds in the game and God can choose any m rounds to win and the other n-m rounds to lose. At first Alice has holdings a. In each round, Alice can increase her holdings by q times the amount she wagers if she wins. So what strategy should Alice take to ensure the maximum total holdings in the end? And how much is the total final holdings? It is called the "Gambling with God" problem. In this paper, a recursive method is proposed to solve the problem, which shows the extensive application of recursive methods.
机译:假设爱丽丝与交易商上帝一起赌博。游戏中总共有n轮,上帝可以选择任意m轮来赢,而其他n-m轮则输。最初,爱丽丝拥有一家。在每个回合中,如果获胜,爱丽丝可以将其投注额增加q倍。那么,爱丽丝应该采取什么策略来确保最终拥有最大的总持有量?最终的总持有量是多少?它被称为“与上帝赌博”问题。本文提出了一种递归方法来解决该问题,这表明了递归方法的广泛应用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号