Editing Search algorithm (section)

== Applications of search algorithms ==
Specific applications of search algorithms include:

*Problems in [[combinatorial optimization]], such as:
** The [[vehicle routing problem]], a form of [[shortest path problem]]
** The [[knapsack problem]]: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.
** The [[nurse scheduling problem]]
* Problems in [[constraint satisfaction]], such as:
** The [[map coloring problem]]
** Filling in a [[sudoku]] or [[crossword puzzle]]
* In [[game theory]] and especially [[combinatorial game theory]], choosing the best move to make next (such as with the [[minmax]] algorithm)
* Finding a combination or password from the whole set of possibilities
* [[Factorization|Factoring]] an integer (an important problem in [[cryptography]])
* Search engine optimization (SEO) and content optimization for web crawlers
* Optimizing an industrial process, such as a [[chemical reaction]], by changing the parameters of the process (like temperature, pressure, and pH)
* Retrieving a record from a [[database]]
* Finding the maximum or minimum value in a [[List (abstract data type)|list]] or [[Array data structure|array]]
* Checking to see if a given value is present in a set of values