| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2015-09-01 | Merge branch 'master' into pathfinding | Florian Jung | |
| 2015-08-24 | WIP | Florian Jung | |
| 2015-08-21 | preallocate grid and treat it as an array | Florian Jung | |
| 2015-08-21 | refactor | Florian Jung | |
| 2015-08-21 | 8-connected graph instead of 4-connected | Florian Jung | |
| 2015-08-19 | automatically recalculate path if it becomes blocked (slow!) | Florian Jung | |
| 2015-08-18 | smoother path-following | Florian Jung | |
| 2015-08-18 | s/manhattan/euclidic distance/g | Florian Jung | |
| 2015-08-18 | performance optimisation. lol :D | Florian Jung | |
| 2015-08-18 | refactoring, no changes | Florian Jung | |
| 2015-08-18 | follows path \o/ | Florian Jung | |
| 2015-08-18 | fine tuning | Florian Jung | |
| 2015-08-18 | pathfinding 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/ | |||
 |
index : agario-bot | |
| A bot playing agar.io | flo |
| summaryrefslogtreecommitdiff |
path: root/pathfinding.py