Search  Term

 

°ÔÀÓ (Game)

±×·¡ÇÁ ÀÌ·Ð (Graph Theory) 

±×·¡ÇÁ (Graph)

±íÀÌ¿ì¼± Ž»ö (Depth First Search)   

³Êºñ¿ì¼± Ž»ö (Breadth First Search)  

¸ðÀÇ ´ã±ÝÁú (Simulated Annealing)

¹«Á¤º¸ Ž»ö (Uninformed Search) 

¹®Á¦ÇØ°á (Problem Solving)   

¹ÙµÏ (Baduk)  

¹Ýº¹Àû ±íÀÌÁõ°¡ Ž»ö (Iterative Deepening Depth-first Search)

»óÅ°ø°£ (State Space)

¾ËÆĺ£Å¸ °¡ÁöÄ¡±â (Alpha-Beta Pruning)

¾ç¹æÇâ Ž»ö (Bidirectional Search)   

À¯Àü¾Ë°í¸®Áò (Genetic Algorithm)

ÀΰøÁö´É (Artificial Intelligence)

Àû´ë Ž»ö (Adversarial Search)

Á¦¾àÁ¶°Ç ¸¸Á· ¹®Á¦ (Constraint Satisfaction Problem)

ÃÖ»ó¿ì¼± Ž»ö (Best-first Search)   

ÃÖ¼ÒÃÖ´ë (Mini-max)

Ž»ö (Search)   

Æ®¸® (Tree)

ÈÞ¸®½ºÆ½ Ž»ö (Heuristic Search)   

ÈÞ¸®½ºÆ½ (Heuristic) 

A * ¾Ë°í¸®Áò