贪婪最佳优先算法是宽度优先遍历和贪婪算法结合的产物，使用启发式函数选择当前最低代价的节点，改善了宽度优先遍历需要遍历地图的大量节点来找寻结果的缺点。

算法过程：

1.首先设置开始节点的启发函数值（h）为0，并将开始节点放入检测列表中。

2.将检测列表中的所有点按启发函数值（h）排序，选择h最小的节点作为当前节点，并将其检测列表清空。

3.计算当前点周围的八个点启发函数值（h），将不包含在检测列表中的点加入到检测列表。将已检测的点添加到已检测列表。

4.重复2，3直到找到目标点。

代码实现：

算法类：

public class GBFS : FindPathAlgorithm
{public GBFS(int[,] mapData, int xCount, int zCount) : base(mapData, xCount, zCount){}public override List<Vector2Int> FindPath(Vector2Int startPos, Vector2Int goalPos){List<Vector2Int> nodes = this.GBFSFind(startPos, goalPos);if (nodes == null){Debug.LogError("寻路有误，请检查参数是否正确");return null;}return nodes;}List<Vector2Int> GBFSFind(Vector2Int startPos, Vector2Int goalPos){//存储要检测的点List<DataNode> frontier = new List<DataNode>();//存储已经检测的点List<Vector2Int> reached = new List<Vector2Int>();//存储路径点List<Vector2Int> path = new List<Vector2Int>();DataNode startNode = new DataNode(startPos, null);startNode.hCost = 0;frontier.Add(startNode);reached.Add(startPos);while (frontier.Count > 0){DataNode currentNode = GetLowestgCostNode(frontier);path.Add(currentNode.pos);if (currentNode.pos == goalPos){return path;}frontier.Clear();List<DataNode> neighbors = GetNeighbors(currentNode.pos, reached);foreach (DataNode neighbourNode in neighbors){neighbourNode.parent = currentNode;neighbourNode.hCost = CalculateDistanceCost(goalPos, neighbourNode.pos);if (!frontier.Contains(neighbourNode)){frontier.Add(neighbourNode);}reached.Add(neighbourNode.pos);}}return path;}List<DataNode> GetNeighbors(Vector2Int current, List<Vector2Int> reached){List<DataNode> neighbors = new List<DataNode>();for (int i = 0; i < Utils.pointDir.Count; i++){Vector2Int neighbor = current + Utils.pointDir[i];if (this.IsCanAdd(neighbor, reached)){neighbors.Add(new DataNode(neighbor, null));}}return neighbors;}bool IsCanAdd(Vector2Int current, List<Vector2Int> reached){if (reached.Contains(current))return false;if (current.x >= 0 && current.y >= 0 && current.x < xCount && current.y < zCount){//如果是障碍物，则不能被Addif (this.mapData[current.y, current.x] == 1){return false;}return true;}return false;}private int CalculateDistanceCost(Vector2Int a, Vector2Int b){return Mathf.Abs(a.x - b.x) + Mathf.Abs(a.y - b.y);}private DataNode GetLowestgCostNode(List<DataNode> pathNodeList){DataNode lowestFCostNode = pathNodeList[0];for (int i = 1; i < pathNodeList.Count; i++){if (pathNodeList[i].hCost < lowestFCostNode.hCost){lowestFCostNode = pathNodeList[i];}}return lowestFCostNode;}
}

结果: