Unity
AStar 2D Tile Based Pathfinding
$10
Rated 4.0/5 from 20 ratings on Unity.
Price history
Recorded standalone sale prices and the latest available store price, in USD. Historical dots use the sale start date and its recorded offer price. Prices can change during a sale; this is not a daily price log. Bundle prices and upcoming offers are excluded. History covers up to the 100 most recent recorded offers.
Lowest recorded standalone price in this history: $10. The latest store price is $10, matching the lowest recorded price shown here.
View 1 recorded price
| Sale start / price check | Price | Observation |
|---|---|---|
| $10 | Latest store price |
About AStar 2D Tile Based Pathfinding
AStar 2D is a complete pathfinding solution for 2D tile or grid based Unity games. It is ideally suited to top down tile based games and tower defense games but can easily be adapted to work in other scenarios.
Features
- Quick and easy setup / integration into existing projects
- Includes easily expandable agent class for path following
- Support for dynamic obstacles using 2D colliders
- Supports node weightings to influence paths based on a penalty value
- Dynamic route updates for changing environments
- Supports any number of search grids
- Assign different grids to different agents to reduce the search space
- Enable / disable diagonal movements in the click of a mouse
- Offload the expensive pathfinding calculations to separate threads to maintain maximum performance (All done behind the scenes, works out of the box)
- Includes visualization tools to help with debugging and analyzing performance
- Includes example scenes and stress tests
- All scripts use custom namespaces to prevent clashing type names
- Comprehensive .chm documentation of the API for quick and easy reference
- Fully commented C# source code included
Features
- Quick and easy setup / integration into existing projects
- Includes easily expandable agent class for path following
- Support for dynamic obstacles using 2D colliders
- Supports node weightings to influence paths based on a penalty value
- Dynamic route updates for changing environments
- Supports any number of search grids
- Assign different grids to different agents to reduce the search space
- Enable / disable diagonal movements in the click of a mouse
- Offload the expensive pathfinding calculations to separate threads to maintain maximum performance (All done behind the scenes, works out of the box)
- Includes visualization tools to help with debugging and analyzing performance
- Includes example scenes and stress tests
- All scripts use custom namespaces to prevent clashing type names
- Comprehensive .chm documentation of the API for quick and easy reference
- Fully commented C# source code included