What does the runtime distribution tell you about this solver?
Greedy Descent is an incomplete algorithm, that is, it is not guaranteed to find a solution even given infinite time. That is why the runtime distribution flattens out.
Consistency for CSP
SLS for CSP
Belief and Decision Networks
STRIPS to CSP