Solve the Discrete Time Markov Chain
所在版块:求学狮城 发贴时间:2008-12-18 15:12

用户信息
复制本帖HTML代码
高亮: 今天贴 X 昨天贴 X 前天贴 X 
.
欢迎来到华新中文网,踊跃发帖是支持我们的最好方法!


You may say I'm a dreamer
but I'm not the only one...
 相关帖子 我要回复↙ ↗回到正文
有趣的网球输赢概率题 spinach   (168 bytes , 1092reads )
Solve the Discrete Time Markov Chain simon   (0 bytes , 478reads )
题目修改 spinach   (308 bytes , 289reads )
0.855967? hash   (119 bytes , 315reads )
应该是80%吧,一个小程序模拟进行10000000场比赛输出结果接近80% MetalGearSnake   (976 bytes , 410reads )
有没有办法把平局也放进去?? spinach   (186 bytes , 274reads )
每场比赛要有局数限制才会产生平局的情况吧? MetalGearSnake   (1321 bytes , 291reads )
if you know sth about stochastic, this is a stopping-time problem 1300cc   (102 bytes , 287reads )
试着写一般表达式,这样对吗? spinach   (79 bytes , 247reads )
what is the general formula for the stopping time? spinach   (214 bytes , 242reads )
yes. it's a typo in my first equation. should be -2 , not -1/2 1300cc   (15 bytes , 293reads )
it's in this way 1300cc   (67 bytes , 375reads )
for stopping-time problems, there are no "draw"? spinach   (0 bytes , 255reads )
no draw 1300cc   (192 bytes , 259reads )
我的答案跟大家一样4:1;可是好像不对 spinach   (521 bytes , 262reads )
如果不限制盘数的话,平局的概率为零 香陵居士   (0 bytes , 325reads )
考虑到状态稳定的时候 icky   (102 bytes , 291reads )
这个好 胡萝卜   (0 bytes , 243reads )
若不限制,甲80%,乙20%;若限制,自己算 冷色蓝天   (439 bytes , 294reads )
一场比赛多少盘?还是不限制盘数? 香陵居士   (0 bytes , 364reads )
不限盘数 spinach   (0 bytes , 268reads )
每胜一盘的[得]一分,另甲胜指甲胜整场比赛 spinach   (0 bytes , 211reads )