Questions tagged [informed-search]

For questions related to informed search algorithms (i.e. algorithms that use heuristic functions to guide the search), such as A* or IDA*.

Filter by
Sorted by
Tagged with
3 votes
2 answers
2k views

Why is the effective branching factor used for measuring performance of a heuristic function?

For search algorithms with heuristic functions, the performance of heuristic functions are measured by the effective branching factor ${b^*}$, which involves the total number of nodes expanded ${N}$ ...
3 votes
1 answer
2k views

Which are more memory efficient: uninformed or informed search algorithms?

I have extensively researched now for three days straight trying to find which algorithm is better in terms of which algorithm uses up more memory. I know uninformed algorithms, like depth-first ...