14 years, 8 months ago
Highlights
14 years, 8 months ago
Well, without a node link to (next to) the target point the portals wouldn't be portals at all Of course they have them. And the child node would have its heuristic show as…
14 years, 8 months ago
I find few things as infuriating as algorithms that are always explained in pseudocode and graphs, while there are quite intuitive real-world similes, allowing for a much easier…
14 years, 8 months ago
I'm looking for a way to smoothly present path improvement, starting from A* to a regular Dijkstra. I'm operating under an assumption that A* with its heuristics will fi…
14 years, 8 months ago
Hum. Minimum of goals or portals, you say... Now that's a thought. That actually answers a different question - "how to get a perfect path even when portals are involve…
14 years, 8 months ago
Latest Activity
See all in DiscussionsWell, without a node link to (next to) the target point the portals wouldn't be portals at all Of course …
14 years, 8 months ago
Hum. Minimum of goals or portals, you say... Now that's a thought. That actually answers a different question - "how …
14 years, 8 months ago
Um, actually, A* burns the silly hicks faster, even resorting to cheating
14 years, 8 months ago
Badges
Conversation Opener
Architect
Decade Member
5-Year Veteran
1-Year Veteran
First Steps
Spotlight
Jack-of-Trades
View all badges →