---
id: wiki-2026-0508-heuristic-search
title: Heuristic Search
category: 10_Wiki/Topics
status: duplicate
canonical_id: wiki-2026-0508-heuristics
duplicate_of: "[[Heuristics]]"
aliases: [A*, IDA*, best-first search, heuristic search]
source_trust_level: A
confidence_score: 0.95
verification_status: redirected
tags: [duplicate, heuristic, search, ai]
last_reinforced: 2026-05-10
github_commit: pending
---

# Heuristic Search

> **이 문서는 [[Heuristics]] 의 specialization 입니다.** Canonical 문서로 redirect.

## 핵심 요약 (search-specific)
- **A***: 매 f = g + h, 매 admissible h.
- **IDA***: 매 iterative deepening A* — 매 memory ↓.
- **Best-first**: 매 h only (greedy).
- **MCTS**: 매 sampled tree search.
- **응용**: 매 path planning, puzzle, game AI.

## 🔗 Graph
- 부모: [[Heuristics]] (canonical)
- Adjacent: [[Goal-Oriented-Action-Planning]]

## 🕓 변경 이력
| 날짜 | 변경 |
|---|---|
| 2026-05-08 | Phase 1 |
| 2026-05-10 | 중복 처리 — canonical 문서로 redirect |