When is backward search better than forward?

Question

I'm studying graph search algorithms (for this question sake, lets limit algorithms only on DFS, BreadthFS, ID).

All these algorithms can be implemented as either forward search (from start node to end node) or backward search (from end node to start node).

My question is, when will backward search perform better than forward? Is there a general rule for that?