Runtime Analysis

First, some constants to define our runtime(s) in terms of:

• N - The number of tiles across one dimension of tagpro.map. There are ~= N² total tiles
• P - The number of permanently non-traversable tiles
• M - The number of temporarily non-traversable tiles
• S - The number of temporarily non-traversable tiles that have transitioned state.
• A - The length of the path our bot has calculated
• B - The length of the enemy path our bot has calculated
• CPTL/PPCL - Defined throughout project
• E - The number of edges in a graph object
• V - The number of vertices in a graph object

The runtime of our A* algorithm is presently unknown. Let's call it R.

The runtime of our botloop with visualizations on is:

O(M*CPTL^2 + R + A)

The runtime of our botloop with visualizations off is:

O(M + S*CPTL^2 + R)