Request a New Nada Example: Matrix pathfinder / A-star
Description
Write an A-star pathfinding algorithm to find the shortest path between two secret points in a matrix.
Use Case
Games, maps, location based privacy
Specific Requirements
- Inputs: grid, point A from Party A, point B from Party B
- Outputs: distance between point A and point B
- Document your solution and any helpers created
Request a New Nada Example: Matrix pathfinder / A-star
Description
Write an A-star pathfinding algorithm to find the shortest path between two secret points in a matrix.
Use Case
Games, maps, location based privacy
Specific Requirements