Find the shortest path between two cities
flowchart LR
PT((PT)) --> |6| ES
PT --> |12| FR
PT --> |21| GB
ES((ES)) -->|18| DE
ES --> |9| FR
FR((FR)) -->|7| DE
FR --> |24| IT
FR --> |8| GB
GB((GB)) --> |12| DE
GB((GB)) --> |7| NL((NL))
IT((IT)) --> |13| DE
IT --> |26| FI((FI))
DE((DE)) --> |19| FI
DE --> |6| NL
style PT stroke:#0AF,stroke-width:2px;
style FI stroke:#FA0,stroke-width:2px;
Heuristic h(n)
| Origem | Cidade | h(n) |
|---|---|---|
| PT | Portugal | 27 |
| ES | Espanha | 19 |
| FR | França | 25 |
| GB | Reino Unido | 10 |
| NL | Holanda | 26 |
| DE | Alemanha | 19 |
| IT | Itália | 23 |
| FI | Finlândia | 0 |
Find the shortest path in a maze
- Movement custs:
100for orthogonal movement (⬅️ ➡️ ⬆️ ⬇️)141for diagonal movement (↖️ ↗️ ↘️ ↙️ )
- Heuristic
h(n)is the manhattan distance to the goal