summaryrefslogtreecommitdiff
path: root/pathfinding.py
AgeCommit message (Collapse)Author
2015-09-22works a bit... sometimes...Florian Jung
2015-09-04draw gridFlorian Jung
2015-09-04optimize distance functionFlorian Jung
2015-09-04speed up build_graphFlorian Jung
2015-09-04replace openset/closedset by member variablesFlorian Jung
2015-09-04astar with heapsFlorian Jung
2015-09-03slight buildgrid optimisationFlorian Jung
2015-09-03adjusted wormhole search distanceFlorian Jung
2015-09-03speed up wormhole searchFlorian Jung
2015-09-03works againFlorian Jung
2015-09-03Grid classFlorian Jung
2015-09-02better paths, i think. still sloooowFlorian Jung
2015-09-02prefer paths with food. clumsy and slow!Florian Jung
this is really hacky, clumsy and dead slow. find_near_wormholes() consumes waaay to much time (it's O(n^2)). but it's already a proof of concept :)
2015-09-01Merge branch 'master' into pathfindingFlorian Jung
2015-08-24WIPFlorian Jung
2015-08-21preallocate grid and treat it as an arrayFlorian Jung
2015-08-21refactorFlorian Jung
2015-08-218-connected graph instead of 4-connectedFlorian Jung
2015-08-19automatically recalculate path if it becomes blocked (slow!)Florian Jung
2015-08-18smoother path-followingFlorian Jung
2015-08-18s/manhattan/euclidic distance/gFlorian Jung
2015-08-18performance optimisation. lol :DFlorian Jung
2015-08-18refactoring, no changesFlorian Jung
2015-08-18follows path \o/Florian Jung
2015-08-18fine tuningFlorian Jung
2015-08-18pathfinding works \o/Florian Jung
it's still horribly slow (2 seconds calculation time), and atm it only weighs every cell with a really large cost (so it avoids basically everything). BUT HEY IT F***ING WORKS \o/