aaaaaa_@hyaniner https://darthmojo.wordpress.com/2008/12/26/radiosity-renders/ < sort of relevant "false radiosity" article with nice renders.
Hyaniner@aaaaaa_ I love BSG. I'm exhausted, so I'm wandering here and there on the web now, during that, I saw this again and remembered that I did not comment Ah. Beautiful. I love algorithms but searching blueprint graphs is heavy. divide and conquer... But I think I almost reached the goal... but it's hard...
@hyaniner hi, BSG is an enigma to me like deus ex ^^
Sounds like you have a performance target in mind! I think it's the clever way, performance first, design last! They say it's the road to heaven or hell (specify performance vs. specify design).
@aaaaaa_ What I'm doing is some kind of Induced subgraph isomorphism problem. When I approached this first, I soon knew that it demands lots of duplicated calculations with factorial. Of course, there are several optimized paths. But understanding that was not easy, but it seems almost done. - I mean, just understanding. Coding run is a different thing- But if I did understand, after that, It would be easy.
@hyaniner I plan to deal with "The Weapon-Target Assignment (WTA) problem aims to assign a set of weapons to a number of assets (targets), such that the expected value of survived targets is minimized. The WTA problem is a nonlinear combinatorial optimization problem known to be NP-hard." it's on "back burner " ("out of active development" )now but hoping to return, I used to be kinda good Brood War player in 33.6 modem era and endlessly fascinated by korean BW scene ofcourse ever since.
@aaaaaa_ Yes. It's sadly NP-hard. I want to make this NP-hard problem polynomial but I know it's not possible but I don't want to accept it! <- This is the root cause of my frustration and anger.
Anyway, I'd like to brag that I used a 1200 bps modem when I was young.
@hyaniner I have pure love for this example of korean ingenuity finding a way in Brood War amounting to solving a slice of WTA:
