cuda-the-spire VS sts_seed_search

I found this seed primarily using StS CUDA code to sieve for seeds that get Neow's Lament on floor 1 and can buy Juzu Bracelet at the first shop because of the Sssserpent event while also avoiding event node combats. I accounted for unlock manipulation (changing the size of the common relic pool), along with details of the Java random number generator's shuffle method to increase the throughput of seeds.

GPU-accelerated seed searching for high-performance searches such as the first mathematically proven unwinnable seed, and

Depending on the player's path, the probability of hitting a shop or treasure is usually between 2% and 8%, and in this one, we get lucky 8 times in a row! We found this seed by running a GPU-accelerated search. The run also minimizes the number of rest sites visited, because they have a fixed-time animation that cannot be avoided. It is theoretically possible to get one more shop/treasure room instead of the 1st rest site, with enough luck. Perhaps some other day!

I agree that Neow options on floor 0 also make it extremely difficult to find an unwinnable seed with this criterion. If I dug deeper into the Jaw Worm AI, I could probably put together a GPU-accelerated sieve for candidate seeds in the CUDA code I've been playing with.

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