Great article. I played Stratego a lot as a kid and it always felt simpler than chess, go , or poker so it’s surprising it’s a much bigger game tree unless you stop and think.

I’m curious about the comparisons to poker. I know the hot algorithm in poker solvers is counter factual regret minimization. The article indicates that the feedback cycle is too long for those algorithms to work but I’d be curious to learn more about the relationship from CFR to what’s tried here, if any.