A determinsitic search uses a fixed rule to decide the order in which to visit states in a search tree or search graph, and thus will always search in the same order given the same data. In contrast a stochastic search may take different choices based on random chance.
Also known as: deterministic
Used in glossary entries: search tree, stochastic search