http://junhoahn.kr/noriwiki/index.php?action=history&feed=atom&title=Heuristic_search 2026-04-09T17:00:45Z 이 문서의 편집 역사 MediaWiki 1.43.0 http://junhoahn.kr/noriwiki/index.php?title=Heuristic_search&diff=595&oldid=prev 2023-02-13T02:01:20Z

<p></p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="ko"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← 이전 판</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">2023년 2월 13일 (월) 02:01 판</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l9">9번째 줄:</td> <td colspan="2" class="diff-lineno">9번째 줄:</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>#[[Hill climbing]]</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>#[[Hill climbing]]</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>#[[Simulated annealing]]</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>#[[Simulated annealing]]</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>#[[Genetic <del style="font-weight: bold; text-decoration: none;">algorithms</del>]]</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>#[[Genetic <ins style="font-weight: bold; text-decoration: none;">algorithm</ins>]]</div></td></tr> </table>

Ahn9807 http://junhoahn.kr/noriwiki/index.php?title=Heuristic_search&diff=594&oldid=prev 2023-02-13T02:01:02Z

<p></p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="ko"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← 이전 판</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">2023년 2월 13일 (월) 02:01 판</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l5">5번째 줄:</td> <td colspan="2" class="diff-lineno">5번째 줄:</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 종류 ==</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>== 종류 ==</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>#[[Best-<del style="font-weight: bold; text-decoration: none;">First </del>search]]</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>#[[Best-<ins style="font-weight: bold; text-decoration: none;">first </ins>search]]</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>#[[A*]]</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>#[[A* <ins style="font-weight: bold; text-decoration: none;">algorithm</ins>]]</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>#[[Hill <del style="font-weight: bold; text-decoration: none;">Climbing</del>]]</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>#[[Hill <ins style="font-weight: bold; text-decoration: none;">climbing</ins>]]</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>#[[Simulated <del style="font-weight: bold; text-decoration: none;">Annealing</del>]]</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>#[[Simulated <ins style="font-weight: bold; text-decoration: none;">annealing</ins>]]</div></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>#[[Genetic <del style="font-weight: bold; text-decoration: none;">Algorithms</del>]]</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>#[[Genetic <ins style="font-weight: bold; text-decoration: none;">algorithms</ins>]]</div></td></tr> </table>

Ahn9807 http://junhoahn.kr/noriwiki/index.php?title=Heuristic_search&diff=593&oldid=prev 2023-02-13T02:00:47Z

<p>새 문서: <a href="/noriwiki/index.php?title=%EB%B6%84%EB%A5%98:%ED%83%90%EC%83%89" title="분류:탐색">분류: 탐색</a> == 개요 == 휴리스틱 탐색이란, 탐색과정에 있어서 일정한 정도의 추측을 사용하는 것을 말한다. 이 기법은 Informed search라고도 불리기도 한다. 최고의 답을 찾니는 않지만 합당한 시간안에 최적의 답을 찾아가는 것을 보장한다. == 종류 == #<a href="/noriwiki/index.php?title=Best-First_search&amp;action=edit&amp;redlink=1" class="new" title="Best-First search (없는 문서)">Best-First search</a> #<a href="/noriwiki/index.php?title=A*&amp;action=edit&amp;redlink=1" class="new" title="A* (없는 문서)">A*</a> #<a href="/noriwiki/index.php?title=Hill_Climbing&amp;action=edit&amp;redlink=1" class="new" title="Hill Climbing (없는 문서)">Hill Climbing</a> #<a href="/noriwiki/index.php?title=Simulated_Annealing&amp;action=edit&amp;redlink=1" class="new" title="Simulated Annealing (없는 문서)">Simulated Annealing</a> #<a href="/noriwiki/index.php?title=Genetic_Algorithms&amp;action=edit&amp;redlink=1" class="new" title="Genetic Algorithms (없는 문서)">Genetic Algorithms</a></p> <p><b>새 문서</b></p><div>[[분류: 탐색]]<br /> <br /> == 개요 ==<br /> 휴리스틱 탐색이란, 탐색과정에 있어서 일정한 정도의 추측을 사용하는 것을 말한다. 이 기법은 Informed search라고도 불리기도 한다. 최고의 답을 찾니는 않지만 합당한 시간안에 최적의 답을 찾아가는 것을 보장한다. <br /> <br /> == 종류 ==<br /> #[[Best-First search]]<br /> #[[A*]]<br /> #[[Hill Climbing]]<br /> #[[Simulated Annealing]]<br /> #[[Genetic Algorithms]]</div>

Ahn9807