Talk:Bidirectional search

why is there a link to the birthday paradox? Jaytan 21:48, 18 October 2006 (UTC)

I propose to remove: <<< This does not come without a price: Aside from the complexity of searching two times in parallel, we have to decide which search tree to extend at each step; we have to be able to travel backwards from goal to initial state - which may not be possible without extra work; and we need an efficient way to find the intersection of the two search trees. This additional complexity means that the A* search algorithm is often a better choice if we have a reasonable heuristic. >>> Ddccc (talk) 02:27, 16 December 2007 (UTC)

Unexplained terminology? b, d in the Big O Notation? Frontier? f-value?
What are b and d in this section: "The reason for this approach is that each of the two searches has complexity O(bd / 2) (in Big O notation), and O(bd / 2 + bd / 2) is much less than the running time of one search from the beginning to the goal, which would be O(bd)."? I checked Big O Notation and graph search algorithm and came up blank. Additionally, what is a "frontier"? 76.22.123.186 (talk) 05:59, 3 August 2008 (UTC)


 * I'm (slowly) working on this. Make another comment if you have any suggestions/requests for clarification. Xbao (talk) 08:55, 21 February 2012 (UTC)