#🔒 Maze solving algorithm for real time use cases

8 messages · Page 1 of 1 (latest)

lucid stag
#

I am working on a few maze solving algorithms which would ideally give me the shortest path to destination fastest so far I have developed a generic a* which is pretty underperformant and a better perfomant floodfill/dfs. I am looking for ways to improve the current perfomance or some better algorithms for usage

grave raftBOT
#

@lucid stag

Python help channel opened

Remember to:

  • Ask your Python question, not if you can ask or if there's an expert who can help.
  • Show a code sample as text (rather than a screenshot) and the error message, if you've got one.
  • Explain what you expect to happen and what actually happens.

:warning: Do not pip install anything that isn't related to your question, especially if asked to over DMs.

Closes after a period of inactivity, or when you send !close.
lucid stag
#

1st video is a* 2nd video is floodfill

lucid stag
#

the utils folder contains code for both a* and the floodfill

#

Current issue with a* is to further expand the nodes in the open_list information regarding the walls is needed but the wall info can only be obtained on visiting that particular node which incurs travel cost time

grave raftBOT
#

@lucid stag

Python help channel closed

This help channel has been closed and it's no longer possible to send messages here. If your question wasn't answered, feel free to create a new post in #1035199133436354600. To maximize your chances of getting a response, check out this guide on asking good questions.