I think that these days Google Doodle is really saving my ‘mind’. I just decided to check this thing daily to see what interesting things other countries are celebrating and also the international celebrations too. Today, it seems that is a good day for special games. First we have 30 years of Tetris which is one of the first games played by me. And secondly it is Honinbo Shusaku’s 185th birthday, considered to be the greatest player of the board game Go. As you can see this is an interesting day in the history of games. And of course, there is a little mathematics in both of these games. I will try to be brief, because from my point of view you can write whole books about the math behind them.

I will star with Go, a strategy board game, which from first glance it is very easy (the rules are incredibly easy to understand, and I recommend you check them, you will like them).

Even from the 11th century, Chinese scholars have understood the importance of this game and its combinatorial properties. They also discovered the importance of permutations, a well know functions that permutes elements from a set. And as suspected people started to study this games, study how many positions there are, the winning strategies and more. For more visit this, and you will be surprised by what a little math can do to a game (really helpful, if you ask me). Let me know what you think about this game in the comment box below.

And… Tetris… Most of you have played this game since kids. If you consider the other game for today, this is extremely knew and it is computer based. And also all the math related to it is in fact a little more computer science. Here is small glance at the math behind it:

In computer science, it is common to analyze the computational complexity of problems, including real life problems and games. It was proven that for the offline version of Tetris (in which all the pieces are known in advance) the following objectives are NP-complete:

• Maximizing the number of rows cleared while playing the given piece sequence.
• Maximizing the number of pieces placed before a loss occurs.
• Maximizing the number of simultaneous clearing of four rows.
• Minimizing the height of the highest filled grid square over the course of the sequence.

Also, it is not possible to find a polynomial timeapproximation algorithm for the first 2 problems and it is hard to approximate the last problem within 2 − ε for every ε > 0.

To prove NP-completeness, it was shown that there is a polynomial reduction between the 3-partition problem, which is also NP-Complete, and the Tetris problem.

In time this game became very popular, and now we have fans everywhere around the world. Take a look:

Hope you liked this post, and if you would like to see more let me know. Any feedback is appreciated so use the like and share buttons and also comment below with any questions.

Check my Facebook page, my Tumblr, my just started Google+ page and also my new Twitter (I am really new to the last 2 things, so bare with me if you can see stupid mistakes there) and  Instagram.Thank you for reading and enjoy your day.