(A shoots C) = 1, it follows that
> P(A survives) = 0.67 * P(A shoots B) + 0.5 * [1 - P(A shoots B)]
> = 0.17 * P(A shoots B) + 0.5.
> Therefore, P(A survives) is maximized when P(A shoots B) = 1 and P(A
> shoots C) = 0.
>
> Dave
>
> On Jan 2, 11:07 pm, Salil Joshi wrote:
the odds that he will be shot by A.
>
> Thus, shooting at either A or B decreases his odds of survival.
>
> Dave
>
> On Jan 2, 12:25 pm, Salil Joshi wrote:
> > @Dave
> > 1. In the end only 1 will survive (after max of 2 rounds).
> > i.e. P(A survives in end) + P
So your P(B shooting at C) = 0 if A is unhit when it is B's
> turn.
>
> If you dispute either of the above two paragraphs, please clealy state
> your objection.
>
> Dave
>
> On Jan 1, 11:19 pm, Salil Joshi wrote:
> > @Dave,
> > Yeah, I had read those numbe
lly shoots in the air, C's probability of survival is ~
> 0.49624.
>
> Dave
>
> On Jan 1, 11:30 am, Salil Joshi wrote:
> > @Rahul,
> > As per my understanding,
> > In any round P(C is dead) = P(A is alive * A shoots C * A's shot is
> > accurate) + P(B is a
1, 2011 at 10:43 PM, Salil Joshi wrote:
> @Rahul,
> What purpose is served by wasting the shot? If C shoots at A or B, at least
> some probability that C is dead in future will be reduced.
>
>
>
> On Sat, Jan 1, 2011 at 10:14 PM, RAHUL KUJUR wrote:
>
>> @snehal:
>&
...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Thanks & Regards
Salil Joshi.
CSE MTech II, IITB
A-414, Ho
ot;Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
&g
> loopholes.
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
>
subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http:
To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
--
Thanks &
@Ashim,
Dunno... you can call it Salil's Puzzle if you like ;-)
afaik. its been listed in KT book Randomized algorithms chapter.
On Mon, Nov 22, 2010 at 3:36 PM, Ashim Kapoor wrote:
> what is the name of this famous puzzle ?
>
> On Mon, Nov 22, 2010 at 2:57 PM, Salil Joshi
f n can be
approximated to log (n).
Hence the answer.
On Mon, Nov 22, 2010 at 3:54 PM, shiva wrote:
>
> Any explanation of how it works and how you got log(69) as answer.
>
> Thanks in advance.
>
>
> On Nov 22, 2:27 pm, Salil Joshi wrote:
> > Hi,
> > The puzzle
Hi,
The puzzle needs to be rephrased as:
"If the rank of the student who comes out of the classroom is better
than ranks of all students who came out before him/her, then he/she
gets a lollipop".
Rephrased this way, this is a famous puzzle, and the answer is
log(69).
On Nov 22, 12:44 pm, shiva
13 matches
Mail list logo
