Bidirectional search

In this technique, the search is carried forward from the initial state and backward from the goal state until both are met to identify the common state and then the path from the initial state is concatenated with an inverse path from the goal state.

Read more at: https://en.wikipedia.org/wiki/Bidirectional_search

Get Learning Android Game Development now with the O’Reilly learning platform.

O’Reilly members experience live online training, plus books, videos, and digital content from nearly 200 publishers.