# Main Page

The seminar aims to present the most elegant problems and topics from algorithms, game theory, theoretical computer science, discrete math, combinatorics and many other areas. Moreover, we will think about intriguing problems and try to solve them together. For example:

- How can we program using bathroom tiles?
- Why can the second player never win a game of tic-tac-toe? And why does it not make the game boring?
- How can math help us to cut a cake, create a stable marriage or choose the best secretary?
- Why can many simple games be solved using the XOR operation?
- How can we use the design of an optimal diet plan to solve <fill in your favorite problem>?
- How can we solve reasonably large instances of hard problems with small error?

The seminar is primarily intended for new students who want to gain an overview of theoretical computer science, graph theory, combinatorics and want to learn about approximations, online algorithms and more.