Governorates Heuristics and GBFS Trace

Vocabulary flashcards covering the heuristic values H(n) for Jordanian governorates, GBFS algorithm trace components, final visited path, and solution cost.

GBFS

Greedy Best-First Search

$H(n)$ of IRBID

$$435$$

$H(n)$ of AJLON

$$405$$

$H(n)$ of AL-MAFRAQ

$$390$$

$H(n)$ of JARASH

$$385$$

$H(n)$ of AL-SALT

$$365$$

$H(n)$ of MADABA

$$350$$

$H(n)$ of ZARQAA

$$345$$

$H(n)$ of AMMAN

$$335$$

$H(n)$ of AL-KARAK

$$260$$

$H(n)$ of AL-TAFILA

$$170$$

$H(n)$ of MA'AN

$$120$$

$H(n)$ of AL-AQAPA

$$0$$

GBFS Final Visited Path

IRBID AL-SALT AMMAN MA'AN AL-AQAPA

GBFS Solution Cost

$$14$$