working on a @styx-os.
 | ||
"accidentally-vengeful telco nerd"
—Tom Scott
platform sec researcher, OS dev, systems architect, composer; Other (please specify). vintage computer/electronics nut.
I am open to tag suggestions - if there is something you want me to tag on my posts, leave a comment. <3
that is, demonstrably handling every possible combination of inputs that has any effect in a game, perhaps with a formal solver or something, touching the entire possible state space of game states, while eliminating obvious and nonproductive loops like cyclic deaths or resets, thereby also having the most optimal possible 100%, any%, etc. run as well
I think some Atari 2600 games might be good targets for this.
Right, but not all game states are "reachable". It's not a matter of combinatorically writing 256 bytes worth of data, that's completely intractable. But a game like Activision Dragster for the 2600 has a much more restricted solution space (and, iirc, one that's been completely solved in order to disprove a cheater heh)
Sure, but you'd need an extremely simple program to show that all those states are reached too. Though the story of Dragster is definitely an interesting example here.
