Beefy Boxes and Bandwidth Generously Provided by pair Networks Bob
Just another Perl shrine
 
PerlMonks  

Re^2: recursive formula.

by BioGeek (Hermit)
on Aug 05, 2004 at 10:48 UTC ( [id://380270]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to Re: recursive formula.
in thread recursive formula.

the r-values are scores, and P is a probability:
so P(r1) is the chance of having score r1,
P(r1,r2) is the chance of both having score r1 and score r2,
and so on.

Replies are listed 'Best First'.
Re^3: recursive formula.
by rsteinke (Scribe) on Aug 05, 2004 at 10:54 UTC

    Ah, so P() is 1 (the probablity of having anything happen).

    Ok, you'd have to ammend my code with

    return 1 if !@_:
    at the top or something

    Ron Steinke rsteinke@w-link.net
Re^3: recursive formula.
by trammell (Priest) on Aug 05, 2004 at 10:57 UTC
    So is it the case that:
    P(r1) = (r1 - r0) P() = r1
    Correct?
      Yes, that's correct

      Or, like rsteinke explained it much better than I can in the chatterbox:
      "If P(r_1) is the probability of getting r_1, and P(r_1,r_2) is the probability of getting r_1 and r_2, then P() is the probability of anything at all happening (unconstrained), which is 1"

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://380270]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.