sts_seed_search VS Serious-Engine

I checked the maps for paths that avoid all unnecessary combats so that each map only encounters a combat at the start and bosses. Empirically, this occurs 1 in 833 runs on non-Ascension mode and 1 in 1100 in Ascension mode per map, so roughly 1 in a half billion seeds meets this constraint. I used the C++ StS seed search for this filter. For later searches, I'd like to port the map node assignment code to CUDA for better filtering, but it's hard to debug :'(

Gamerpuppy's project is MUCH MUCH faster than this but isn't built into the game, so check that out if you're interested in finding seeds in a different but faster way. ForgottenArbiter's project will find more specific paths to find a seed that you want and it will tell you the path you should take for your chosen criteria and you can be much more specific with your filters.

seed searching: a C++ codebase which has basically everything in the game implemented

How? (1) labbing out how bypass combats without spending stacks of Neow's Lament, (2) programming a specialized seed search based off of GamerPuppy's code, (3) routing and manipulating the RNG, (4) executing the route.

Not exactly a tool yet, but some code I wrote here https://github.com/gamerpuppy/sts_seed_search

Croteam released the source code for the classic Serious Sam games for their 10th anniversary. Annoyingly, none of the games use exactly the version from the source, but they're generally similar enough. There are two discoveries which have been made through it, both for coop.