Tag: greedy best first search
-
Pathfinder Performance Test

This post will compare the performance of the four pathfinding algorithms we coded in previous tutorials. We will look at each algorithm and find out which one is the fastest, which one generates the best path and which one explores the least nodes.
-
Pathfinding Tutorial: Greedy Best First Search

Learn how to explore a hexagonal grid and find a goal point with greedy best first search in this pathfinding tutorial. You will use Processing and Java to code the greedy best first search pathfinding algorithm and create a graphical demo so you can see it in action.
