As I have already written couple of times, I used to teach Matlab. My experience was quite varied with many highs and as many lows. The high points were usually introducing and solving more complicated or involved problems, and also helping students to understand them. One time I held a tournament similar to Riddler Nation tournament hosted by Riddler on FiveThirtyEight, which was based on the Colonel Blotto game.

In this post I discuss the problem posed to my students. And I also provide a live session recording of me implementing colonel Blotto tournament in Matlab.

Let us now apply the things we have learned from analyzing various iterations of Colonel Blotto game! At least from my perspective, football match resolution engine used in the Eleven: Football Manager Board Game is a variation of this game. Can we improve our performance by leveraging this knowledge?

Let us continue exploring Colonel Blotto game! In an earlier post, we became familiar with the basic premise of the model. Then, we have explored what happens when the castles (battlefields) have different importance. This time, let us consider a scenario with two types of troops: one that is slow and inexpensive, and another that is fast but more costly. What happens if we introduce this heterogeneity? Will you be able to beat AI strategy this time?

A short video on the Colonel Blotto game, which visually introduces the game we have been posting about recently. It implements a couple of straightforward strategies, which gradually grow more sophisticated.

It seems that the "smart colonel" strategy from the video above is similar to the strategy I have implemented to be used by computer opponent in the app from an earlier post.

In an earlier post we have seen basic framework behind the Colonel Blotto game. We have assumed that castles are identical and of equal value. In this post let us consider one of the simplest ways to generalize Colonel Blotto game is to assume that castles are heterogeneous. Can you still find a winning strategy?