What do you think is the set it and forget it best method?
To reverse engineer a random seed when the creator designed the puzzle at that specific moment, as far as I know, zahid888 made the most progress in that area. I gave up after puzzle 60 while searching for the seed.

Give us another example. I remember you used some byte seeds in the early stage. Cracking puzzle 50 in 2 seconds (I found this post at the back). How did you do that?

python3 evolving_seeds.py
--- Starting optimization iteration 1 with base prefix: b'yx\xcb\x08\xb70' ---
Evolving seeds: 100%|██████████████| 10000/10000 [00:32<00:00, 307.25it/s, gen=9999]
Updating base prefix to: b'}\xc9{Dl\x98'
--- Starting optimization iteration 2 with base prefix: b'}\xc9{Dl\x98' ---
Evolving seeds: 100%|██████████████| 10000/10000 [00:32<00:00, 306.55it/s, gen=9999]
Adding more randomness
--- Starting optimization iteration 3 with base prefix: b'}\xc9\xd9Dl\x98' ---
Evolving seeds: 100%|██████████████| 10000/10000 [00:32<00:00, 304.58it/s, gen=9999]
Updating base prefix to: b'}\xc9{Dl\x98'
--- Starting optimization iteration 4 with base prefix: b'}\xc9{Dl\x98' ---
Evolving seeds: 100%|██████████████| 10000/10000 [00:32<00:00, 305.02it/s, gen=9999]
Adding more randomness
--- Starting optimization iteration 5 with base prefix: b'}\xc9{Dl\x98' ---
Evolving seeds: 100%|██████████████| 10000/10000 [00:32<00:00, 305.53it/s, gen=9999]
Adding more randomness
--- Starting optimization iteration 6 with base prefix: b'}\xc9\x86Dl\x98' ---
Evolving seeds: 100%|██████████████| 10000/10000 [00:32<00:00, 304.90it/s, gen=9999]
Updating base prefix to: b'}\xc9{Dl\x98'
And so on until you get a full match....