title: A* Pathfinding - I think I have it down in pseudocode, need verification
body: <p>They say that taking what someone said, and repeating it back is the best form of verifying the basics of a concept (comprehension).  So, I've been reading about A* and translated it into pseudocode, and I think I got it.  Can anyone verify and/or give tips on whether or not this implementation would work?</p>
  
  <p>Sorry if this is rushed, I'm on break at work ;)</p>
  
  <pre><code>openList.ClearTiles
  closeList.clearTiles
  path.clearTiles
  
  openList.Add startTile
  
  While openList.Count &gt; 0 and PathFound = false
      activeTile = openList.GetTileWithLowestPathCost
      openList.remove activeTile
      closeList.add activeTile
  
      if targetTile.equals(activeTile)
         pathFound = true
      else
         for each activeTile.neighbors as nTile
             if nTile not in openList and not in closeList and IsMovable
                nTile.parent = activeTile
                nTile.hueristic = computeHeuristic
                nTile.movementCost = computeMovementCost
                nTile.pathCost = nTile.hueristic + nTile.movementCost
  
                openList.add nTile
             elseif isMovable = false
                closelist.add nTile
             endif
         next
      endif
  endwhile
  
  if pathFound = true        
     while activeTile.parent is not nothing
         path.insertAtZero activeTile
         activeTile = activeTile.parent
     endwhile
  endif
  </code></pre>