backtracking A property of an algorithm that implies some kind of tentative search for a goal, and the possibility that any search path may turn out to be a dead end; the algorithm then retreats back down the search path to try another path. The technique is generally suitable for solving problems where a potentially large but finite number of solutions have to be inspected. It amounts to a systematic tree search, bottom-up.
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… 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… 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 Warrant , The fourth amendment to the Constitution prohibits unreasonable searches and seizures and provides that "No Warrants shall issue, but upon probable c…
About this article
Updated About encyclopedia.com content Print Article
You Might Also Like