hpre

What is the best heuristic for solving the Sokoban problem (using astar and gbfs)? can you show me an exsample for the implementation?

please help! I keep getting this error : (-3, -3, IndexError('list index out of range',)) class SokobanProblem(search.Problem): def __init__(self, initial): ##-------- creates an object of the class ## tmp_list = list(initial) row_len = len(tmp_list) column_len = len(tmp_list[0])-1 goal_list = [] for i in xrange(0, row_len): tmp = list(tmp_list[i]) goal_list.append(tmp) goal_tuple …