State space (computer science)

State spaces are useful in computer science as a simple model of machines. Formally, a state space 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. ==Properties==

A state space has some common properties: • complexity, where branching factor is important • structure of the space, see also graph theory: • directionality of arcs • tree • rooted graph For example, the Vacuum World has a branching factor of 4, as the vacuum cleaner can end up in 1 of 4 adjacent squares after moving (assuming it cannot stay in the same square nor move diagonally). The arcs of Vacuum World are bidirectional, since any square can be reached from any adjacent square, and the state space is not a tree since it is possible to enter a loop by moving between any 4 adjacent squares. State spaces can be either infinite or finite, and discrete or continuous. Size The size of the state space for a given system is the number of possible configurations of the space. Finite If the size of the state space is finite, calculating the size of the state space is a combinatorial problem. For example, in the eight queens puzzle, the state space can be calculated by counting all possible ways to place 8 pieces on an 8x8 chessboard. This is the same as choosing 8 positions without replacement from a set of 64, or : \binom{64}{8} = 4,426,165,368 This is significantly greater than the number of legal configurations of the queens, 92. In many games the effective state space is small compared to all reachable/legal states. This property is also observed in chess, where the effective state space is the set of positions that can be reached by game-legal moves. This is far smaller than the set of positions that can be achieved by placing combinations of the available chess pieces directly on the board. Infinite All continuous state spaces can be described by a corresponding continuous function and are therefore infinite. Discrete state spaces can also have (countably) infinite size, such as the state space of the time-dependent "counter" system, similar to the system in queueing theory defining the number of customers in a line, which would have state space {0, 1, 2, 3, ...}. ==Exploration==

Exploring a state space is the process of enumerating possible states in search of a goal state. The state space of Pac-Man, for example, contains a goal state whenever all food pellets have been eaten, and is explored by moving Pac-Man around the board. Search states A search state is a compressed representation of a world state in a state space, and is used for exploration. Search states are used because a state space often encodes more information than is necessary to explore the space. Compressing each world state to only information needed for exploration improves efficiency by reducing the number of states in the search. For example, a state in the Pac-Man space includes information about the direction Pac-Man is facing (up, down, left, or right). Since it does not cost anything to change directions in Pac-Man, search states for Pac-Man would not include this information and reduce the size of the search space by a factor of 4, one for each direction Pac-Man could be facing. Methods Standard search algorithms are effective in exploring discrete state spaces. The following algorithms exhibit both completeness and optimality in searching a state space: • Breadth-first search • A* search • Uniform cost search These methods do not extend naturally to exploring continuous state spaces. Exploring a continuous state space in search of a given goal state is equivalent to optimizing an arbitrary continuous function which is not always possible; see mathematical optimization. ==See also==