Bidirectional search currently only supports GraphProblem type problems. I think we can add support for all the problem types by storing the nodes instead of states in open/closed list for both directions and calling n.expand(problem) on it to return the next states.