Files
2nd/10_Wiki/Topics/AI_and_ML/Heuristic-Search.md
T
2026-05-10 22:08:15 +09:00

1.0 KiB

id, title, category, status, canonical_id, duplicate_of, aliases, source_trust_level, confidence_score, verification_status, tags, last_reinforced, github_commit
id title category status canonical_id duplicate_of aliases source_trust_level confidence_score verification_status tags last_reinforced github_commit
wiki-2026-0508-heuristic-search Heuristic Search 10_Wiki/Topics duplicate wiki-2026-0508-heuristics Heuristics
A*
IDA*
best-first search
heuristic search
A 0.95 redirected
duplicate
heuristic
search
ai
2026-05-10 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

🕓 변경 이력

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