Talk:Village/@comment-24386245-20141026134750/@comment-24211244-20141202004214

I did an implementation of the [Wikipedia: Best-first search] algorithm. Takes about half a second. Meh. If we got to do this for both a house and shop, it would take a little less than a second each time. Good news: if Village would use [Wikipedia: Pythagorean Theorem] first, then it would take no time at all when planting far from a house, about half a second when near a house, and a second when planting near two houses.