Intelligent Agents and Search Algorithms

University of Colorado Boulder via Coursera

Go to class Write review

Details

Go to class

Provider

Coursera
Pricing

Paid Course
Languages

English
Certificate

Paid Certificate Available
Duration & workload

12 hours 28 minutes
Sessions

On-Demand
Subtitles

English

Found in

Overview

Coursera Flash Sale

40% Off Coursera Plus for 3 Months!

Grab it

Intelligent Agents and Search Algorithms is your gateway to understanding how machines make decisions, solve problems, and act rationally in complex environments. In this course, you’ll explore the foundational principles that power intelligent systems—starting with agent architectures and environment types, and progressing into the design of goal-driven, rational behavior. You’ll examine how search enables AI systems to navigate uncertainty and make optimal choices, diving into uninformed and informed strategies such as breadth-first search, depth-first search, A*, and adversarial search. You’ll also learn how heuristics shape efficiency and performance—an essential concept for building scalable, high-performing AI systems. More than a theoretical overview, this course emphasizes applied skill-building. Through hands-on programming assignments and algorithm analysis, you’ll compare performance trade-offs, implement search strategies, and evaluate real-world problem-solving approaches. As part of CU Boulder’s MS in Artificial Intelligence, this course equips you with the conceptual clarity and technical foundation required for AI development, systems design, and advanced study. Whether you’re preparing to build intelligent systems or elevate your role in an AI-driven organization, mastering agents and search is a critical step forward in your career.

Syllabus

Search Problems & Intelligence

Module 1 introduces the core concepts that form the foundation of intelligent systems in artificial intelligence. You will explore the historical development of AI and how early problem-solving approaches led to the development of intelligent agents and search-based reasoning. The module focuses on understanding rational agents, the environments in which they operate, and the different types of agents used to make decisions and solve problems. Through examples and activities, you will begin connecting these foundational ideas to how AI systems search, reason, and act in real-world environments.

Uninformed Searches

In this module, you will explore how complex problems can be represented and solved through search. You will learn how to define a search problem by identifying states, actions, goals, and costs, and examine how these components guide an algorithm’s ability to find solutions. Through toy examples and hands-on practice, you will see how problems are structured so that search algorithms can navigate possible paths toward a goal. You will also compare common uninformed search strategies—including breadth-first search (BFS), depth-first search (DFS), and uniform-cost search—to understand how different approaches affect efficiency and performance.

Informed Searches

In this module, you will explore informed search methods that improve problem-solving efficiency by guiding algorithms with heuristics. You will examine how objective functions help algorithms prioritize promising paths and learn how strategies such as greedy best-first search and A* search use heuristic information to find solutions more efficiently. You will also investigate conditions for optimality in A*, explore variations such as IDA* and weighted A*, and implement A* in a practical activity. You will also analyze how heuristic quality influences algorithm performance, including runtime complexity and branching behavior. By studying approaches for developing heuristics—such as relaxed problems, sub-problems, and experience-based learning—you will gain insight into how well-designed heuristics can dramatically improve search performance in complex problem spaces.

Informed Local Searches

In this module, you will explore search problems where the objective is to find an optimal state rather than a sequence of actions. Using the classic 8-queens problem, you will examine how local search algorithms such as hill climbing navigate solution spaces and learn key concepts including local and global optima. You will also study strategies that improve local search performance, such as random restarts, sideways moves, and allowing downhill steps to escape local optima. The module introduces broader optimization approaches including simulated annealing, genetic algorithms, beam search, and tabu search, along with nature-inspired algorithms like particle swarm optimization and ant colony optimization, helping you understand how these methods are applied to solve complex real-world optimization problems.

Informed Adversarial Searches

In this module, you will explore how artificial intelligence approaches decision-making in competitive environments through game playing. You will examine the structure of games commonly studied in AI, focusing on two-player, turn-taking games with complete information. The module introduces the minimax algorithm as a method for evaluating possible game outcomes and selecting optimal moves, and explains how alpha-beta pruning improves efficiency by reducing the number of game states that must be evaluated. You will also explore the historical foundations of AI game playing, including early work on computer chess, and review examples of games where AI techniques are applied today.