What is uninformed search algorithm?

An uninformed search algorithm, also known as a blind search algorithm, is a type of search strategy that explores the search space without any domain-specific knowledge or heuristics. It relies solely on the problem structure and often uses systematic methods like breadth-first search, depth-first search, or iterative deepening. These algorithms explore all possible paths until they find a solution, making them simple but potentially inefficient for large problem spaces. Since they don't utilize additional information, their performance can be significantly slower compared to informed search algorithms.