zzlk
Joined 3 years ago
Joined 3 years ago
see: https://en.wikipedia.org/wiki/Linear_no-threshold_model
Vegas has a lot to offer and the strip really dominates the perception of it which is unfortunate.
> # ps. By design, this website is as usable as YAML.
It's intentionally bad.
The same is true for me, so I think here is a good place to plug my starcraft custom map archive website [0]. In 2020 because of the pandemic StarCraft enjoyed a surge of popularity again, I went looking for some custom maps that I remembered from the early 2000s but I couldn't find them. The existing websites at the time were not solving the problem for me so I set out to solve it myself. The website is a passion project for me, I don't want it to generate any revenue. It's been a fun ride and it's now easily the largest map archive that has ever existed. I think eventually I'll make a show HN post about it when I implement a few more cool features, but that will have to be for a later date.
I can't prove it but I think this is roughly the same thing as the circuit satisfiability problem, which is np-complete. So, I think the best thing you can do there is a very large exponential time bound.
b) use a deterministic procedure to find a solution
You can solve this problem deterministically with depth first search. But I found that to be pretty slow and generate not very aesthetically interesting results most of the time.