> NP-Hard is NP-hard... "heuristics" in this case is just a euphemism for a fantasy cost-function to scam shareholders.
I don’t know why you’re trying to make this so hard.
The problem is NP hard whether I do it or a machine does it.
I can still do a good job despite being NP hard. I believe a machine with enough compute will be able to, too.
Copying millions of other peoples work for a similar looking result excludes the design compromises every engineer must make during the process.
LLM don't think because it is not real "AI", and simply conflates every isomorphic vector search proximity output.
Auto-routers have existed for decades, and they do work in the trivial design cases... but are almost always a liability where design choices matter.
Best of luck =3