You should clone that repository and switch to the tutorial_1 branch. The code for this tutorial is located in the path-finding repository. You only need basic programming and Python knowledge to follow along. Here, we consider a practical application. Also known as a best-first search algorithm, the core logic is shared with many algorithms, such as A*, flood filling, and Voronoi diagrams. In this tutorial, we'll look at a basic pathfinding algorithm, based on Dijkstra's algorithm. However, once you know the core algorithms, you'll find that they apply to more abstract optimization and sequencing problems. We know it mainly from navigation and games. Pathfinding is a common programming challenge with a wide range of uses.
How do we find a way through a maze? What’s the shortest drive from our place to the nearest pizzeria? Can we move the game character to the exit without walking through a wall?
0 kommentar(er)
