Talk:Randomness
From Maze
(Difference between revisions)
(→The broken RND implementation) | (→The broken RND implementation) | ||
| Line 164: | Line 164: | ||
In the case of 10 PRINT, this means that, with 25x40=1000 characters making up a page, most random seeds will fall into a cycle of just 13 printed pages appearing in endless repetition. This "repetition" is complicated slightly by the fact that the cycle "starts over" mid-line. The result is a form of partial repetition -- the same alignment of maze walls scroll by, but shifted along the x axis so as to appear partially wrapped across the screen. [NEED TO TEST THIS, possibly screen cap it.] | In the case of 10 PRINT, this means that, with 25x40=1000 characters making up a page, most random seeds will fall into a cycle of just 13 printed pages appearing in endless repetition. This "repetition" is complicated slightly by the fact that the cycle "starts over" mid-line. The result is a form of partial repetition -- the same alignment of maze walls scroll by, but shifted along the x axis so as to appear partially wrapped across the screen. [NEED TO TEST THIS, possibly screen cap it.] | ||
| − | <blockquote>Afflerbach, Lothar. Algorithms: The pseudo-random number generators iCommodore and Apple microcomputers. Statistische Hefte (Statistical Papers) 26, 321-333. Springer-Verlag, 1985. | + | <blockquote>Afflerbach, Lothar. Algorithms: The pseudo-random number generators iCommodore and Apple microcomputers. Statistische Hefte (Statistical Papers) 26, 321-333. Springer-Verlag, 1985.</blockquote> |
| − | [In 1995, by contrast, Bowman finds the C64 BASIC RND output to perform at least as well as much more contemporary professional implementations such as Mathematica -- although I'm not sure if this is based on some different (much later) implementation of Commodore BASIC, or if the paper is not competent.] | + | <blockquote>Bowman, Richard L. "Evaluating Pseudo-Random Number Generators." Comput. & Graphics, Vol. 19, No. 2, pp. 315-324, 1995. [In 1995, by contrast, Bowman finds the C64 BASIC RND output to perform at least as well as much more contemporary professional implementations such as Mathematica -- although I'm not sure if this is based on some different (much later) implementation of Commodore BASIC, or if the paper is not competent.] |
| − | + | </blockquote> | |
| − | Bowman, Richard L. "Evaluating Pseudo-Random Number Generators." Comput. & Graphics, Vol. 19, No. 2, pp. 315-324, 1995</blockquote> | ||
--[[User:JeremyDouglass|JeremyDouglass]] 07:01, 12 July 2011 (UTC) | --[[User:JeremyDouglass|JeremyDouglass]] 07:01, 12 July 2011 (UTC) | ||
