[drusepth]

This reminds me of a strategy I used to play with when I was coding bots for chess in college. Rather than searching for the best play per move, I optimized for the move that resulted in states with the largest search space for my opponent (and/or the largest differential in search spaces for me versus my opponent), _then_ searched the upper percentile for the best play.

This strategy worked really well against other students' bots, but not terribly well against the students themselves. I'd be interested to see if it worked better/worse against pro players who think more algorithmically/analytically.