Share Link

[rvhuang]

Add the following optional parameters to the query string that can pre-select the algorithm and heuristic functions.

• algorithm (the algorithm's short name in lower case)
• heuristic (the function's initial letter in lower case)
• path to find
• obstacles

Example:

https://pathfinding-lab.codedwith.fun/?o=2,[12,13,16];3,21;4,28&p=astar1,21-12,17m,e;bfs13,2-12,15c

This will perform the following works:

1. Place obstacles on (2, 12), (2, 13) and (2,16), then place obstacles on (3, 21) and (4, 28).
2. Find a path between (1, 21) and (12, 17) using A* as search algorithm and combining Manhattan distance and Euclidean distance as the heuristic function.
3. Find a path between (13, 2) and (12, 15) using Best-first search algorithm and Chebyshev distance.