3 ms·
I find that random-not-random implementation pretty incredible.
by isaacimagine 6y ago
I find that random-not-random implementation pretty incredible.
- LanceH 6y agoThanks. It seems kind of obvious compared to the Euler method, though. Once you realize it's 4 bits across a cycle of 15, it's just just a matter of finding the right seed. It should be on the order of 1 in a billion, which is no big deal. In hindsight, if I had combined my number theory knowledge I might have been able to accomplish the Euler solution, but I didn't, so hats off to them. The presentation of the tensorflow provides more a much higher contempt for the question than I've achieved as well. The fact it isn't 100% accurate, but can be trained to be accurate to a certain level, just makes it better. I will redouble my research efforts on this or some other problem which doesn't need solving.