This chapter presents uninformed search algorithms, a fundamental class of problem-solving techniques in artificial intelligence. These algorithms operate without domain-specific knowledge. The discussion builds on concepts of state spaces and problem representation. We explore how these algorithms systematically traverse search spaces to find solutions. The chapter provides both theoretical foundations and practical implementations. Examples and Python code demonstrate real-world applications.