You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Place obstacles on (2, 12), (2, 13) and (2,16), then place obstacles on (3, 21) and (4, 28).
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.
Find a path between (13, 2) and (12, 15) using Best-first search algorithm and Chebyshev distance.
The text was updated successfully, but these errors were encountered:
Add the following optional parameters to the query string that can pre-select the algorithm and heuristic functions.
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:
The text was updated successfully, but these errors were encountered: