algo

Some handy algorithms for use in games, etc.

please note that this file is alpha, and is subject to modification in future versions of pgu!

uses the a* algorithm to find a path

astar(start,end,layer,dist): return [list of positions]

start

start position

end

end position

layer

a grid where zero cells are open and non-zero cells are walls

dist

a distance function dist(a,b) - manhattan distance is used by default

returns a list of positions from start to end

returns a path of points from a to b

getline(a,b): return [list of points]

a

starting point

b

ending point

returns a list of points from a to b