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.
Used in Chap. 4: pages 38, 39, 54; Chap. 7: page 98; Chap. 11: pages 148, 149
Also known as deterministic