Jump to content

State space (computer science)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Boud (talk | contribs) at 15:13, 10 September 2007 (See also: *Probability space for information about '''state space''' in probability.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science, a state space is a description of a configuration of discrete states used as a simple model of machines. Formally, it can be defined as a tuple [N, A, S, G] where:

  • N is a set of states
  • A is a set of arcs connecting the states
  • S is a nonempty subset of N that contains start states
  • G is a nonempty subset of N that contains the goal states.

The state space is what state space search searches in. Graph theory is helpful in understanding and reasoning about state spaces.

A state space has some common properties:

See also