> I think hardcoding exceptions and edge-cases like Tactician cards would vastly increase the number of calculations you'd have to make The current algorithm i

> I think hardcoding exceptions and edge-cases like Tactician cards would vastly increase the number of calculations you'd have to make The current algorithm is exhaustive, so one run will generate all of the possible solutions to the given deal. Once all the solutions have been computed, the AI could run through the top n solutions and pick the best. This way the number of calculations is additive, not multiplicative. That's still thinking per-round though (not at the game level). It should be possible to determine if there are enemy units within striking distance of the base and deploy counterunits (so your eggs aren't all in the same basket of the top lane). I haven't encountered any tactician cards yet (confession: I haven't even reached Hate Bit, I've been so focused on the coding/blogging and it's easier to debug against Fancybot).