Learning Path

Basic Search Algorithms for Problem-Solving

Problem Formulation in AI → Comparing Search Algorithms

9 Knowledge Nodes · 9 Learning Steps · v0 Active

This learning path introduces fundamental search algorithms used in artificial intelligence for problem-solving. Starting with problem formulation and basic data structures, it covers uninformed searches (BFS, DFS) and informed searches (Greedy, A*) with heuristics. By the end, learners will be able to formulate problems as search problems and compare different search strategies.

0 Likes

Knowledge Map

Explore the complete knowledge graph with this learning route highlighted, or switch to Route to focus on the route topology.

Drag to pan · Scroll to zoom · Click a node to inspect

Click a node to preview its details without leaving this path. Scroll to zoom, or open Fullscreen to explore the whole map.

Learning Route

9 learning steps · 3 phases. Click any step to inspect it and see it on the Knowledge Map.

Phase 1

Foundation

3 steps

Phase 2

Core Concepts

3 steps

Phase 3

Advanced Topics

3 steps