8-puzzle programming with DFS, BFS, A* Search using Java or Python

I've been looking for the code(Java or Python) and detailed description on how to implement 8-puzzle but no one satisfied me so far. I've already studied from simple search to A* search theory but I am a novice so implementation is still hard for me. Most of them on the web are too difficult to understand and I don't need so complex functions(e.g. random, exception...). Easier and shorter is better. I'd like it to include only necessary things. Somehow, if I could understand it and it could just fulfill the problem condition, that's ok. I Please refer the file I uploaded. Th problem is to implement 8-puzzle using DFS, BFS, and A* In the case of A*, there are 2 heuristic function(H1, H2)