Optimal planner of the maze

[rl-max]

Hi, do you provide an optimal planner to generate actions to reach the current target?

I searched the code and found BFS function def breadth_first_search() in memory_maze/oracle.py

However, it was not possible to generate optimal actions using this function due to the continuous nature of the position of an agent, while the path generated by the planner is discrete.

Do you have any other methods to generate optimal actions?

Any feedback will be appreciated.