Sat 30 Jan, 2016 02:14 pm - lets say N, Ww, Wb, Lw, Lb are respectively
1000000000
0.5 0.5
0.12345 0.56789
then what will be the prob that andrew win? (view)
Sat 30 Jan, 2016 02:07 pm - so, how can we generalize this answer? Can we have a general formula?
suppose rounds N is very large like 1,000,000,000 (view)
Sat 30 Jan, 2016 01:56 pm - Can you help to solve this problem?
Uh oh, the weather forecast predicts that a rainstorm will soon break out over the infinite, 1-dimensional number line you call home!
The forecast is... (view)
Sat 30 Jan, 2016 01:47 pm - because the wining a game depends on last round. so if there is 2 round then andrew will try to loose in first so that he can choose his move (white or black) in 2nd means last game. (view)
Sat 30 Jan, 2016 01:39 pm - so what do you think with what prob Andrew will win if the values of Ww, Wb, Lw, Lb are respectively 0.9 0.8
0.0 1.0 ? (view)
Sat 30 Jan, 2016 01:19 pm - Two chess grandmasters, Andrew and Jacob, are having an epic chess showdown to determine which of them is the uncontested best player in the world!
The showdown consists of N games. In each... (view)
