State space search is a process used in the field of computer science, including artificial intelligence (AI), in which successive configurations or states of an instance are considered, with the goal of finding a goal state with a desired property.
Problems are often modelled as a state space, a set of states that a problem can be in. The set of states forms a graph where two states are connected if there is an operation that can be performed to transform the first state into the second.
State space search often differs from traditional computer science search methods because the state space is implicit: the typical state space graph is much too large to generate and store in memory. Instead, nodes are generated as they are explored, and typically discarded thereafter. A solution to a combinatorial search instance may consist of the goal state itself, or of a path from some initial state to the goal state.
Famous quotes containing the words state, space and/or search:
“A state that denies its citizens their basic rights becomes a danger to its neighbors as well: internal arbitrary rule will be reflected in arbitrary external relations. The suppression of public opinion, the abolition of public competition for power and its public exercise opens the way for the state power to arm itself in any way it sees fit.... A state that does not hesitate to lie to its own people will not hesitate to lie to other states.”
—Václav Havel (b. 1936)
“Why not a space flower? Why do we always expect metal ships?”
—W.D. Richter (b. 1945)
“If ever the search for a tranquil belief should end,
The future might stop emerging out of the past,
Out of what is full of us; yet the search
And the future emerging out of us seem to be one.”
—Wallace Stevens (1879–1955)