Takes the one with the lowest sum of what was spent and what seems to be left (g + weight·h). With weight 1, the cheapest path while looking at fewer cells.
Going over something already painted with the same brush erases it.
Press Play to watch the search, or «To the end» for the result at once.
| Algorithm | Expanded | Steps | Cost |
|---|---|---|---|
| 103 | 18 | 18 | |
| 21 | 20 | 20 | |
| 103 | 18 | 18 | |
| 31 | 20 | 20 | |
| 62 | 18 | 18 |