News for hackers. Stuff that matters.
Re:NetHack beaten in 7 minutes 15 seconds real time by zawerf on Friday January 11, 2019 @02:56AM (#18881702)
Do you have a source on this?

I was under the impression that machine learning is only good at learning things that can be approximated by continuous functions.

A RNG is almost the complete opposite of that. It's everywhere discontinuous!

Re:NetHack beaten in 7 minutes 15 seconds real time by dklsafhjskljfl on Friday January 11, 2019 @03:08AM (#18881735)
Old games put the P in PRNG. Often, the technical limitations caused them to very roughly approximate randomness, for example a function that used the last n button presses plus the countdown timer as a seed. If your game has to run in under a kilobyte of memory, that n value might be a byte, or less (such as four bits, 2^4)

Some games were worse, far worse. Doom used a list of 256 random numbers that it looped through.

Pokemon is another game where the RNG function is extensively mapped, and even used in combination with bugs to generate Mew events, something that should never ever happen.

You see a lot of TAS of old games, especially popular ones, that abuse the RNG generator where feasible.

Re:NetHack beaten in 7 minutes 15 seconds real time by simonh on Friday January 11, 2019 @03:08AM (#18881736)
If the result from the RNG is not actually perfectly random, and is actually partially determined by e.g. controller input, then even if the function is discontinuous there may be a continuous function that approximates it closely enough to be useful.
Re:NetHack beaten in 7 minutes 15 seconds real time by dharmab on Friday January 11, 2019 @09:06AM (#18883621)
Old games have such predictable RNG that humans can manipulate them in non-TAS runs. See the run for Final Fantasy 1 for a good example.