[PYTHON] A* Pathfinding Python randomly failing

Code Help Python
1

Question:
I have an *A start path finding algorithm I’m trying to make. It works like 90% of the time but then fails randomly and I can’t figure out why.
Repl link:
https://replit.com/@InvisibleOne/PathFinder#main.py

Some images of it failing

Screenshot 2023-02-24 at 11.10.15 AM
Screenshot 2023-02-24 at 11.10.15 AM1416×932 13.5 KB

Screenshot 2023-02-24 at 11.10.48 AM
Screenshot 2023-02-24 at 11.10.48 AM1420×900 13.2 KB

1 Like
2

Solved. I found the bug in my code.

When finding the neighbors for each node I was discarding neighbors if their value was a string (Which I use to specify start and end nodes)

2 Likes
3

:skull: you know I’m probably the only other person here who does advanced algorithms so most of the forum wouldn’t be much help

4

I’m only experienced in cryptographic-hashing/encryption alg’s.

1 Like
5

yeah I specialize in advanced CS basics (?) like advanced CS but like… you know… the “standard” course nothing special like cryptography

6

How would you know you are the only one? Is pretty arrogant to say.

2 Likes
7

not really :laughing: because I know almost all active members don’t do it :stuck_out_tongue: idk about you since you’re not as active but I know the 10 active members specialize in ML/webdev

8

Pretty sad if all there is here is 10 active users.

1 Like
9

? I don’t really understand the point but OK XD :smiley:

10

what algs have you made :0

1 Like
11

um I’m not super good but I know DP, MST, Dikjstra’s, DFS/BFS, and Floyd-warshall (hare-tortoise)

12

idek what any of those are lmaoooo

1 Like
13

@InvisibleOne you should make a maze generator (creates giant mazes instead of these small obstacles) and have this solve it/have the player solve it and script solve it to show solution…
Collab maybe? :slight_smile:

1 Like
14

Those are just the names of different algo’s, the one I’m using here is called A* it’s a faster version of Dikjstra’s that uses distance to the goal to help weight the algo’s decisions. A* only works when you are looking for a single target though, just plain ole dikjstra’s can search for multiple

1 Like
15

I already have a dungeon generation algorithm I’m going to use this on, I just have to tweak the algo a bit and add some weights.

1 Like
16

I know I didn’t list A* because I don’t know it yet :sob:

EDIT: just noticed that you didn’t like any of my posts :sob:

17

This topic was automatically closed 7 days after the last reply. New replies are no longer allowed.