Databases
StackOverflow2013
Postsdbo
POPython - Speed up an A Star Pathfinding Algorithm
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POPython - Speed up an A Star Pathfinding Algorithm
    primarykey
    data
    text
    <p>I've coded my first slightly-complex algorithm, an implementation of the <a href="http://en.wikipedia.org/wiki/A*_search_algorithm" rel="noreferrer">A Star Pathfinding</a> algorithm. I followed some <a href="http://www.python.org/doc/essays/graphs.html" rel="noreferrer">Python.org advice</a> on implementing graphs so a dictionary contains all the nodes each node is linked too. Now, since this is all for a game, each node is really just a tile in a grid of nodes, hence how I'm working out the heuristic and my occasional reference to them.</p> <p>Thanks to timeit I know that I can run this function successfully a little over one hundred times a second. Understandably this makes me a little uneasy, this is without any other 'game stuff' going on, like graphics or calculating game logic. So I'd love to see whether any of you can speed up my algorithm, I am completely unfamiliar with Cython or it's kin, I can't code a line of C.</p> <p>Without any more rambling, here is my A Star function.</p> <pre><code>def aStar(self, graph, current, end): openList = [] closedList = [] path = [] def retracePath(c): path.insert(0,c) if c.parent == None: return retracePath(c.parent) openList.append(current) while len(openList) is not 0: current = min(openList, key=lambda inst:inst.H) if current == end: return retracePath(current) openList.remove(current) closedList.append(current) for tile in graph[current]: if tile not in closedList: tile.H = (abs(end.x-tile.x)+abs(end.y-tile.y))*10 if tile not in openList: openList.append(tile) tile.parent = current return path </code></pre>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. This table or related slice is empty.
    1. USDizzyDoo
    plurals
    1. This table or related slice is empty.
    1. PL
      singulars
      1. LTLinked
    2. PL
      singulars
      1. LTLinked
    3. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POPython - Speed up an A Star Pathfinding Algorithm
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POPython - Speed up an A Star Pathfinding Algorithm
      1. USmcpeterson
      1. VTFavorite
    3. VO
      singulars
      1. POPython - Speed up an A Star Pathfinding Algorithm
      1. This table or related slice is empty.
      1. VTUpMod
    1. CO`while len(openList) is not 0:` makes me cringe ... `while openlist:` does the same.
      singulars
      1. POPython - Speed up an A Star Pathfinding Algorithm
      1. USJochen Ritzel
    2. COThe line `return retracePath(current)` is incorrect (I think), you shoudl call `retracePath(current)`, then `return path` currently if the end node is found, it returns `None`
      singulars
      1. POPython - Speed up an A Star Pathfinding Algorithm
      1. USmonk.e.boy
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload