I think it’s important to point out that it’s NP hard, because if you don’t know that, who’s to say that some efficient, exact algorithm does not exist? Given that because the problem is NP hard, no fast and exact…
> Is it possible that the algorithm will fail to find a suitable tile and needs to restart? Yes, the algorithm can fail. Since it considers only local areas when making decisions, it can easily make a placement that…
Thanks! I think I fixed it. Waiting on DNS.
Author here. It's awesome to see my post on hn! Happy to answer questions.
I think it’s important to point out that it’s NP hard, because if you don’t know that, who’s to say that some efficient, exact algorithm does not exist? Given that because the problem is NP hard, no fast and exact…
> Is it possible that the algorithm will fail to find a suitable tile and needs to restart? Yes, the algorithm can fail. Since it considers only local areas when making decisions, it can easily make a placement that…
Thanks! I think I fixed it. Waiting on DNS.
Author here. It's awesome to see my post on hn! Happy to answer questions.