[Ohrrpgce] SVN: james/8798 Pathfinding now breaks ties with distance squared

[James Paige]

On Friday, June 2, 2017, Ralph Versteegen <teeemcee at gmail.com> wrote:

>
>
> On 3 June 2017 at 07:02, <subversion at hamsterrepublic.com
> <javascript:_e(%7B%7D,'cvml','subversion at hamsterrepublic.com');>> wrote:
>
>> james
>> 2017-06-02 12:02:15 -0700 (Fri, 02 Jun 2017)
>> 50
>> Pathfinding now breaks ties with distance squared
>> ---
>> U   wip/pathfinding.bas
>> U   wip/pathfinding.bi
>
>
> You didn't notice that I added v_heappush and v_heappop?
>
>
I noticed, but wasn't sure what to do with them.


> Also, I didn't notice before that your cost_before_node function is
> insane. You need to store the cost of the node in the node, not recompute
> it constantly. That is why pathfinding is so incredibly slow.
>

Oh, yes! You are right. The A* reference article I was working from even
told me to do that, but I totally forgot. Thanks!

You know, I'll bet I had the same problem in my python A* implementation
for Bob the Hamster Dirt Dig. That sounds like exactly the sort of thing I
would do twice ;)

---
James
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.motherhamster.org/pipermail/ohrrpgce-motherhamster.org/attachments/20170602/f1e910d3/attachment.htm>