iterative deepening A technique used to enhance depth-first search. The search tree is first processed to a maximum depth of two, and then the whole process is repeated to a depth of three, then again to four, and so on to the maximum depth n. Surprisingly, this costs little more than a single search to depth n (due to the exponential growth rate of the branching factor) and guarantees to find a shortest path to the solution. See also combinatorial explosion.
More From encyclopedia.com
Search , search / sərch/ • v. [intr.] try to find something by looking or otherwise seeking carefully and thoroughly: I searched among the rocks, but there wa… Searching , searching Locating information in a table or file by reference to a special field of each record, called the key. The goal of the search is to discov… Online Information Services , A search engine is an information retrieval system that allows someone to search the vast collection of resources on the Internet and the World Wide… Rummage , rum·mage / ˈrəmij/ • v. [intr.] search unsystematically and untidily through a mass or receptacle: he rummaged in his pocket for a handkerchief | [tr… Search Engine , search engine A program that when initiated by a search command from a user interface examines a body of data for items satisfying the search criteri… Wildcards , Wildcards are symbols that can be used to represent other values or characters during a search for files or other information on a computer system. T…
About this article
Updated About encyclopedia.com content Print Article
You Might Also Like