CINXE.COM
Algoritma pencarian - Wikipedia bahasa Indonesia, ensiklopedia bebas
<!DOCTYPE html> <html class="client-nojs vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-disabled skin-theme-clientpref-day vector-toc-available" lang="id" dir="ltr"> <head> <meta charset="UTF-8"> <title>Algoritma pencarian - Wikipedia bahasa Indonesia, ensiklopedia bebas</title> <script>(function(){var className="client-js vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-disabled skin-theme-clientpref-day vector-toc-available";var cookie=document.cookie.match(/(?:^|; )idwikimwclientpreferences=([^;]+)/);if(cookie){cookie[1].split('%2C').forEach(function(pref){className=className.replace(new RegExp('(^| )'+pref.replace(/-clientpref-\w+$|[^\w-]+/g,'')+'-clientpref-\\w+( |$)'),'$1'+pref+'$2');});}document.documentElement.className=className;}());RLCONF={"wgBreakFrames":false,"wgSeparatorTransformTable":[",\t.",".\t,"],"wgDigitTransformTable":["",""], "wgDefaultDateFormat":"dmy","wgMonthNames":["","Januari","Februari","Maret","April","Mei","Juni","Juli","Agustus","September","Oktober","November","Desember"],"wgRequestId":"1bf6c79a-c4c9-4667-a313-f3f376323f23","wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"Algoritma_pencarian","wgTitle":"Algoritma pencarian","wgCurRevisionId":25389289,"wgRevisionId":25389289,"wgArticleId":61463,"wgIsArticle":true,"wgIsRedirect":false,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":["Algoritme","Ilmu komputer"],"wgPageViewLanguage":"id","wgPageContentLanguage":"id","wgPageContentModel":"wikitext","wgRelevantPageName":"Algoritma_pencarian","wgRelevantArticleId":61463,"wgIsProbablyEditable":true,"wgRelevantPageIsProbablyEditable":true,"wgRestrictionEdit":[],"wgRestrictionMove":[],"wgNoticeProject":"wikipedia","wgCiteReferencePreviewsActive":false,"wgFlaggedRevsParams":{"tags":{"accuracy":{"levels":2}}},"wgMediaViewerOnClick":true, "wgMediaViewerEnabledByDefault":true,"wgPopupsFlags":0,"wgVisualEditor":{"pageLanguageCode":"id","pageLanguageDir":"ltr","pageVariantFallbacks":"id"},"wgMFDisplayWikibaseDescriptions":{"search":true,"watchlist":true,"tagline":true,"nearby":true},"wgWMESchemaEditAttemptStepOversample":false,"wgWMEPageLength":9000,"wgRelatedArticlesCompat":[],"wgCentralAuthMobileDomain":false,"wgEditSubmitButtonLabelPublish":true,"wgULSPosition":"interlanguage","wgULSisCompactLinksEnabled":false,"wgVector2022LanguageInHeader":true,"wgULSisLanguageSelectorEmpty":false,"wgWikibaseItemId":"Q755673","wgCheckUserClientHintsHeadersJsApi":["brands","architecture","bitness","fullVersionList","mobile","model","platform","platformVersion"],"GEHomepageSuggestedEditsEnableTopics":true,"wgGETopicsMatchModeEnabled":false,"wgGEStructuredTaskRejectionReasonTextInputEnabled":false,"wgGELevelingUpEnabledForUser":false};RLSTATE={"ext.gadget.charinsert-styles":"ready","ext.globalCssJs.user.styles":"ready","site.styles": "ready","user.styles":"ready","ext.globalCssJs.user":"ready","user":"ready","user.options":"loading","skins.vector.search.codex.styles":"ready","skins.vector.styles":"ready","skins.vector.icons":"ready","ext.wikimediamessages.styles":"ready","ext.visualEditor.desktopArticleTarget.noscript":"ready","ext.uls.interlanguage":"ready","wikibase.client.init":"ready","ext.wikimediaBadges":"ready"};RLPAGEMODULES=["site","mediawiki.page.ready","mediawiki.toc","skins.vector.js","ext.centralNotice.geoIP","ext.centralNotice.startUp","ext.gadget.ReferenceTooltips","ext.gadget.watchlist-notice","ext.gadget.charinsert","ext.gadget.refToolbar","ext.gadget.AdvancedSiteNotices","ext.gadget.switcher","ext.gadget.Bagikan","ext.gadget.CurIDLink","ext.urlShortener.toolbar","ext.centralauth.centralautologin","ext.popups","ext.visualEditor.desktopArticleTarget.init","ext.visualEditor.targetLoader","ext.echo.centralauth","ext.eventLogging","ext.wikimediaEvents","ext.navigationTiming","ext.uls.interface", "ext.cx.eventlogging.campaigns","ext.cx.uls.quick.actions","wikibase.client.vector-2022","ext.checkUser.clientHints","ext.growthExperiments.SuggestedEditSession","oojs-ui.styles.icons-media","oojs-ui-core.icons","wikibase.sidebar.tracking"];</script> <script>(RLQ=window.RLQ||[]).push(function(){mw.loader.impl(function(){return["user.options@12s5i",function($,jQuery,require,module){mw.user.tokens.set({"patrolToken":"+\\","watchToken":"+\\","csrfToken":"+\\"}); }];});});</script> <link rel="stylesheet" href="/w/load.php?lang=id&modules=ext.uls.interlanguage%7Cext.visualEditor.desktopArticleTarget.noscript%7Cext.wikimediaBadges%7Cext.wikimediamessages.styles%7Cskins.vector.icons%2Cstyles%7Cskins.vector.search.codex.styles%7Cwikibase.client.init&only=styles&skin=vector-2022"> <script async="" src="/w/load.php?lang=id&modules=startup&only=scripts&raw=1&skin=vector-2022"></script> <meta name="ResourceLoaderDynamicStyles" content=""> <link rel="stylesheet" href="/w/load.php?lang=id&modules=ext.gadget.charinsert-styles&only=styles&skin=vector-2022"> <link rel="stylesheet" href="/w/load.php?lang=id&modules=site.styles&only=styles&skin=vector-2022"> <meta name="generator" content="MediaWiki 1.44.0-wmf.4"> <meta name="referrer" content="origin"> <meta name="referrer" content="origin-when-cross-origin"> <meta name="robots" content="max-image-preview:standard"> <meta name="format-detection" content="telephone=no"> <meta name="viewport" content="width=1120"> <meta property="og:title" content="Algoritma pencarian - Wikipedia bahasa Indonesia, ensiklopedia bebas"> <meta property="og:type" content="website"> <link rel="alternate" media="only screen and (max-width: 640px)" href="//id.m.wikipedia.org/wiki/Algoritma_pencarian"> <link rel="alternate" type="application/x-wiki" title="Sunting" href="/w/index.php?title=Algoritma_pencarian&action=edit"> <link rel="apple-touch-icon" href="/static/apple-touch/wikipedia.png"> <link rel="icon" href="/static/favicon/wikipedia.ico"> <link rel="search" type="application/opensearchdescription+xml" href="/w/rest.php/v1/search" title="Wikipedia (id)"> <link rel="EditURI" type="application/rsd+xml" href="//id.wikipedia.org/w/api.php?action=rsd"> <link rel="canonical" href="https://id.wikipedia.org/wiki/Algoritma_pencarian"> <link rel="license" href="https://creativecommons.org/licenses/by-sa/4.0/deed.id"> <link rel="alternate" type="application/atom+xml" title="Umpan Atom Wikipedia" href="/w/index.php?title=Istimewa:Perubahan_terbaru&feed=atom"> <link rel="dns-prefetch" href="//meta.wikimedia.org" /> <link rel="dns-prefetch" href="//login.wikimedia.org"> </head> <body class="skin--responsive skin-vector skin-vector-search-vue mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject mw-editable page-Algoritma_pencarian rootpage-Algoritma_pencarian skin-vector-2022 action-view"><a class="mw-jump-link" href="#bodyContent">Lompat ke isi</a> <div class="vector-header-container"> <header class="vector-header mw-header"> <div class="vector-header-start"> <nav class="vector-main-menu-landmark" aria-label="Situs"> <div id="vector-main-menu-dropdown" class="vector-dropdown vector-main-menu-dropdown vector-button-flush-left vector-button-flush-right" > <input type="checkbox" id="vector-main-menu-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-main-menu-dropdown" class="vector-dropdown-checkbox " aria-label="Menu utama" > <label id="vector-main-menu-dropdown-label" for="vector-main-menu-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-menu mw-ui-icon-wikimedia-menu"></span> <span class="vector-dropdown-label-text">Menu utama</span> </label> <div class="vector-dropdown-content"> <div id="vector-main-menu-unpinned-container" class="vector-unpinned-container"> <div id="vector-main-menu" class="vector-main-menu vector-pinnable-element"> <div class="vector-pinnable-header vector-main-menu-pinnable-header vector-pinnable-header-unpinned" data-feature-name="main-menu-pinned" data-pinnable-element-id="vector-main-menu" data-pinned-container-id="vector-main-menu-pinned-container" data-unpinned-container-id="vector-main-menu-unpinned-container" > <div class="vector-pinnable-header-label">Menu utama</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-main-menu.pin">pindah ke bilah sisi</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-main-menu.unpin">sembunyikan</button> </div> <div id="p-navigation" class="vector-menu mw-portlet mw-portlet-navigation" > <div class="vector-menu-heading"> Navigasi </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-mainpage" class="mw-list-item"><a href="/wiki/Halaman_Utama" title="Kunjungi Halaman Utama [z]" accesskey="z"><span>Halaman Utama</span></a></li><li id="n-Daftar-isi" class="mw-list-item"><a href="/wiki/Wikipedia:Isi"><span>Daftar isi</span></a></li><li id="n-recentchanges" class="mw-list-item"><a href="/wiki/Istimewa:Perubahan_terbaru" title="Daftar perubahan terbaru dalam wiki. [r]" accesskey="r"><span>Perubahan terbaru</span></a></li><li id="n-Artikel-pilihan" class="mw-list-item"><a href="/wiki/Wikipedia:Artikel_pilihan/Topik"><span>Artikel pilihan</span></a></li><li id="n-currentevents" class="mw-list-item"><a href="/wiki/Portal:Peristiwa_terkini" title="Temukan informasi tentang peristiwa terkini"><span>Peristiwa terkini</span></a></li><li id="n-newpage" class="mw-list-item"><a href="/wiki/Istimewa:Halaman_baru"><span>Halaman baru</span></a></li><li id="n-randompage" class="mw-list-item"><a href="/wiki/Istimewa:Halaman_sembarang" title="Tampilkan sembarang halaman [x]" accesskey="x"><span>Halaman sembarang</span></a></li> </ul> </div> </div> <div id="p-Komunitas" class="vector-menu mw-portlet mw-portlet-Komunitas" > <div class="vector-menu-heading"> Komunitas </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-Warung-Kopi" class="mw-list-item"><a href="/wiki/Wikipedia:Warung_Kopi"><span>Warung Kopi</span></a></li><li id="n-portal" class="mw-list-item"><a href="/wiki/Portal:Komunitas" title="Tentang proyek, apa yang dapat Anda lakukan, di mana untuk mencari sesuatu"><span>Portal komunitas</span></a></li><li id="n-help" class="mw-list-item"><a href="/wiki/Bantuan:Isi" title="Tempat mencari bantuan."><span>Bantuan</span></a></li> </ul> </div> </div> <div id="p-Wikipedia" class="vector-menu mw-portlet mw-portlet-Wikipedia" > <div class="vector-menu-heading"> Wikipedia </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-aboutsite" class="mw-list-item"><a href="/wiki/Wikipedia:Perihal"><span>Tentang Wikipedia</span></a></li><li id="n-Pancapilar" class="mw-list-item"><a href="/wiki/Wikipedia:Pancapilar"><span>Pancapilar</span></a></li><li id="n-Kebijakan" class="mw-list-item"><a href="/wiki/Wikipedia:Kebijakan_dan_pedoman"><span>Kebijakan</span></a></li><li id="n-Hubungi-kami" class="mw-list-item"><a href="/wiki/Wikipedia:Hubungi_kami"><span>Hubungi kami</span></a></li><li id="n-Bak-pasir" class="mw-list-item"><a href="/wiki/Wikipedia:Bak_pasir"><span>Bak pasir</span></a></li> </ul> </div> </div> <div id="p-Bagikan" class="vector-menu mw-portlet mw-portlet-Bagikan emptyPortlet" > <div class="vector-menu-heading"> Bagikan </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> </div> </div> </div> </div> </nav> <a href="/wiki/Halaman_Utama" class="mw-logo"> <img class="mw-logo-icon" src="/static/images/icons/wikipedia.png" alt="" aria-hidden="true" height="50" width="50"> <span class="mw-logo-container skin-invert"> <img class="mw-logo-wordmark" alt="Wikipedia" src="/static/images/mobile/copyright/wikipedia-wordmark-en.svg" style="width: 7.5em; height: 1.125em;"> <img class="mw-logo-tagline" alt="Ensiklopedia Bebas" src="/static/images/mobile/copyright/wikipedia-tagline-id.svg" width="120" height="14" style="width: 7.5em; height: 0.875em;"> </span> </a> </div> <div class="vector-header-end"> <div id="p-search" role="search" class="vector-search-box-vue vector-search-box-collapses vector-search-box-show-thumbnail vector-search-box-auto-expand-width vector-search-box"> <a href="/wiki/Istimewa:Pencarian" class="cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only search-toggle" title="Cari di Wikipedia [f]" accesskey="f"><span class="vector-icon mw-ui-icon-search mw-ui-icon-wikimedia-search"></span> <span>Pencarian</span> </a> <div class="vector-typeahead-search-container"> <div class="cdx-typeahead-search cdx-typeahead-search--show-thumbnail cdx-typeahead-search--auto-expand-width"> <form action="/w/index.php" id="searchform" class="cdx-search-input cdx-search-input--has-end-button"> <div id="simpleSearch" class="cdx-search-input__input-wrapper" data-search-loc="header-moved"> <div class="cdx-text-input cdx-text-input--has-start-icon"> <input class="cdx-text-input__input" type="search" name="search" placeholder="Telusuri Wikipedia" aria-label="Telusuri Wikipedia" autocapitalize="sentences" title="Cari di Wikipedia [f]" accesskey="f" id="searchInput" > <span class="cdx-text-input__icon cdx-text-input__start-icon"></span> </div> <input type="hidden" name="title" value="Istimewa:Pencarian"> </div> <button class="cdx-button cdx-search-input__end-button">Cari</button> </form> </div> </div> </div> <nav class="vector-user-links vector-user-links-wide" aria-label="Perkakas pribadi"> <div class="vector-user-links-main"> <div id="p-vector-user-menu-preferences" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-userpage" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <nav class="vector-appearance-landmark" aria-label="Tampilan"> <div id="vector-appearance-dropdown" class="vector-dropdown " title="Change the appearance of the page's font size, width, and color" > <input type="checkbox" id="vector-appearance-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-appearance-dropdown" class="vector-dropdown-checkbox " aria-label="Tampilan" > <label id="vector-appearance-dropdown-label" for="vector-appearance-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-appearance mw-ui-icon-wikimedia-appearance"></span> <span class="vector-dropdown-label-text">Tampilan</span> </label> <div class="vector-dropdown-content"> <div id="vector-appearance-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <div id="p-vector-user-menu-notifications" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-overflow" class="vector-menu mw-portlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="//donate.wikimedia.org/wiki/Special:FundraiserRedirector?utm_source=donate&utm_medium=sidebar&utm_campaign=C13_id.wikipedia.org&uselang=id" class=""><span>Menyumbang</span></a> </li> <li id="pt-createaccount-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Istimewa:Buat_akun&returnto=Algoritma+pencarian" title="Anda dianjurkan untuk membuat akun dan masuk log; meskipun, hal itu tidak diwajibkan" class=""><span>Buat akun baru</span></a> </li> <li id="pt-login-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Istimewa:Masuk_log&returnto=Algoritma+pencarian" title="Anda disarankan untuk masuk log, meskipun hal itu tidak diwajibkan. [o]" accesskey="o" class=""><span>Masuk log</span></a> </li> </ul> </div> </div> </div> <div id="vector-user-links-dropdown" class="vector-dropdown vector-user-menu vector-button-flush-right vector-user-menu-logged-out" title="Opsi lainnya" > <input type="checkbox" id="vector-user-links-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-user-links-dropdown" class="vector-dropdown-checkbox " aria-label="Perkakas pribadi" > <label id="vector-user-links-dropdown-label" for="vector-user-links-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-ellipsis mw-ui-icon-wikimedia-ellipsis"></span> <span class="vector-dropdown-label-text">Perkakas pribadi</span> </label> <div class="vector-dropdown-content"> <div id="p-personal" class="vector-menu mw-portlet mw-portlet-personal user-links-collapsible-item" title="Menu pengguna" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport" class="user-links-collapsible-item mw-list-item"><a href="//donate.wikimedia.org/wiki/Special:FundraiserRedirector?utm_source=donate&utm_medium=sidebar&utm_campaign=C13_id.wikipedia.org&uselang=id"><span>Menyumbang</span></a></li><li id="pt-createaccount" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Istimewa:Buat_akun&returnto=Algoritma+pencarian" title="Anda dianjurkan untuk membuat akun dan masuk log; meskipun, hal itu tidak diwajibkan"><span class="vector-icon mw-ui-icon-userAdd mw-ui-icon-wikimedia-userAdd"></span> <span>Buat akun baru</span></a></li><li id="pt-login" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Istimewa:Masuk_log&returnto=Algoritma+pencarian" title="Anda disarankan untuk masuk log, meskipun hal itu tidak diwajibkan. [o]" accesskey="o"><span class="vector-icon mw-ui-icon-logIn mw-ui-icon-wikimedia-logIn"></span> <span>Masuk log</span></a></li> </ul> </div> </div> <div id="p-user-menu-anon-editor" class="vector-menu mw-portlet mw-portlet-user-menu-anon-editor" > <div class="vector-menu-heading"> Halaman penyunting yang telah keluar log <a href="/wiki/Bantuan:Pengantar" aria-label="Pelajari lebih lanjut tentang menyunting"><span>pelajari lebih lanjut</span></a> </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-anoncontribs" class="mw-list-item"><a href="/wiki/Istimewa:Kontribusi_saya" title="Daftar suntingan yang dibuat dari alamat IP ini [y]" accesskey="y"><span>Kontribusi</span></a></li><li id="pt-anontalk" class="mw-list-item"><a href="/wiki/Istimewa:Pembicaraan_saya" title="Pembicaraan tentang suntingan dari alamat IP ini [n]" accesskey="n"><span>Pembicaraan</span></a></li> </ul> </div> </div> </div> </div> </nav> </div> </header> </div> <div class="mw-page-container"> <div class="mw-page-container-inner"> <div class="vector-sitenotice-container"> <div id="siteNotice"><!-- CentralNotice --></div> </div> <div class="vector-column-start"> <div class="vector-main-menu-container"> <div id="mw-navigation"> <nav id="mw-panel" class="vector-main-menu-landmark" aria-label="Situs"> <div id="vector-main-menu-pinned-container" class="vector-pinned-container"> </div> </nav> </div> </div> <div class="vector-sticky-pinned-container"> <nav id="mw-panel-toc" aria-label="Daftar isi" data-event-name="ui.sidebar-toc" class="mw-table-of-contents-container vector-toc-landmark"> <div id="vector-toc-pinned-container" class="vector-pinned-container"> <div id="vector-toc" class="vector-toc vector-pinnable-element"> <div class="vector-pinnable-header vector-toc-pinnable-header vector-pinnable-header-pinned" data-feature-name="toc-pinned" data-pinnable-element-id="vector-toc" > <h2 class="vector-pinnable-header-label">Daftar isi</h2> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-toc.pin">pindah ke bilah sisi</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-toc.unpin">sembunyikan</button> </div> <ul class="vector-toc-contents" id="mw-panel-toc-list"> <li id="toc-mw-content-text" class="vector-toc-list-item vector-toc-level-1"> <a href="#" class="vector-toc-link"> <div class="vector-toc-text">Awal</div> </a> </li> <li id="toc-Pencarian_Uninformed" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Pencarian_Uninformed"> <div class="vector-toc-text"> <span class="vector-toc-numb">1</span> <span>Pencarian <i>Uninformed</i></span> </div> </a> <button aria-controls="toc-Pencarian_Uninformed-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> <span class="vector-icon mw-ui-icon-wikimedia-expand"></span> <span>Gulingkan subbagian Pencarian <i>Uninformed</i></span> </button> <ul id="toc-Pencarian_Uninformed-sublist" class="vector-toc-list"> <li id="toc-Pencarian_List" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Pencarian_List"> <div class="vector-toc-text"> <span class="vector-toc-numb">1.1</span> <span>Pencarian List</span> </div> </a> <ul id="toc-Pencarian_List-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Pencarian_Pohon" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Pencarian_Pohon"> <div class="vector-toc-text"> <span class="vector-toc-numb">1.2</span> <span>Pencarian Pohon</span> </div> </a> <ul id="toc-Pencarian_Pohon-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Pencarian_Graf" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Pencarian_Graf"> <div class="vector-toc-text"> <span class="vector-toc-numb">1.3</span> <span>Pencarian Graf</span> </div> </a> <ul id="toc-Pencarian_Graf-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-Pencarian_Informed" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Pencarian_Informed"> <div class="vector-toc-text"> <span class="vector-toc-numb">2</span> <span>Pencarian <i>Informed</i></span> </div> </a> <ul id="toc-Pencarian_Informed-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Pencarian_Adversarial" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Pencarian_Adversarial"> <div class="vector-toc-text"> <span class="vector-toc-numb">3</span> <span>Pencarian Adversarial</span> </div> </a> <ul id="toc-Pencarian_Adversarial-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Pemenuhan_Kendala" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Pemenuhan_Kendala"> <div class="vector-toc-text"> <span class="vector-toc-numb">4</span> <span>Pemenuhan Kendala</span> </div> </a> <ul id="toc-Pemenuhan_Kendala-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Pencarian_Interpolasi" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Pencarian_Interpolasi"> <div class="vector-toc-text"> <span class="vector-toc-numb">5</span> <span>Pencarian Interpolasi</span> </div> </a> <ul id="toc-Pencarian_Interpolasi-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Jenis_Lain" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Jenis_Lain"> <div class="vector-toc-text"> <span class="vector-toc-numb">6</span> <span>Jenis Lain</span> </div> </a> <ul id="toc-Jenis_Lain-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Lihat_pula" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Lihat_pula"> <div class="vector-toc-text"> <span class="vector-toc-numb">7</span> <span>Lihat pula</span> </div> </a> <ul id="toc-Lihat_pula-sublist" class="vector-toc-list"> </ul> </li> </ul> </div> </div> </nav> </div> </div> <div class="mw-content-container"> <main id="content" class="mw-body"> <header class="mw-body-header vector-page-titlebar"> <nav aria-label="Daftar isi" class="vector-toc-landmark"> <div id="vector-page-titlebar-toc" class="vector-dropdown vector-page-titlebar-toc vector-button-flush-left" > <input type="checkbox" id="vector-page-titlebar-toc-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-titlebar-toc" class="vector-dropdown-checkbox " aria-label="Gulingkan daftar isi" > <label id="vector-page-titlebar-toc-label" for="vector-page-titlebar-toc-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-listBullet mw-ui-icon-wikimedia-listBullet"></span> <span class="vector-dropdown-label-text">Gulingkan daftar isi</span> </label> <div class="vector-dropdown-content"> <div id="vector-page-titlebar-toc-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <h1 id="firstHeading" class="firstHeading mw-first-heading"><span class="mw-page-title-main">Algoritma pencarian</span></h1> <div id="p-lang-btn" class="vector-dropdown mw-portlet mw-portlet-lang" > <input type="checkbox" id="p-lang-btn-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-p-lang-btn" class="vector-dropdown-checkbox mw-interlanguage-selector" aria-label="Pergi ke artikel dalam bahasa lain. Terdapat 31 bahasa" > <label id="p-lang-btn-label" for="p-lang-btn-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--action-progressive mw-portlet-lang-heading-31" aria-hidden="true" ><span class="vector-icon mw-ui-icon-language-progressive mw-ui-icon-wikimedia-language-progressive"></span> <span class="vector-dropdown-label-text">31 bahasa</span> </label> <div class="vector-dropdown-content"> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li class="interlanguage-link interwiki-ar mw-list-item"><a href="https://ar.wikipedia.org/wiki/%D8%AE%D9%88%D8%A7%D8%B1%D8%B2%D9%85%D9%8A%D8%A9_%D8%A8%D8%AD%D8%AB" title="خوارزمية بحث – Arab" lang="ar" hreflang="ar" data-title="خوارزمية بحث" data-language-autonym="العربية" data-language-local-name="Arab" class="interlanguage-link-target"><span>العربية</span></a></li><li class="interlanguage-link interwiki-az mw-list-item"><a href="https://az.wikipedia.org/wiki/Axtar%C4%B1%C5%9F_alqoritml%C9%99ri" title="Axtarış alqoritmləri – Azerbaijani" lang="az" hreflang="az" data-title="Axtarış alqoritmləri" data-language-autonym="Azərbaycanca" data-language-local-name="Azerbaijani" class="interlanguage-link-target"><span>Azərbaycanca</span></a></li><li class="interlanguage-link interwiki-bg mw-list-item"><a href="https://bg.wikipedia.org/wiki/%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D1%8A%D0%BC_%D0%B7%D0%B0_%D1%82%D1%8A%D1%80%D1%81%D0%B5%D0%BD%D0%B5" title="Алгоритъм за търсене – Bulgaria" lang="bg" hreflang="bg" data-title="Алгоритъм за търсене" data-language-autonym="Български" data-language-local-name="Bulgaria" class="interlanguage-link-target"><span>Български</span></a></li><li class="interlanguage-link interwiki-bn mw-list-item"><a href="https://bn.wikipedia.org/wiki/%E0%A6%85%E0%A6%A8%E0%A7%81%E0%A6%B8%E0%A6%A8%E0%A7%8D%E0%A6%A7%E0%A6%BE%E0%A6%A8_%E0%A6%85%E0%A7%8D%E0%A6%AF%E0%A6%BE%E0%A6%B2%E0%A6%97%E0%A7%8B%E0%A6%B0%E0%A6%BF%E0%A6%A6%E0%A6%AE" title="অনুসন্ধান অ্যালগোরিদম – Bengali" lang="bn" hreflang="bn" data-title="অনুসন্ধান অ্যালগোরিদম" data-language-autonym="বাংলা" data-language-local-name="Bengali" class="interlanguage-link-target"><span>বাংলা</span></a></li><li class="interlanguage-link interwiki-ca mw-list-item"><a href="https://ca.wikipedia.org/wiki/Algorisme_de_cerca" title="Algorisme de cerca – Katalan" lang="ca" hreflang="ca" data-title="Algorisme de cerca" data-language-autonym="Català" data-language-local-name="Katalan" class="interlanguage-link-target"><span>Català</span></a></li><li class="interlanguage-link interwiki-da mw-list-item"><a href="https://da.wikipedia.org/wiki/S%C3%B8gealgoritme" title="Søgealgoritme – Dansk" lang="da" hreflang="da" data-title="Søgealgoritme" data-language-autonym="Dansk" data-language-local-name="Dansk" class="interlanguage-link-target"><span>Dansk</span></a></li><li class="interlanguage-link interwiki-de mw-list-item"><a href="https://de.wikipedia.org/wiki/Suchverfahren" title="Suchverfahren – Jerman" lang="de" hreflang="de" data-title="Suchverfahren" data-language-autonym="Deutsch" data-language-local-name="Jerman" class="interlanguage-link-target"><span>Deutsch</span></a></li><li class="interlanguage-link interwiki-el mw-list-item"><a href="https://el.wikipedia.org/wiki/%CE%91%CE%BB%CE%B3%CF%8C%CF%81%CE%B9%CE%B8%CE%BC%CE%BF%CF%82_%CE%B1%CE%BD%CE%B1%CE%B6%CE%AE%CF%84%CE%B7%CF%83%CE%B7%CF%82" title="Αλγόριθμος αναζήτησης – Yunani" lang="el" hreflang="el" data-title="Αλγόριθμος αναζήτησης" data-language-autonym="Ελληνικά" data-language-local-name="Yunani" class="interlanguage-link-target"><span>Ελληνικά</span></a></li><li class="interlanguage-link interwiki-en mw-list-item"><a href="https://en.wikipedia.org/wiki/Search_algorithm" title="Search algorithm – Inggris" lang="en" hreflang="en" data-title="Search algorithm" data-language-autonym="English" data-language-local-name="Inggris" class="interlanguage-link-target"><span>English</span></a></li><li class="interlanguage-link interwiki-es mw-list-item"><a href="https://es.wikipedia.org/wiki/Algoritmo_de_b%C3%BAsqueda" title="Algoritmo de búsqueda – Spanyol" lang="es" hreflang="es" data-title="Algoritmo de búsqueda" data-language-autonym="Español" data-language-local-name="Spanyol" class="interlanguage-link-target"><span>Español</span></a></li><li class="interlanguage-link interwiki-fa mw-list-item"><a href="https://fa.wikipedia.org/wiki/%D8%A7%D9%84%DA%AF%D9%88%D8%B1%DB%8C%D8%AA%D9%85_%D8%AC%D8%B3%D8%AA%D8%AC%D9%88" title="الگوریتم جستجو – Persia" lang="fa" hreflang="fa" data-title="الگوریتم جستجو" data-language-autonym="فارسی" data-language-local-name="Persia" class="interlanguage-link-target"><span>فارسی</span></a></li><li class="interlanguage-link interwiki-fi mw-list-item"><a href="https://fi.wikipedia.org/wiki/Hakualgoritmi" title="Hakualgoritmi – Suomi" lang="fi" hreflang="fi" data-title="Hakualgoritmi" data-language-autonym="Suomi" data-language-local-name="Suomi" class="interlanguage-link-target"><span>Suomi</span></a></li><li class="interlanguage-link interwiki-fr mw-list-item"><a href="https://fr.wikipedia.org/wiki/Algorithme_de_recherche" title="Algorithme de recherche – Prancis" lang="fr" hreflang="fr" data-title="Algorithme de recherche" data-language-autonym="Français" data-language-local-name="Prancis" class="interlanguage-link-target"><span>Français</span></a></li><li class="interlanguage-link interwiki-he mw-list-item"><a href="https://he.wikipedia.org/wiki/%D7%90%D7%9C%D7%92%D7%95%D7%A8%D7%99%D7%AA%D7%9D_%D7%97%D7%99%D7%A4%D7%95%D7%A9" title="אלגוריתם חיפוש – Ibrani" lang="he" hreflang="he" data-title="אלגוריתם חיפוש" data-language-autonym="עברית" data-language-local-name="Ibrani" class="interlanguage-link-target"><span>עברית</span></a></li><li class="interlanguage-link interwiki-hu mw-list-item"><a href="https://hu.wikipedia.org/wiki/Keres%C5%91algoritmus" title="Keresőalgoritmus – Hungaria" lang="hu" hreflang="hu" data-title="Keresőalgoritmus" data-language-autonym="Magyar" data-language-local-name="Hungaria" class="interlanguage-link-target"><span>Magyar</span></a></li><li class="interlanguage-link interwiki-hy mw-list-item"><a href="https://hy.wikipedia.org/wiki/%D4%BB%D5%B6%D6%86%D5%B8%D6%80%D5%B4%D5%A1%D6%81%D5%AB%D5%B8%D5%B6_%D6%83%D5%B6%D5%BF%D6%80%D5%B8%D6%82%D5%B4" title="Ինֆորմացիոն փնտրում – Armenia" lang="hy" hreflang="hy" data-title="Ինֆորմացիոն փնտրում" data-language-autonym="Հայերեն" data-language-local-name="Armenia" class="interlanguage-link-target"><span>Հայերեն</span></a></li><li class="interlanguage-link interwiki-ia mw-list-item"><a href="https://ia.wikipedia.org/wiki/Algorithmo_de_recerca" title="Algorithmo de recerca – Interlingua" lang="ia" hreflang="ia" data-title="Algorithmo de recerca" data-language-autonym="Interlingua" data-language-local-name="Interlingua" class="interlanguage-link-target"><span>Interlingua</span></a></li><li class="interlanguage-link interwiki-it mw-list-item"><a href="https://it.wikipedia.org/wiki/Algoritmo_di_ricerca" title="Algoritmo di ricerca – Italia" lang="it" hreflang="it" data-title="Algoritmo di ricerca" data-language-autonym="Italiano" data-language-local-name="Italia" class="interlanguage-link-target"><span>Italiano</span></a></li><li class="interlanguage-link interwiki-ja mw-list-item"><a href="https://ja.wikipedia.org/wiki/%E6%8E%A2%E7%B4%A2" title="探索 – Jepang" lang="ja" hreflang="ja" data-title="探索" data-language-autonym="日本語" data-language-local-name="Jepang" class="interlanguage-link-target"><span>日本語</span></a></li><li class="interlanguage-link interwiki-ko mw-list-item"><a href="https://ko.wikipedia.org/wiki/%EA%B2%80%EC%83%89_%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98" title="검색 알고리즘 – Korea" lang="ko" hreflang="ko" data-title="검색 알고리즘" data-language-autonym="한국어" data-language-local-name="Korea" class="interlanguage-link-target"><span>한국어</span></a></li><li class="interlanguage-link interwiki-ms mw-list-item"><a href="https://ms.wikipedia.org/wiki/Algoritma_gelintar" title="Algoritma gelintar – Melayu" lang="ms" hreflang="ms" data-title="Algoritma gelintar" data-language-autonym="Bahasa Melayu" data-language-local-name="Melayu" class="interlanguage-link-target"><span>Bahasa Melayu</span></a></li><li class="interlanguage-link interwiki-nl mw-list-item"><a href="https://nl.wikipedia.org/wiki/Zoekalgoritme" title="Zoekalgoritme – Belanda" lang="nl" hreflang="nl" data-title="Zoekalgoritme" data-language-autonym="Nederlands" data-language-local-name="Belanda" class="interlanguage-link-target"><span>Nederlands</span></a></li><li class="interlanguage-link interwiki-pt mw-list-item"><a href="https://pt.wikipedia.org/wiki/Algoritmo_de_busca" title="Algoritmo de busca – Portugis" lang="pt" hreflang="pt" data-title="Algoritmo de busca" data-language-autonym="Português" data-language-local-name="Portugis" class="interlanguage-link-target"><span>Português</span></a></li><li class="interlanguage-link interwiki-simple mw-list-item"><a href="https://simple.wikipedia.org/wiki/Search_algorithm" title="Search algorithm – Simple English" lang="en-simple" hreflang="en-simple" data-title="Search algorithm" data-language-autonym="Simple English" data-language-local-name="Simple English" class="interlanguage-link-target"><span>Simple English</span></a></li><li class="interlanguage-link interwiki-sr mw-list-item"><a href="https://sr.wikipedia.org/wiki/%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC%D0%B8_%D0%BF%D1%80%D0%B5%D1%82%D1%80%D0%B0%D0%B6%D0%B8%D0%B2%D0%B0%D1%9A%D0%B0" title="Алгоритми претраживања – Serbia" lang="sr" hreflang="sr" data-title="Алгоритми претраживања" data-language-autonym="Српски / srpski" data-language-local-name="Serbia" class="interlanguage-link-target"><span>Српски / srpski</span></a></li><li class="interlanguage-link interwiki-th mw-list-item"><a href="https://th.wikipedia.org/wiki/%E0%B8%82%E0%B8%B1%E0%B9%89%E0%B8%99%E0%B8%95%E0%B8%AD%E0%B8%99%E0%B8%A7%E0%B8%B4%E0%B8%98%E0%B8%B5%E0%B8%81%E0%B8%B2%E0%B8%A3%E0%B8%84%E0%B9%89%E0%B8%99%E0%B8%AB%E0%B8%B2" title="ขั้นตอนวิธีการค้นหา – Thai" lang="th" hreflang="th" data-title="ขั้นตอนวิธีการค้นหา" data-language-autonym="ไทย" data-language-local-name="Thai" class="interlanguage-link-target"><span>ไทย</span></a></li><li class="interlanguage-link interwiki-tr mw-list-item"><a href="https://tr.wikipedia.org/wiki/Arama_algoritmas%C4%B1" title="Arama algoritması – Turki" lang="tr" hreflang="tr" data-title="Arama algoritması" data-language-autonym="Türkçe" data-language-local-name="Turki" class="interlanguage-link-target"><span>Türkçe</span></a></li><li class="interlanguage-link interwiki-uk mw-list-item"><a href="https://uk.wikipedia.org/wiki/%D0%90%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC_%D0%BF%D0%BE%D1%88%D1%83%D0%BA%D1%83" title="Алгоритм пошуку – Ukraina" lang="uk" hreflang="uk" data-title="Алгоритм пошуку" data-language-autonym="Українська" data-language-local-name="Ukraina" class="interlanguage-link-target"><span>Українська</span></a></li><li class="interlanguage-link interwiki-vi mw-list-item"><a href="https://vi.wikipedia.org/wiki/Gi%E1%BA%A3i_thu%E1%BA%ADt_t%C3%ACm_ki%E1%BA%BFm" title="Giải thuật tìm kiếm – Vietnam" lang="vi" hreflang="vi" data-title="Giải thuật tìm kiếm" data-language-autonym="Tiếng Việt" data-language-local-name="Vietnam" class="interlanguage-link-target"><span>Tiếng Việt</span></a></li><li class="interlanguage-link interwiki-zh mw-list-item"><a href="https://zh.wikipedia.org/wiki/%E6%90%9C%E7%B4%A2%E7%AE%97%E6%B3%95" title="搜索算法 – Tionghoa" lang="zh" hreflang="zh" data-title="搜索算法" data-language-autonym="中文" data-language-local-name="Tionghoa" class="interlanguage-link-target"><span>中文</span></a></li><li class="interlanguage-link interwiki-zh-yue mw-list-item"><a href="https://zh-yue.wikipedia.org/wiki/%E6%90%9C%E5%B0%8B%E6%BC%94%E7%AE%97%E6%B3%95" title="搜尋演算法 – Kanton" lang="yue" hreflang="yue" data-title="搜尋演算法" data-language-autonym="粵語" data-language-local-name="Kanton" class="interlanguage-link-target"><span>粵語</span></a></li> </ul> <div class="after-portlet after-portlet-lang"><span class="wb-langlinks-edit wb-langlinks-link"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q755673#sitelinks-wikipedia" title="Sunting pranala interwiki" class="wbc-editpage">Sunting pranala</a></span></div> </div> </div> </div> </header> <div class="vector-page-toolbar"> <div class="vector-page-toolbar-container"> <div id="left-navigation"> <nav aria-label="Ruang nama"> <div id="p-associated-pages" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-associated-pages" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-nstab-main" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/Algoritma_pencarian" title="Lihat halaman isi [c]" accesskey="c"><span>Halaman</span></a></li><li id="ca-talk" class="new vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Pembicaraan:Algoritma_pencarian&action=edit&redlink=1" rel="discussion" class="new" title="Pembicaraan halaman isi (halaman belum tersedia) [t]" accesskey="t"><span>Pembicaraan</span></a></li> </ul> </div> </div> <div id="vector-variants-dropdown" class="vector-dropdown emptyPortlet" > <input type="checkbox" id="vector-variants-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-variants-dropdown" class="vector-dropdown-checkbox " aria-label="Ubah varian bahasa" > <label id="vector-variants-dropdown-label" for="vector-variants-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" ><span class="vector-dropdown-label-text">Bahasa Indonesia</span> </label> <div class="vector-dropdown-content"> <div id="p-variants" class="vector-menu mw-portlet mw-portlet-variants emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> </div> </div> </nav> </div> <div id="right-navigation" class="vector-collapsible"> <nav aria-label="Tampilan"> <div id="p-views" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-views" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-view" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/Algoritma_pencarian"><span>Baca</span></a></li><li id="ca-ve-edit" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Algoritma_pencarian&veaction=edit" title="Sunting halaman ini [v]" accesskey="v"><span>Sunting</span></a></li><li id="ca-edit" class="collapsible vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Algoritma_pencarian&action=edit" title="Sunting kode sumber halaman ini [e]" accesskey="e"><span>Sunting sumber</span></a></li><li id="ca-history" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=Algoritma_pencarian&action=history" title="Revisi sebelumnya dari halaman ini. [h]" accesskey="h"><span>Lihat riwayat</span></a></li> </ul> </div> </div> </nav> <nav class="vector-page-tools-landmark" aria-label="Peralatan halaman"> <div id="vector-page-tools-dropdown" class="vector-dropdown vector-page-tools-dropdown" > <input type="checkbox" id="vector-page-tools-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-tools-dropdown" class="vector-dropdown-checkbox " aria-label="Perkakas" > <label id="vector-page-tools-dropdown-label" for="vector-page-tools-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" ><span class="vector-dropdown-label-text">Perkakas</span> </label> <div class="vector-dropdown-content"> <div id="vector-page-tools-unpinned-container" class="vector-unpinned-container"> <div id="vector-page-tools" class="vector-page-tools vector-pinnable-element"> <div class="vector-pinnable-header vector-page-tools-pinnable-header vector-pinnable-header-unpinned" data-feature-name="page-tools-pinned" data-pinnable-element-id="vector-page-tools" data-pinned-container-id="vector-page-tools-pinned-container" data-unpinned-container-id="vector-page-tools-unpinned-container" > <div class="vector-pinnable-header-label">Perkakas</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-page-tools.pin">pindah ke bilah sisi</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-page-tools.unpin">sembunyikan</button> </div> <div id="p-cactions" class="vector-menu mw-portlet mw-portlet-cactions emptyPortlet vector-has-collapsible-items" title="Opsi lainnya" > <div class="vector-menu-heading"> Tindakan </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-more-view" class="selected vector-more-collapsible-item mw-list-item"><a href="/wiki/Algoritma_pencarian"><span>Baca</span></a></li><li id="ca-more-ve-edit" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Algoritma_pencarian&veaction=edit" title="Sunting halaman ini [v]" accesskey="v"><span>Sunting</span></a></li><li id="ca-more-edit" class="collapsible vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Algoritma_pencarian&action=edit" title="Sunting kode sumber halaman ini [e]" accesskey="e"><span>Sunting sumber</span></a></li><li id="ca-more-history" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=Algoritma_pencarian&action=history"><span>Lihat riwayat</span></a></li> </ul> </div> </div> <div id="p-tb" class="vector-menu mw-portlet mw-portlet-tb" > <div class="vector-menu-heading"> Umum </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="t-whatlinkshere" class="mw-list-item"><a href="/wiki/Istimewa:Pranala_balik/Algoritma_pencarian" title="Daftar semua halaman wiki yang memiliki pranala ke halaman ini [j]" accesskey="j"><span>Pranala balik</span></a></li><li id="t-recentchangeslinked" class="mw-list-item"><a href="/wiki/Istimewa:Perubahan_terkait/Algoritma_pencarian" rel="nofollow" title="Perubahan terbaru halaman-halaman yang memiliki pranala ke halaman ini [k]" accesskey="k"><span>Perubahan terkait</span></a></li><li id="t-specialpages" class="mw-list-item"><a href="/wiki/Istimewa:Halaman_istimewa" title="Daftar semua halaman istimewa [q]" accesskey="q"><span>Halaman istimewa</span></a></li><li id="t-permalink" class="mw-list-item"><a href="/w/index.php?title=Algoritma_pencarian&oldid=25389289" title="Pranala permanen untuk revisi halaman ini"><span>Pranala permanen</span></a></li><li id="t-info" class="mw-list-item"><a href="/w/index.php?title=Algoritma_pencarian&action=info" title="Informasi lanjut tentang halaman ini"><span>Informasi halaman</span></a></li><li id="t-cite" class="mw-list-item"><a href="/w/index.php?title=Istimewa:Kutip&page=Algoritma_pencarian&id=25389289&wpFormIdentifier=titleform" title="Informasi tentang bagaimana mengutip halaman ini"><span>Kutip halaman ini</span></a></li><li id="t-urlshortener" class="mw-list-item"><a href="/w/index.php?title=Istimewa:UrlShortener&url=https%3A%2F%2Fid.wikipedia.org%2Fwiki%2FAlgoritma_pencarian"><span>Lihat URL pendek</span></a></li><li id="t-urlshortener-qrcode" class="mw-list-item"><a href="/w/index.php?title=Istimewa:QrCode&url=https%3A%2F%2Fid.wikipedia.org%2Fwiki%2FAlgoritma_pencarian"><span>Unduh kode QR</span></a></li> </ul> </div> </div> <div id="p-coll-print_export" class="vector-menu mw-portlet mw-portlet-coll-print_export" > <div class="vector-menu-heading"> Cetak/ekspor </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="coll-create_a_book" class="mw-list-item"><a href="/w/index.php?title=Istimewa:Buku&bookcmd=book_creator&referer=Algoritma+pencarian"><span>Buat buku</span></a></li><li id="coll-download-as-rl" class="mw-list-item"><a href="/w/index.php?title=Istimewa:DownloadAsPdf&page=Algoritma_pencarian&action=show-download-screen"><span>Unduh versi PDF</span></a></li><li id="t-print" class="mw-list-item"><a href="/w/index.php?title=Algoritma_pencarian&printable=yes" title="Versi cetak halaman ini [p]" accesskey="p"><span>Versi cetak</span></a></li> </ul> </div> </div> <div id="p-wikibase-otherprojects" class="vector-menu mw-portlet mw-portlet-wikibase-otherprojects" > <div class="vector-menu-heading"> Dalam proyek lain </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li class="wb-otherproject-link wb-otherproject-commons mw-list-item"><a href="https://commons.wikimedia.org/wiki/Category:Search_algorithms" hreflang="en"><span>Wikimedia Commons</span></a></li><li id="t-wikibase" class="wb-otherproject-link wb-otherproject-wikibase-dataitem mw-list-item"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q755673" title="Pranala untuk menghubungkan butir pada ruang penyimpanan data [g]" accesskey="g"><span>Butir di Wikidata</span></a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> </div> </div> </div> <div class="vector-column-end"> <div class="vector-sticky-pinned-container"> <nav class="vector-page-tools-landmark" aria-label="Peralatan halaman"> <div id="vector-page-tools-pinned-container" class="vector-pinned-container"> </div> </nav> <nav class="vector-appearance-landmark" aria-label="Tampilan"> <div id="vector-appearance-pinned-container" class="vector-pinned-container"> <div id="vector-appearance" class="vector-appearance vector-pinnable-element"> <div class="vector-pinnable-header vector-appearance-pinnable-header vector-pinnable-header-pinned" data-feature-name="appearance-pinned" data-pinnable-element-id="vector-appearance" data-pinned-container-id="vector-appearance-pinned-container" data-unpinned-container-id="vector-appearance-unpinned-container" > <div class="vector-pinnable-header-label">Tampilan</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-appearance.pin">pindah ke bilah sisi</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-appearance.unpin">sembunyikan</button> </div> </div> </div> </nav> </div> </div> <div id="bodyContent" class="vector-body" aria-labelledby="firstHeading" data-mw-ve-target-container> <div class="vector-body-before-content"> <div class="mw-indicators"> </div> <div id="siteSub" class="noprint">Dari Wikipedia bahasa Indonesia, ensiklopedia bebas</div> </div> <div id="contentSub"><div id="mw-content-subtitle"></div></div> <div id="mw-content-text" class="mw-body-content"><div class="mw-content-ltr mw-parser-output" lang="id" dir="ltr"><p>Dalam <a href="/wiki/Ilmu_komputer" title="Ilmu komputer">ilmu komputer</a>, sebuah <b>algoritme pencarian</b> dijelaskan secara luas adalah sebuah algoritme yang menerima <a href="/w/index.php?title=Masukan&action=edit&redlink=1" class="new" title="Masukan (halaman belum tersedia)">masukan</a> berupa sebuah masalah dan menghasilkan sebuah solusi untuk masalah tersebut, yang biasanya didapat dari evaluasi beberapa kemungkinan solusi. Sebagian besar algoritme yang dipelajari oleh ilmuwan komputer adalah algoritme pencarian. Himpunan semua kemungkinan solusi dari sebuah masalah disebut <a href="/w/index.php?title=Ruang_pencarian&action=edit&redlink=1" class="new" title="Ruang pencarian (halaman belum tersedia)">ruang pencarian</a>. Algoritme <a href="/w/index.php?title=Pencarian_brute-force&action=edit&redlink=1" class="new" title="Pencarian brute-force (halaman belum tersedia)">pencarian brute-force</a> atau pencarian naif/<i>uninformed</i> menggunakan metode yang sederhana dan sangat <a href="/w/index.php?title=Intuitif&action=edit&redlink=1" class="new" title="Intuitif (halaman belum tersedia)">intuitif</a> pada ruang pencarian, sedangkan algoritme pencarian <i>informed</i> menggunakan <a href="/wiki/Heuristik" class="mw-redirect" title="Heuristik">heuristik</a> untuk menerapkan pengetahuan tentang struktur dari ruang pencarian untuk berusaha mengurangi banyaknya waktu yang dipakai dalam pencarian. </p> <meta property="mw:PageProp/toc" /> <div class="mw-heading mw-heading2"><h2 id="Pencarian_Uninformed">Pencarian <i>Uninformed</i></h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Algoritma_pencarian&veaction=edit&section=1" title="Sunting bagian: Pencarian Uninformed" class="mw-editsection-visualeditor"><span>sunting</span></a><span class="mw-editsection-divider"> | </span><a href="/w/index.php?title=Algoritma_pencarian&action=edit&section=1" title="Sunting kode sumber bagian: Pencarian Uninformed"><span>sunting sumber</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Sebuah algoritme pencarian <i>uninformed</i> adalah algoritme yang tidak mempertimbangkan sifat alami dari permasalahan. Oleh karena itu algoritme tersebut dapat diimplementasikan secara umum, sehingga dengan implementasi yang sama dapat digunakan pada lingkup permasalahan yang luas, hal ini berkat <a href="/wiki/Abstraksi_(ilmu_komputer)" title="Abstraksi (ilmu komputer)">abstraksi</a>. Kekurangannya adalah sebagian besar <a href="/w/index.php?title=Ruang_pencarian&action=edit&redlink=1" class="new" title="Ruang pencarian (halaman belum tersedia)">ruang pencarian</a> adalah sangat besar, dan sebuah pencarian <i>uninformed</i> (khususnya untuk pohon) membutuhkan banyak waktu walaupun hanya untuk contoh yang kecil. Sehingga untuk mempercepat proses, kadang-kadang hanya pencarian <i>informed</i> yang dapat melakukannya. </p> <div class="mw-heading mw-heading3"><h3 id="Pencarian_List">Pencarian List</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Algoritma_pencarian&veaction=edit&section=2" title="Sunting bagian: Pencarian List" class="mw-editsection-visualeditor"><span>sunting</span></a><span class="mw-editsection-divider"> | </span><a href="/w/index.php?title=Algoritma_pencarian&action=edit&section=2" title="Sunting kode sumber bagian: Pencarian List"><span>sunting sumber</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Algoritme pencarian list mungkin adalah algoritme pencarian paling dasar. Tujuannya adalah mencari sebuah elemen dari sebuah himpunan dengan suatu kunci (kemungkinan memuat informasi yang terkait dengan kunci). Oleh karena hal ini adalah masalah yang lazim dalam <a href="/wiki/Ilmu_komputer" title="Ilmu komputer">ilmu komputer</a>, <a href="/w/index.php?title=Kompleksitas_komputasi&action=edit&redlink=1" class="new" title="Kompleksitas komputasi (halaman belum tersedia)">kompleksitas komputasi</a> algoritme-algoritme tersebut telah dipelajari dengan baik. Algoritme paling sederhana adalah <a href="/wiki/Pencarian_linear" title="Pencarian linear">pencarian linear</a>, yang secara sederhana melihat setiap elemen dari list secara berurutan. <a href="/w/index.php?title=Waktu_pengerjaan&action=edit&redlink=1" class="new" title="Waktu pengerjaan (halaman belum tersedia)">Waktu pengerjaan</a> algoritme ini adalah <a href="/wiki/Notasi_O_besar" title="Notasi O besar">O</a>(<i>n</i>), dimana <i>n</i> adalah banyaknya elemen dalam list, dan dapat digunakan langsung pada list yang belum diproses. Algoritme pencarian list yang lebih canggih adalah <a href="/wiki/Pencarian_biner" class="mw-redirect" title="Pencarian biner">pencarian biner</a>; waktu pengerjaannya adalah <a href="/wiki/Notasi_O_besar" title="Notasi O besar">O</a>(log <i>n</i>). Waktu pengerjaannya jauh lebih baik daripada <a href="/wiki/Pencarian_linear" title="Pencarian linear">pencarian linear</a> untuk list yang memiliki data banyak, tetapi sebelum dilakukan pencarian list terlebih dahulu harus terurut (lihat <a href="/w/index.php?title=Algoritme_pengurutan&action=edit&redlink=1" class="new" title="Algoritme pengurutan (halaman belum tersedia)">algoritme pengurutan</a>) dan juga harus dapat diakses secara acak (<a href="/w/index.php?title=Pengaksesan_acak&action=edit&redlink=1" class="new" title="Pengaksesan acak (halaman belum tersedia)">pengaksesan acak</a>). <a href="/w/index.php?title=Pencarian_interpolasi&action=edit&redlink=1" class="new" title="Pencarian interpolasi (halaman belum tersedia)">Pencarian interpolasi</a> adalah lebih baik dari pencarian biner untuk list terurut yang sangat besar dan terdistribusi merata. <a href="/w/index.php?title=Algoritme_Grover&action=edit&redlink=1" class="new" title="Algoritme Grover (halaman belum tersedia)">Algoritme Grover</a> adalah sebuah <a href="/wiki/Komputer_kuantum" title="Komputer kuantum">algoritme kuantum</a> yang menawarkan percepatan kuadrat dibandingkan pencarian linear klasik untuk list tak terurut. </p><p><a href="/wiki/Tabel_hash" title="Tabel hash">Tabel hash</a> juga digunakan untuk pencarian list, hanya memerlukan waktu yang konstan untuk mencari pada kasus rata-rata, tetapi memiliki <i>overhead</i> ruang yang lebih dan pada kasus terburuk waktu pengerjaannya adalah O(<i>n</i>). Pencarian lain yang berdasarkan struktur data khusus, menggunakan pohon pencarian biner yang <i>self-balancing</i> (<a href="/w/index.php?title=Self-balancing_binary_search_tree&action=edit&redlink=1" class="new" title="Self-balancing binary search tree (halaman belum tersedia)">self-balancing binary search tree</a>) dan membutuhkan waktu pencarian O(log <i>n</i>); hal ini dapat dipandang sebagai pengembangan dari ide utama pencarian biner untuk memungkinkan penyisipan dan penghapusan yang cepat. Lihat <a href="/w/index.php?title=Array_asosiatif&action=edit&redlink=1" class="new" title="Array asosiatif (halaman belum tersedia)">array asosiatif</a> untuk diskusi lanjut dari struktur data pencarian list. </p><p>Sebagian besar algoritme pencarian, seperti pencarian linear, pencarian biner dan pohon pencarian biner yang <i>self-balancing</i>, dapat dikembangkan dengan sedikit tambahan <i>cost</i> untuk menemukan semua nilai yang kurang dari atau lebih dari sebuah kunci, operasi ini disebut pencarian jangkauan (<i>range search</i>). Pengecualian ada pada tabel hash, yang tidak dapat melakukan pencarian tersebut secara efisien. </p> <div class="mw-heading mw-heading3"><h3 id="Pencarian_Pohon">Pencarian Pohon</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Algoritma_pencarian&veaction=edit&section=3" title="Sunting bagian: Pencarian Pohon" class="mw-editsection-visualeditor"><span>sunting</span></a><span class="mw-editsection-divider"> | </span><a href="/w/index.php?title=Algoritma_pencarian&action=edit&section=3" title="Sunting kode sumber bagian: Pencarian Pohon"><span>sunting sumber</span></a><span class="mw-editsection-bracket">]</span></span></div> <p><a href="/w/index.php?title=Algoritme_pencarian_pohon&action=edit&redlink=1" class="new" title="Algoritme pencarian pohon (halaman belum tersedia)">Algoritme pencarian pohon</a> adalah jantung dari teknik-teknik pencarian. Algoritme tersebut mencari node dari <a href="/wiki/Pohon_(teori_graf)" title="Pohon (teori graf)">pohon</a>, terlepas apakah pohon tersebut eksplisit atau implisit (dibangkitkan saat pengerjaan). Prinsip dasarnya adalah sebuah <a href="/w/index.php?title=Node_(ilmu_komputer)&action=edit&redlink=1" class="new" title="Node (ilmu komputer) (halaman belum tersedia)">node</a> diambil dari sebuah <a href="/wiki/Struktur_data" title="Struktur data">struktur data</a>, suksesornya diperiksa dan ditambahkan pada struktur data. Dengan memanipulasi struktur data, pohon ditelusuri dalam urutan yang berbeda-beda, ditelusuri dari satu tingkat ke tingkat berikutnya (<a href="/w/index.php?title=Pencarian_Breadth-first&action=edit&redlink=1" class="new" title="Pencarian Breadth-first (halaman belum tersedia)">pencarian Breadth-first</a>) atau mengunjungi <a href="/w/index.php?title=Node_pucuk&action=edit&redlink=1" class="new" title="Node pucuk (halaman belum tersedia)">node pucuk</a> terlebih dahulu kemudian lacak balik/<i>backtracking</i> (<a href="/w/index.php?title=Pencarian_Depth-first&action=edit&redlink=1" class="new" title="Pencarian Depth-first (halaman belum tersedia)">pencarian Depth-first</a>). Contoh lain dari pencarian pohon antara lain <a href="/w/index.php?title=Pencarian_iterative_deepening_depth-first&action=edit&redlink=1" class="new" title="Pencarian iterative deepening depth-first (halaman belum tersedia)">pencarian iterative-deepening</a>, <a href="/w/index.php?title=Pencarian_berbatas_kedalaman&action=edit&redlink=1" class="new" title="Pencarian berbatas kedalaman (halaman belum tersedia)">pencarian berbatas kedalaman</a>, <a href="/w/index.php?title=Pencarian_dwiarah&action=edit&redlink=1" class="new" title="Pencarian dwiarah (halaman belum tersedia)">pencarian dwiarah</a> dan <a href="/w/index.php?title=Pencarian_uniform-cost&action=edit&redlink=1" class="new" title="Pencarian uniform-cost (halaman belum tersedia)">pencarian uniform-cost</a>. </p> <div class="mw-heading mw-heading3"><h3 id="Pencarian_Graf">Pencarian Graf</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Algoritma_pencarian&veaction=edit&section=4" title="Sunting bagian: Pencarian Graf" class="mw-editsection-visualeditor"><span>sunting</span></a><span class="mw-editsection-divider"> | </span><a href="/w/index.php?title=Algoritma_pencarian&action=edit&section=4" title="Sunting kode sumber bagian: Pencarian Graf"><span>sunting sumber</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Banyak permasalahan dalam <a href="/wiki/Teori_graf" title="Teori graf">teori graf</a> dapat dipecahkan dengan memanfaatkan algoritme pencarian, seperti <a href="/wiki/Algoritme_Dijkstra" class="mw-redirect" title="Algoritme Dijkstra">algoritme Dijkstra</a>, <a href="/w/index.php?title=Algoritme_Kruskal%27s&action=edit&redlink=1" class="new" title="Algoritme Kruskal's (halaman belum tersedia)">algoritme Kruskal's</a>, <a href="/w/index.php?title=Algoritme_tetangga_terdekat&action=edit&redlink=1" class="new" title="Algoritme tetangga terdekat (halaman belum tersedia)">algoritme tetangga terdekat</a>, dan <a href="/wiki/Algoritme_Prim" class="mw-redirect" title="Algoritme Prim">algoritme Prim</a>.-first|pencarian iterative-deepening]], <a href="/w/index.php?title=Pencarian_berbatas_kedalaman&action=edit&redlink=1" class="new" title="Pencarian berbatas kedalaman (halaman belum tersedia)">pencarian berbatas kedalaman</a>, <a href="/w/index.php?title=Pencarian_dwiarah&action=edit&redlink=1" class="new" title="Pencarian dwiarah (halaman belum tersedia)">pencarian dwiarah</a> dan <a href="/w/index.php?title=Pencarian_uniform-cost&action=edit&redlink=1" class="new" title="Pencarian uniform-cost (halaman belum tersedia)">pencarian uniform-cost</a>. </p> <div class="mw-heading mw-heading2"><h2 id="Pencarian_Informed">Pencarian <i>Informed</i></h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Algoritma_pencarian&veaction=edit&section=5" title="Sunting bagian: Pencarian Informed" class="mw-editsection-visualeditor"><span>sunting</span></a><span class="mw-editsection-divider"> | </span><a href="/w/index.php?title=Algoritma_pencarian&action=edit&section=5" title="Sunting kode sumber bagian: Pencarian Informed"><span>sunting sumber</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Pada pencarian <i>informed</i>, sebuah <a href="/wiki/Heuristik" class="mw-redirect" title="Heuristik">heuristik</a> yang khusus untuk permasalahan tertentu digunakan sebagai pedoman. Sebuah heuristik yang baik dapat membuat sebuah pencarian <i>informed</i> bekerja secara dramatis melebihi pencarian <i>uninformed</i>. </p><p>Terdapat beberapa algoritme pencarian list <i>informed</i> yang dikenali. Salah satu anggota dari algoritme tersebut adalah sebuah tabel hash dengan sebuah fungsi <i>hashing</i>, yaitu algoritme dengan heuristik yang berdasarkan pada permasalahan yang dihadapi. Sebagian besar algoritme <i>informed</i> adalah mengeksplore pohon. Termasuk di dalamnya adalah <a href="/w/index.php?title=Pencarian_Breadth-first&action=edit&redlink=1" class="new" title="Pencarian Breadth-first (halaman belum tersedia)">pencarian Breadth-first</a>, dan <a href="/w/index.php?title=Algoritme_Pencarian_A_Bintang&action=edit&redlink=1" class="new" title="Algoritme Pencarian A Bintang (halaman belum tersedia)">A*</a>. Sebagaimana algoritme <i>uninformed</i>, algoritme <i>informed</i> dapat dikembangkan untuk bekerja pada graf. </p> <div class="mw-heading mw-heading2"><h2 id="Pencarian_Adversarial">Pencarian Adversarial</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Algoritma_pencarian&veaction=edit&section=6" title="Sunting bagian: Pencarian Adversarial" class="mw-editsection-visualeditor"><span>sunting</span></a><span class="mw-editsection-divider"> | </span><a href="/w/index.php?title=Algoritma_pencarian&action=edit&section=6" title="Sunting kode sumber bagian: Pencarian Adversarial"><span>sunting sumber</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Dalam permainan seperti <a href="/wiki/Catur" title="Catur">catur</a>, terdapat sebuah <a href="/w/index.php?title=Pohon_permainan&action=edit&redlink=1" class="new" title="Pohon permainan (halaman belum tersedia)">pohon permainan</a> dari semua kemungkinan gerak dari kedua pemain dan konfigurasi hasil dari papan catur, dan kita dapat mencari pada pohon tersebut untuk menemukan strategi permainan yang efektif. Tipe permasalahan ini memiliki karakteristik unik yang mengharuskan kita memperhatikan semua kemungkinan gerak dari lawan yang mungkin terjadi. Untuk melakukannya, program permainan komputer, atau bentuk lain dari <a href="/wiki/Kecerdasan_buatan" title="Kecerdasan buatan">kecerdasan buatan</a> seperti <a href="/w/index.php?title=Perencanaan_mesin&action=edit&redlink=1" class="new" title="Perencanaan mesin (halaman belum tersedia)">perencanaan mesin</a>, biasanya menggunakan algoritme pencarian seperti <a href="/w/index.php?title=Algoritme_minimaks&action=edit&redlink=1" class="new" title="Algoritme minimaks (halaman belum tersedia)">algoritme minimaks</a>, <a href="/w/index.php?title=Pemangkasan_pohon_pencarian&action=edit&redlink=1" class="new" title="Pemangkasan pohon pencarian (halaman belum tersedia)">pemangkasan pohon pencarian</a> dan <a href="/w/index.php?title=Pemangkasan_alpha-beta&action=edit&redlink=1" class="new" title="Pemangkasan alpha-beta (halaman belum tersedia)">pemangkasan alpha-beta</a>. </p> <div class="mw-heading mw-heading2"><h2 id="Pemenuhan_Kendala">Pemenuhan Kendala</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Algoritma_pencarian&veaction=edit&section=7" title="Sunting bagian: Pemenuhan Kendala" class="mw-editsection-visualeditor"><span>sunting</span></a><span class="mw-editsection-divider"> | </span><a href="/w/index.php?title=Algoritma_pencarian&action=edit&section=7" title="Sunting kode sumber bagian: Pemenuhan Kendala"><span>sunting sumber</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Ini adalah satu jenis pencarian yang memecahkan <a href="/w/index.php?title=Permasalahan_pemenuhan_kendala&action=edit&redlink=1" class="new" title="Permasalahan pemenuhan kendala (halaman belum tersedia)">permasalahan pemenuhan kendala</a> dimana, bukan dengan melihat sebuah jalur, solusinya adalah sebuah himpunan nilai yang diberikan pada sebuah himpunan peubah. Karena peubah-peubah dapat diproses dengan urutan apa saja, algoritme pencarian pohon biasa adalah tidak efisien. Metode pemecahan permasalahan kendala memuat <a href="/w/index.php?title=Pencarian_kombinatorial&action=edit&redlink=1" class="new" title="Pencarian kombinatorial (halaman belum tersedia)">pencarian kombinatorial</a> dan <a href="/w/index.php?title=Lacak_balik&action=edit&redlink=1" class="new" title="Lacak balik (halaman belum tersedia)">lacak balik</a>, keduanya mengambil keuntungan dari kebebasan yang diasosiasikan dengan permasalahan kendala. </p> <div class="mw-heading mw-heading2"><h2 id="Pencarian_Interpolasi">Pencarian Interpolasi</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Algoritma_pencarian&veaction=edit&section=8" title="Sunting bagian: Pencarian Interpolasi" class="mw-editsection-visualeditor"><span>sunting</span></a><span class="mw-editsection-divider"> | </span><a href="/w/index.php?title=Algoritma_pencarian&action=edit&section=8" title="Sunting kode sumber bagian: Pencarian Interpolasi"><span>sunting sumber</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Bayangkan perihal mencari sebuah kata dalam sebuah kamus. Diberikan sembarang kata, anda memiliki beberapa ide perihal dimana membuka kamus untuk mendapatkan huruf pertama dari kata. Dari sana, anda akan memiliki ide untuk membuka beberapa halaman lagi untuk mendapatkan kota yang hampir mirip denan kata. Dan seterusnya, ini adalah ide dasar dari <a href="/w/index.php?title=Pencarian_interpolasi&action=edit&redlink=1" class="new" title="Pencarian interpolasi (halaman belum tersedia)">pencarian interpolasi</a>. </p> <div class="mw-heading mw-heading2"><h2 id="Jenis_Lain">Jenis Lain</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Algoritma_pencarian&veaction=edit&section=9" title="Sunting bagian: Jenis Lain" class="mw-editsection-visualeditor"><span>sunting</span></a><span class="mw-editsection-divider"> | </span><a href="/w/index.php?title=Algoritma_pencarian&action=edit&section=9" title="Sunting kode sumber bagian: Jenis Lain"><span>sunting sumber</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li><a href="/wiki/Algoritme_pencarian_string" class="mw-redirect" title="Algoritme pencarian string">Algoritme pencarian string</a> mencari pola dalam <a href="/w/index.php?title=String_(ilmu_komputer)&action=edit&redlink=1" class="new" title="String (ilmu komputer) (halaman belum tersedia)">string</a>; salah satu struktur data yang populer yang membuat lebih efisien adalah <a href="/wiki/Pohon_sufiks" title="Pohon sufiks">pohon sufiks</a>.</li> <li><a href="/w/index.php?title=Algoritme_genetika&action=edit&redlink=1" class="new" title="Algoritme genetika (halaman belum tersedia)">Algoritme genetika</a> menggunakan ide dari <a href="/wiki/Evolusi" title="Evolusi">evolusi</a> sebagai heuristik untuk mengurangi ruang pencarian.</li> <li><a href="/wiki/Simulated_annealing" title="Simulated annealing">Simulated annealing</a> adalah sebuah algoritme pencariaan <a href="/w/index.php?title=Probabilistik&action=edit&redlink=1" class="new" title="Probabilistik (halaman belum tersedia)">probabilistik</a>.</li> <li><a href="/w/index.php?title=Pencarian_Tabu&action=edit&redlink=1" class="new" title="Pencarian Tabu (halaman belum tersedia)">Pencarian Tabu</a> adalah sebuah teknik untuk mencekah pencarian diskrit menjadi terhenti pada minimum lokal.</li> <li><a href="/w/index.php?title=Pencarian_Federated&action=edit&redlink=1" class="new" title="Pencarian Federated (halaman belum tersedia)">Pencarian Federated</a></li></ul> <div class="mw-heading mw-heading2"><h2 id="Lihat_pula">Lihat pula</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=Algoritma_pencarian&veaction=edit&section=10" title="Sunting bagian: Lihat pula" class="mw-editsection-visualeditor"><span>sunting</span></a><span class="mw-editsection-divider"> | </span><a href="/w/index.php?title=Algoritma_pencarian&action=edit&section=10" title="Sunting kode sumber bagian: Lihat pula"><span>sunting sumber</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li><a href="/w/index.php?title=Algoritme_Pemilihan&action=edit&redlink=1" class="new" title="Algoritme Pemilihan (halaman belum tersedia)">Algoritme Pemilihan</a></li> <li><a href="/wiki/Teorema_tidak_ada_makan_siang_gratis" title="Teorema tidak ada makan siang gratis">Teorema tidak ada makan siang gratis</a> berhubungan dengan keumuman dari algoritme pencarian untuk kebutuhan pengetahuan ranah.</li> <li><a href="/w/index.php?title=Permasalahan_Sekretaris&action=edit&redlink=1" class="new" title="Permasalahan Sekretaris (halaman belum tersedia)">Permasalahan Sekretaris</a> adalah sebuah masalah pencarian online (yaitu dipresentasikan secara sekuens) dengan informasi tak lengkap, dan sebuah strategi statistik yang optimal.</li></ul> <!-- NewPP limit report Parsed by mw‐web.eqiad.main‐6fcbf9d8c6‐pxg6v Cached time: 20241031070123 Cache expiry: 2592000 Reduced expiry: false Complications: [show‐toc] CPU time usage: 0.015 seconds Real time usage: 0.022 seconds Preprocessor visited node count: 96/1000000 Post‐expand include size: 0/2097152 bytes Template argument size: 0/2097152 bytes Highest expansion depth: 2/100 Expensive parser function count: 0/500 Unstrip recursion depth: 0/20 Unstrip post‐expand size: 0/5000000 bytes Number of Wikibase entities loaded: 0/400 --> <!-- Transclusion expansion time report (%,ms,calls,template) 100.00% 0.000 1 -total --> <!-- Saved in parser cache with key idwiki:pcache:idhash:61463-0!canonical and timestamp 20241031070123 and revision id 25389289. Rendering was triggered because: page-view --> </div><!--esi <esi:include src="/esitest-fa8a495983347898/content" /> --><noscript><img src="https://login.wikimedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" width="1" height="1" style="border: none; position: absolute;"></noscript> <div class="printfooter" data-nosnippet="">Diperoleh dari "<a dir="ltr" href="https://id.wikipedia.org/w/index.php?title=Algoritma_pencarian&oldid=25389289">https://id.wikipedia.org/w/index.php?title=Algoritma_pencarian&oldid=25389289</a>"</div></div> <div id="catlinks" class="catlinks" data-mw="interface"><div id="mw-normal-catlinks" class="mw-normal-catlinks"><a href="/wiki/Istimewa:Daftar_kategori" title="Istimewa:Daftar kategori">Kategori</a>: <ul><li><a href="/wiki/Kategori:Algoritme" title="Kategori:Algoritme">Algoritme</a></li><li><a href="/wiki/Kategori:Ilmu_komputer" title="Kategori:Ilmu komputer">Ilmu komputer</a></li></ul></div></div> </div> </main> </div> <div class="mw-footer-container"> <footer id="footer" class="mw-footer" > <ul id="footer-info"> <li id="footer-info-lastmod"> Halaman ini terakhir diubah pada 3 Maret 2024, pukul 04.53.</li> <li id="footer-info-copyright">Teks tersedia di bawah <a rel="nofollow" class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Lisensi Atribusi-BerbagiSerupa Creative Commons</a>; ketentuan tambahan mungkin berlaku. Lihat <a class="external text" href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use">Ketentuan Penggunaan</a> untuk rincian lebih lanjut.</li> </ul> <ul id="footer-places"> <li id="footer-places-privacy"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy">Kebijakan privasi</a></li> <li id="footer-places-about"><a href="/wiki/Wikipedia:Tentang">Tentang Wikipedia</a></li> <li id="footer-places-disclaimers"><a href="/wiki/Wikipedia:Penyangkalan_umum">Penyangkalan</a></li> <li id="footer-places-wm-codeofconduct"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Universal_Code_of_Conduct">Kode Etik</a></li> <li id="footer-places-developers"><a href="https://developer.wikimedia.org">Pengembang</a></li> <li id="footer-places-statslink"><a href="https://stats.wikimedia.org/#/id.wikipedia.org">Statistik</a></li> <li id="footer-places-cookiestatement"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement">Pernyataan kuki</a></li> <li id="footer-places-mobileview"><a href="//id.m.wikipedia.org/w/index.php?title=Algoritma_pencarian&mobileaction=toggle_view_mobile" class="noprint stopMobileRedirectToggle">Tampilan seluler</a></li> </ul> <ul id="footer-icons" class="noprint"> <li id="footer-copyrightico"><a href="https://wikimediafoundation.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/static/images/footer/wikimedia-button.svg" width="84" height="29" alt="Wikimedia Foundation" loading="lazy"></a></li> <li id="footer-poweredbyico"><a href="https://www.mediawiki.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/w/resources/assets/poweredby_mediawiki.svg" alt="Powered by MediaWiki" width="88" height="31" loading="lazy"></a></li> </ul> </footer> </div> </div> </div> <div class="vector-settings" id="p-dock-bottom"> <ul></ul> </div><script>(RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgHostname":"mw-web.codfw.main-f69cdc8f6-f9ddp","wgBackendResponseTime":152,"wgPageParseReport":{"limitreport":{"cputime":"0.015","walltime":"0.022","ppvisitednodes":{"value":96,"limit":1000000},"postexpandincludesize":{"value":0,"limit":2097152},"templateargumentsize":{"value":0,"limit":2097152},"expansiondepth":{"value":2,"limit":100},"expensivefunctioncount":{"value":0,"limit":500},"unstrip-depth":{"value":0,"limit":20},"unstrip-size":{"value":0,"limit":5000000},"entityaccesscount":{"value":0,"limit":400},"timingprofile":["100.00% 0.000 1 -total"]},"cachereport":{"origin":"mw-web.eqiad.main-6fcbf9d8c6-pxg6v","timestamp":"20241031070123","ttl":2592000,"transientcontent":false}}});});</script> <script type="application/ld+json">{"@context":"https:\/\/schema.org","@type":"Article","name":"Algoritma pencarian","url":"https:\/\/id.wikipedia.org\/wiki\/Algoritma_pencarian","sameAs":"http:\/\/www.wikidata.org\/entity\/Q755673","mainEntity":"http:\/\/www.wikidata.org\/entity\/Q755673","author":{"@type":"Organization","name":"Kontributor dari proyek Wikimedia."},"publisher":{"@type":"Organization","name":"Wikimedia Foundation, Inc.","logo":{"@type":"ImageObject","url":"https:\/\/www.wikimedia.org\/static\/images\/wmf-hor-googpub.png"}},"datePublished":"2006-05-04T02:57:19Z","dateModified":"2024-03-03T04:53:35Z","headline":"algoritma"}</script> </body> </html>