Discrete Mathsfor Engineers

Structures, proofs, and intuition
EN | PT

Algorithm Design → Search Techniques

Part 1 of 1 — Index and Overview

Series: Search Techniques Part 1 of 1
← Previous Next →
1

How to Use This Series

This track organizes search algorithms by “families” (exploration, combinatorial search, and heuristic search). The goal is for you to navigate by technique, understand the mental model, and only then explore the code.

Whenever a topic is marked as under construction, it means the page is already planned and will receive content soon.

Tip: if you are coming from the Graph Theory series (Hamiltonian, for example), start with Backtracking, then move on to IDA* and A*.

Index — Search Techniques

Below is the complete index. Finished items link directly to their pages. Topics under construction are clearly highlighted.

Exploration

Graph traversal algorithms that systematically explore vertices and edges of a graph.

Combinatorial Search

Techniques for exploring a space of candidate solutions under constraints.

Heuristic Search

Algorithms that use heuristics to guide exploration toward promising regions of the search space.

  • A* under construction
  • IDA* under construction
Organization: algorithms “live” under Algorithm Design. Problem-based series (e.g., Hamiltonian) simply reference these pages.
Made with ❤️ by Leandro Rodrigues