[VA] SRC #012a - Then and Now: Probability

[J-F Garnier]

(10-13-2022 09:44 PM)C.Ret Wrote:  

(10-13-2022 08:14 AM)J-F Garnier Wrote:  I updated my code above accordingly.

I get exactly the same value. But it's not surprising, even if our codes don't look alike, I actually do the calculation in the same direction as Jean-François.

It takes 5708.4 seconds (nearly 2 hours) to display the result using this compact code that is more readable by using line breaks and indents to show all nested loops:
[...]

Your code is remarkably compact, at the expense of lower speed due to the two inner loops to explore the neighbouring points.
Thanks for formatting your code in a legible way, multi-statement line codes are usually very hard to read!

Quote:Note the power of the HP-71B, while other systems do not have enough registers to memorize all the points of the triangle, the HP-71B allows, for simplicity, to use half of two matrices.
Moreover, I use a third W array to store the weights of each point. So much memory!

Yes, the BASIC language is really much conformable to use for these kinds of problems.

Quote:Besides, I discover with horror that my 1A version does not have an RSUM command or any other means of obtaining the sum of the probabilities of the last row in one instruction.

You may consider using the enhanced MATH 2B

J-F