Questions tagged [uninformed-search]

For questions related to uninformed search algorithms, such as depth-first search (DFS) or breadth-first search (BFS).

Filter by
Sorted by
Tagged with
1 vote
1 answer
100 views

Why the space complexity of depth-first search is O(bm)?

In "Artificial Intelligence: A Modern Approach", the authors say that the space complexity of depth-first search is proportional to O(bm), considering b as the branching factor and m the ...
Zaratruta's user avatar
  • 111
1 vote
0 answers
3k views

How to improve the efficiency of the backtracking search in CSPs?

Backtracking search is the basic uninformed search algorithm for constraint satisfaction problems (CSPs). How could we improve the efficiency of the backtracking search in CSPs?
Abbas Ali's user avatar
  • 566
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 ...
JoeyB's user avatar
  • 477