/n Student note (to keep in mind) I am coding a Rubik's cube solver in python, using the IDA* search, I just need a little bit of help to make it work properly, The code is executable, but for solver .py it returns the wrong output sometimes (need to rectify it). Need the code only, implementation part will be done by me only. I also add that I do not want any of my code in cube_2.py modified (apart from the functions required for the h_Score), I also only want my solver.py slightly tweaked so it works, I am using an IDA* search for it Could you tell the tutor, for the h_Score for the ida* search I want it to use the Manhattan distance like written by Richard E"A better heuristic is to take the maximum of the sum of Manhattan distances of the corner cubies, divided by four, and the maximum of the sum of edge cubies divided by 4. The expected value of the Manhattan distance of the edge cubies is 22/4=5.5, while the corresponding values for the corner cubies is 12.333/4 that's approximately equal to 3.08 partly because there are 12 edge cubies, but only eight corner cubes." The code must be simple, I don't want it to be too complicated.