<ul><li>In this article, I will explain how to use the max heap to track the furthest enemy on the map.</li><li>The answer to this question is the building block towards enabling towers to track enemies more effectively.</li><li>The current implementation uses an array enemySpatialGrid that tracks enemies in each cell on the map.</li><li>Sorting items generally takes O(N logN), this is slower than max heap.</li><li>An update is done similarly to adding a new enemy. Except we need to know the enemy’s position in the heap.</li><li>To achieve deletion, we need to take three steps.</li><li>Since the heap is already sorted, we just need to grab the first element in the heap.</li><li>Max heap successfully solved the problem. Now we know the furthest enemy on the map.</li><li>Additionally, the max heap is more performant than the existing implementation.</li><li>Lastly, its implementation paves the way to integrating it with towers.</li></ul>

Tracking Furthest Enemy in a Tower Defence Game using Max Heap

Discover more