Hello and Welcome! The Board Game Scholar is a blog all about using computer science, math, and game theory to analyze board games. We analyze games from simple pen and paper games to significantly more complex war games and everything in between.
Abstract: In post we look at the Gale-Shapley algorithm from a strategic prospective. We start by introducing the algorithm and give an proof for that individual men can not misrepresent there intent to end up with a more desirable outcome. Then, we look at two ways to “game” the algorithm, one in which a groupContinue reading “Strategic Considerations for the Gale-Shapley algorithm Part 1”
Abstract: In this short post we apply the techniques learned in the previous two posts on impartial games and present solutions for a a few variations on the previously discussed subtraction games, mainly the addition of a take and break mechanic. We also present the more complicated impartial game, Kayles and its solution. In theContinue reading “Impartial Games and How to Solve Them Part 3”
Abstract: In this post we introduce two more fundamental ideas to to the study of impartial games. The Sprague-Grundy function, and the Sprague-Grundy Theorem. With these new tools, we are able begin to solve more complicated impartial games, specifically games that are the disjoint sum of other games. Finally, we introduce the game of NimContinue reading “Impartial Games and how to Solve Them Part 2”
Abstract: In this post, we introduce the concept of impartial games and give a few examples. Following that discussion, we look at the process of solving an impartial game with a relatively simply example. During this example, we introduce critical concepts to impartial game theory, those being P and N Positions In a previous post,Continue reading “Impartial Games and How to Solve Them”
Loading…
Something went wrong. Please refresh the page and/or try again.
Get new content delivered directly to your inbox.
The Board Game Scholar is written Freddy Reiber, an undergraduate computer science student at University of California – Irvine. Freddy has a interest in Computational Complexity Theory, Algorithmic Game Theory and Graph Theory. For more on Freddy, go to his website: https://freddyreiber.info/
