Talk:Bidirectional search

From Wikipedia, the free encyclopedia

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)