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

[Fernando del Rey]

Thanks Valentin, as always, nice and interesting challenge!

I have written a still very raw little program for the plain vanilla 71B (about 25 lines of code), which is giving me the following result for the case of a 30-row grid and after 60 steps.

9.55109846817E-6

As the number of arithmetic operations (divisions and sums) is quite large, I fear that rounding errors may have crept up enough to significantly affect the result.

Using Emu71/Win in my PC, execution time is about 6 seconds for the 30-rowns/60-steps case. I have not yet tried it in the real 71, but I’m afraid execution time may be too long to be practical. I’ll give it a try next.

I do have an idea how to improve the program for execution speed, but for the 30/60 case at hand the reduction in execution time would be about 25% only. Not a great deal.

Before posting my code or going further, please let me know if the result I am obtaining is not too far away from the correct figure.

Thanks again for your efforts to keep us all entertained!