Navigation

• The first half of the lecture we'll follow Buckland.
• One way to determine a path from A to B starts by making a graph.
• Why would you want to determine a path from A to B in a game?
• Firstly, you can break your environment into a set of discrete polygons. (You can tile it.)
• The polygons are the nodes.
• The arcs are the connections.
• Buckland notes that if you have 100x100 cells you'll have 10,000 nodes and around 78,000 edges.
• Given several agents, searching these graphs can become rather expensive.