Scribd Logo
Încărcați

Bine ați venit la Scribd!

  • 8 Puzzle State Space Representation of Problems

    Încărcat de

    poonam161287
    6K vizualizări1 pagină
    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. GD contains the goal state(s) of the problem.

    Descriere originală:

    Drepturi de autor

    © Attribution Non-Commercial (BY-NC)

    Formate disponibile

    DOCX, PDF, TXT sau citiți online pe Scribd

    Vi se pare util acest document?

    Este necorespunzător acest conținut?

    Raportați acest document
    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. GD contains the goal state(s) of the problem.

    Drepturi de autor:

    Attribution Non-Commercial (BY-NC)
    Descărcați ca DOCX, PDF, TXT sau citiți online pe Scribd
    Indicator pentru conținut neadecvat
    6K vizualizări1 pagină

    8 Puzzle State Space Representation of Problems

    Încărcat de

    poonam161287
    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. GD contains the goal state(s) of the problem.

    Drepturi de autor:

    Attribution Non-Commercial (BY-NC)
    Descărcați ca DOCX, PDF, TXT sau citiți online pe Scribd
    Indicator pentru conținut neadecvat
    din 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.

    S-ar putea să vă placă și