Solving the n slide puzzle in python

Hello all,

I have a code in python that solves the n slide puzzle game using the depth first search algorithmn. I need to modify the code using A* algorithm by calculating the Manhattan distance so that the agent to be faster than it is using depth first.
If anyone can help me, I will share the python codes so it would be more clear.

Thanks in advance