Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Fix bugs in A* implementation. #84

Merged
merged 2 commits into from
Feb 16, 2017
Merged

Fix bugs in A* implementation. #84

merged 2 commits into from
Feb 16, 2017

Commits on Apr 15, 2016

  1. Add a simple test to verify that the A* implementation is optimal.

    @austinhaas @tessellator
    austinhaas authored and tessellator committed Apr 15, 2016
    Configuration menu
    Copy the full SHA
    5d271e3 View commit details
    Browse the repository at this point in the history

  2. Fix bugs in A* implementation. 

    This commit fixes two small bugs in the A* implementation. The explored
values were not properly removed from successors to be expanded, so some
nodes were revisited during the search. Also, the heuristic function was
applied to the incorrect targets as pointed out in #82.

Fixes #82 and incorporates #81.
    @tessellator
    tessellator committed Apr 15, 2016
    Configuration menu
    Copy the full SHA
    c7e9eb2 View commit details
    Browse the repository at this point in the history