I need to find some problems like this

Hi to all,

i need to find some problems to which apply the best-first search
meta-heuristic algorithms (A*, greedy etc...).

The search space must be a finite tree (example:peg solitaire).
It would be better if there is a known evaluation function to use with
the metaheuristic algorithms cited above.

Thanks.

.