as soon as you can

Task: Create a state space graph for the problem given below Description of the problem: There are three pegs and two discs: one large, and one small. In the initial state, both discs are stacked in the first (leftmost) peg (see picture below). The goal is to move the discs to the third peg (see picture below). You can move one disc at a time, from any peg to another, as long as there is no other disc on top of it. It is not allowed to put a larger disc on the top of a smaller disc. (the problem description is taken from the online course "Elements of Ar", University of Helsinki) Limitations: It is not allowed returning back to a state that was already acquired in the current path If a specific state allows acquiring the goal state by moving only one disc, then other possible movements of discs should not be considered You should finish movement of discs in case you have a dead end when it is not possible to move discs because any movement leads to a state that was already acquired in the current path . Initial state Goal state