This project shows pathfinding process based on grid.
In the F2 project, user can set heuristics, maps, weight through UI settings.
- Euclidean: sqrt(xDiff^2 + yDiff^2)
- Octile: min(xDiff,yDiff) * sqrt(2) + max(xDiff,yDiff) - min(xDiff,yDiff)
- Chevyshev: max(xDiff,yDiff)
- Manhattan: xDiff + yDiff
Used Catmull-Rom algorithm to smooth the nodes.
Find all the middle nodes that does not affect the path.
In the F3 project, user can check various analyzations used in grid terrain.
- Openness: Proximity to static obstacles
- Visibility: How many squares are visible
- Occupancy map: Probability of where the player is. Implemented with propagation algorithm.
Shows where agent have searched. Fades by time.
Red agent starts to look for the blu agent, showing its sight. Once the red agent finds the blue agent, it generates the propagation spot based on where the blue agent was last seen
You can download the executable file here
The project consists of 2 types of smaller projects. This can be switched by pressing F2, and F3.
All the controls are made with left mouse click. (Red agent can be controlled via right click in project F3)