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 books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.
Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.
Start your free trial Become a member now