Looking for Python code for the Blocks World problem

This assignment is about problem-solving as search. Many problem-solving tasks which use search have the following properties: 1. They are single-agent 2. Sensing is perfect, as least with respect to the percepts that are necessary for the problem. 3. The results of actuators are deterministic 4. Other than the effects of the actuators, the world remains the same 5. The agent function is extremely limited (i.e., the agent function has very little domain knowledge)

1. The Blocks World (5 points) Implement the toy blocks world. The world has 3 blocks (enumerate them however youd like, but I would suggest r (red), o (orange), and b (blue). Devise a way to represent a state (for example, [rob] might represent the state where red is on top of orange, which is on top of blue). Keep in mind that the relative position of a block or stack of blocks on the table (left or right) is irrelevant; therefore if you use a list then [ro, b] and [b, ro] would represent the same state of the world. Of course, you are welcome to use any representation that you choose (for example, perhaps a set would be better than a list) The user should also be able to input the start state, and the goal state. Your agent should then be able to calculate the sequence of stacks and unstacks that solves the problem, using depth-first search (1 point), breadth-first search, (1 point) and best-first search (2 points) . Of course, youll have to come up with the estimator function.