A* Pathfinding Tutorial

Publicado em: 06 Março 2014
no canal de: Arend Peter Teaches

38,771

467

___PLEASE READ____
I made a flaw in the explanation of the logic. In step 3 (Pick block with lowest F), I infered that the block must be adjacent to the current block, however the lowest F is picked from all blocks that have been processed but that have not yet been closed.

Thus the backtracking I did at 9:40 isn't necessary since your evaluating the same list of Fs no matter what your current node is.

If I had done this correctly I would have ended up checking several more nodes.

At 12:28 I ended up selecting a node with a F of 68 however there were several options with a F of 60 that I should have chosen.

______________________

In this video I'll be showing you how A* Path Finding algorithms work. This is very useful when programming AI in games.

Here's the link to the tutorial I mentioned
http://www.policyalmanac.org/games/aS...

Nesta página do site você pode assistir ao vídeo on-line A* Pathfinding Tutorial duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário Arend Peter Teaches 06 Março 2014, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 38,771 vezes e gostou 467 espectadores. Boa visualização!