Best-first Search
Wikipedia : Best-first Search : Best-first search ´Â ¾î¶°ÇÑ ÈÞ¸®½ºÆ½ (Heuristic) ¿¡ µû¶ó¼ ÃÖ±ÙÀÇ ¸ðµç °æ·Î (path) µéÀ» ¼ø¼ÈÇÏ¿© ±íÀ̿켱 Ž»ö (Depth-first Search) À» ÃÖÀûÈÇϴ Ž»ö¾Ë°í¸®ÁòÀÌ´Ù. ±× ÈÞ¸®½ºÆ½Àº ¾î¶² °æ·ÎÀÇ ³¡ÀÌ ÇØ (solution) ¿¡ ¾ó¸¶³ª ±ÙÁ¢ÇÑ °ÍÀÎÁö¸¦ ¿¹ÃøÇϱâÀ§ÇÑ °ÍÀÌ´Ù. ÇØ¿¡ ´õ °¡±õ´Ù°í ÆÇÁ¤µÇ´Â °æ·ÎµéÀ» ¸ÕÀú È®ÀåÇÑ´Ù. Èĺ¸Áß¿¡¼ ¾î¶² °æ·Î¸¦ È®ÀåÇÏ´Â °ÍÀÌ °¡Àå ÁÁÀº°¡ ÇÏ´Â È¿À²ÀûÀÎ ¼±ÅÃÀº ÀϹÝÀûÀ¸·Î´Â ¿ì¼±¼øÀ§ Å¥ (priority queue)¸¦ »ç¿ëÇÏ¿© ±¸ÇöµÈ´Ù.
Best-first search ¾Ë°í¸®ÁòÀÇ ¿¹·Î¼´Â Dijkstra's algorithm °ú A* ¾Ë°í¸®Áò ¸¦ µé ¼ö ÀÖ´Ù. Best-first ¾Ë°í¸®ÁòµéÀº Á¶ÇÕŽ»ö (combinatorial search)¿¡¼ ¹ß°ß (pathfinding)À» À§Çؼµµ °¡²û »ç¿ëµÈ´Ù.
term :
Ž»ö (Search) ³Êºñ¿ì¼± Ž»ö (Breadth-first Search) ±íÀ̿켱 Ž»ö (Depth-first Search) ¹Ýº¹Àû ±íÀÌÁõ°¡ Ž»ö (Iterative Deepening Depth-first Search) °ÔÀÓ (Game)
site :
paper :
Àç±ÍÀûÀÎ ÃÖ»ó¿ì¼± Ž»ö (Recursive Best-First Search) : Nils J.Nilsson