Skip to content

v0.2.0

Choose a tag to compare

View all tags
@tbvanderwoude tbvanderwoude released this 30 Jul 15:19
· 49 commits to main since this release
v0.2.0
48bb6c9

What's Changed

  • Added support for restricting diagonals (#3), making it possible to find paths on grids with and without diagonal neighbors. This can be done by appropriately setting the allow_diagonal_move field of PathingGrid. By default, allow_diagonal_move = true
  • Added improved pruning rules toggle using improved_pruning
  • Set the heuristic scaling factor to a default of 1.0 instead of 1.2. This means that by default solutions are now optimal. The value can be changed by setting heuristic_factor for faster and sub-optimal search
  • Corrected node costs of the neighborhood of a pruned node when using improved pruning, which gave sub-optimal solutions before (#2, #5)
  • Rewrote jumping logic to be iterative instead of recursive, increasing performance and avoiding the recursion limit and potential stack overflows on large maps
  • Switched to fxhash hashing in the basic A* routine, making hashing faster

Full Changelog: v0.1.2...v0.2.0

Assets 2
Loading