Scribd
Upload
6K views

8 Puzzle State Space Representation of Problems

A state space representation defines a problem as a four-tuple containing a set of nodes (N) representing states, arcs (A) between nodes corresponding to problem-solving steps, a start state subset (S), and a goal state subset (GD). A solution path is then found by traversing the graph from a start state to a goal state through the nodes and arcs.

Uploaded by

poonam161287
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6K views

8 Puzzle State Space Representation of Problems

A state space representation defines a problem as a four-tuple containing a set of nodes (N) representing states, arcs (A) between nodes corresponding to problem-solving steps, a start state subset (S), and a goal state subset (GD). A solution path is then found by traversing the graph from a start state to a goal state through the nodes and arcs.

Uploaded by

poonam161287
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

State Space Representation of Problems

A state space is represented by a four-tuple [N, A, S, GD]


N is a set of nodes or states of the graph. These correspond to the states in a problem-solving process. A is the set of arcs between the nodes. These correspond to the steps or moves in a problem-solving process. S , a nonempty subset of N , contains the start state(s) of the problem. GD , a nonempty subset of N , contains the goal state(s) of the problem. The states in GD are described using either: 1. A measurable property of the states encountered in the search. 2. A property of the path developed in the search.

A solution path is a path through this graph from a node in S to a node in GD.

You might also like