This post has been de-listed
It is no longer included in search results and normal feeds (front page, hot posts, subreddit posts, etc). It remains visible only via the author's post history.
So for example, you could reconstruct the entire array given an initial “seed” of four entries in a square. (By “pseudorandom” I mean having no obvious statistical correlation, and ideally the period would be fairly long.)
[Edit] Or to put it another way—you’d need four algorithms for generating new numbers while moving up, down, left, or right, such that the value generated for any cell is the same regardless of the path used to reach it.
Also, is there a way to generalize it to an n-dimensional array whose entries are determined by m adjacent entries?
Subreddit
Post Details
- Posted
- 9 years ago
- Reddit URL
- View post on reddit.com
- External URL
- reddit.com/r/algorithms/...