Forget it. It's not at all practical. The seed value is an unsigned integer - which means a 32 bit number these days - so you have a possible 2^32 different array combinations you would need to "check back" to find: 4,294,967,296 possible values. And the main problem is that there are going to be a huge number of these that are the same - or at least start off the same - and you may need to get to a significant number of random number elements before you can eliminate some of them.

This is not a practical approach to anything. I know: I tried to use it as a "super compression" technique many, many years ago when I was just starting and eventually gave up when I realised just how long it was going to take to try and find a random number sequence that "generated" the byte stream I wanted to compress! :laugh:

16,001,931 members