it would also make the game cheaper if you figure out
les[s] computationally intensive algos to win.
Yes but a player who was an absolute shite programmer could just throw their bank account at the problem.
While my O(n) solution maybe eloquent, they can afford O(n^n) so provided our _players_ make the same outcome the algorithmic complexity is irrelevant if you can afford it.
The game uses a soft turn based _ticks_ timer. So provided your O(n^n) solution can execute in 1 tick. Their is no difference.