Sure thing. Think of the map as a huge graph where every possible action is a node. The AI runs a real‑time search, like a mini Monte‑Carlo tree, but it only expands the most promising branches using heuristics—distance to objectives, opponent positions, and terrain cover. It keeps a rolling probability table of which split‑second moves usually lead to a win in similar scenarios, and it updates it on the fly. So when you press the button, the AI instantly scores each possible move, picks the one with the highest expected utility, and executes it. The key is fast evaluation and constantly learning from the outcomes.