Hi! What constraints are necessary on g and/or h* to make the A* algorithm behave equivalently to: Breadth-first, Uniform-cost, and Best-first? Thanx.

This sounds suspiciously like a homework question.

just do some cross reading on any A* doc, and you'll find the answer within minutes

Go to your local college library and pickup a copy of Artificial Intelligence: A Modern Approach. Page 92 (in 1st Ed) would be your starting point for your answer.