21 Jan 2004
CS 3243 - Heuristics
28
Dominance
nIf h2(n) ≥ h1(n) for all n (both
admissible)
nthen h2 dominates h1
nh2 is
better for search
nTypical search costs (average number of nodes expanded):
nd=12 IDS = 3,644,035 nodes
A*(h1) = 227 nodes
A*(h2) = 73 nodes
A*(h1) = 227 nodes
A*(h2) = 73 nodes
nd=24 IDS = too many nodes
A*(h1) = 39,135 nodes
A*(h2) = 1,641 nodes
A*(h1) = 39,135 nodes
A*(h2) = 1,641 nodes