Combinatorial game theory

Impartial game

In combinatorial game theory, an impartial game is a game in which the allowable moves depend only on the position and not on which of the two players is currently moving, and where the payoffs are symmetric. In other words, the only difference between player 1 and player 2 is that player 1 goes first. The game is played until a terminal position is reached. A terminal position is one from which no moves are possible. Then one of the players is declared the winner and the other the loser. Furthermore, impartial games are played with perfect information and no chance moves, meaning all information about the game and operations for both players are visible to both players. Impartial games include Nim, Sprouts, Kayles, Quarto, Cram, Chomp, Subtract a square, Notakto, and poset games. Go and chess are not impartial, as each player can only place or move pieces of their own color. Games such as poker, dice or dominos are not impartial games as they rely on chance. Impartial games can be analyzed using the Sprague–Grundy theorem, stating that every impartial game under the normal play convention is equivalent to a nimber. The representation of this nimber can change from game to game, but every possible state of any variation of an impartial game board should be able to have some nimber value. For example, several nim heaps in the game nim can be calculated, then summed using nimber addition, to give a nimber value for the game. A game that is not impartial is called a partisan game, though some partisan games can still be evaluated using nimbers such as Domineering. Domineering would not be classified as an impartial game as players use differently acting pieces, one player with vertical dominoes, one with horizontal ones, thereby breaking the rule that each player must be able to act using the same operations. (Wikipedia).

Video thumbnail

IMT4307 Serious Games propoganda games

IMT4307 Serious Games propoganda games

From playlist Archive - Serious Games

Video thumbnail

The Prisoners Dilemma - The Most Famous Problem in Game Theory

The Prisoner's Dilemma is the most famous problem in game theory, as it shows that individuals who make rational decisions might end up in an outcome that's worse for everyone in the group. In other words, individual rationality does not imply group rationality. Watch a higher quality ver

From playlist Game Theory

Video thumbnail

IMT4007: Serious Games

Serious games and Technology.

From playlist Archive - Serious Games

Video thumbnail

4.) Quiz #1

From playlist Open Q&A

Video thumbnail

The Mathematics of Roulette I Understanding Casino Games

For thousands of years, games and puzzles have been an enjoyable and rewarding aspect of human civilization. They tease our brains. They challenge our memories. They strengthen our competitive skills. And whether it's chess, poker, or Sudoku, most games have this in common: Everything you

From playlist Math and Statistics

Video thumbnail

Best Production Practices for Casual Games | Introduction | #gamedev

Don’t forget to subscribe! This project series is about best production practices for casual games. Most game development projects fail. And, when they fail, hopes and dreams are squashed with them. But it doesn't have to be this way! We can learn a repeatable process for development su

From playlist Best Production Practices for Casual Games

Video thumbnail

IMT4007 Serious Games

Review of pHealth articles

From playlist Archive - Serious Games

Video thumbnail

Impartial Chess 1: K

An introduction to the game of Impartial Chess, beginning with the green, impartial King.

From playlist Intro to Impartial Combinatorial Games and Their Theory

Video thumbnail

Jules Hedges - compositional game theory - part I

Compositional game theory is an approach to game theory that is designed to have better mathematical (loosely “algebraic” and “geometric”) properties, while also being intended as a practical setting for microeconomic modelling. It gives a graphical representation of games in which the flo

From playlist compositional game theory

Video thumbnail

Ichess 4: R, r, B, rr and Their Grundy Numbers

The fourth video of the Impartial Chess series covers the Big Rook, Baby Rook, Twin Baby Rooks, and the Bishop.

From playlist Intro to Impartial Combinatorial Games and Their Theory

Video thumbnail

Impartial Chess 2: N

In Part 2 of the Impartial Chess series, we explore the impartial, green Knight.

From playlist Intro to Impartial Combinatorial Games and Their Theory

Video thumbnail

Ichess 8: Bouton's Solution of NIM

In this eighth video of the Impartial Chess series, we prove Bouton's Theorem and discuss it's relevance to the game of NIM.

From playlist Intro to Impartial Combinatorial Games and Their Theory

Video thumbnail

Best Production Practices for Casual Games | Session 01 | #gamedev

Don’t forget to subscribe! This project series is about best production practices for casual games. Most game development projects fail. And, when they fail, hopes and dreams are squashed with them. But it doesn't have to be this way! We can learn a repeatable process for development su

From playlist Best Production Practices for Casual Games

Video thumbnail

Ichess 5: K + r, N + r, and Mex

In the fifth video in the Impartial Chess series, we explore the games of King + Baby Rook, Knight + Baby Rook, and discuss the concept of the minimal excludant. To see how we found the Knight's Grundy Table at 6:33, watch Ichess 5 1/2: https://www.youtube.com/watch?v=X3M7vhh2T_g&list=PLj

From playlist Intro to Impartial Combinatorial Games and Their Theory

Video thumbnail

Why Snitches Get Stitches

Download Fishing Clash on your iOS/Android device for free: https://fishingclash.link/Vsauce2 Use my gift code VSAUCE2 to get an awesome reward for a total value of $20, and share your biggest catch in the pinned comment! Support Vsauce2: https://www.patreon.com/Vsauce2 From career mafi

From playlist Data Science

Video thumbnail

Ichess 7: Binary Numbers and Bouton's Discovery

In the seventh video in the Impartial Chess series, we discover Bouton's Theorem and review the concept of binary numbers.

From playlist Intro to Impartial Combinatorial Games and Their Theory

Video thumbnail

Mod-01 Lec-17 Smith: the Invisible Hand

History of Economic Theory by Dr. Shivakumar, Department of Humanities and Social Sciences IIT Madras, For more details on NPTEL visit http://nptel.iitm.ac.in

From playlist IIT Madras: History of Economic Theory | CosmoLearning.org Economics

Video thumbnail

Impartial Chess 3: K + N

In the third video of our Ichess series, we look at the game of King + Knight.

From playlist Intro to Impartial Combinatorial Games and Their Theory

Video thumbnail

Best Production Practices for Casual Games | Session 02 | #gamedev

Don’t forget to subscribe! This project series is about best production practices for casual games. Most game development projects fail. And, when they fail, hopes and dreams are squashed with them. But it doesn't have to be this way! We can learn a repeatable process for development su

From playlist Best Production Practices for Casual Games

Related pages

Cram (game) | Sprague–Grundy theorem | Kayles | Partisan game | Dice | Nim | Chess | Poset game | Mathematical game | Notakto | Sprouts (game) | Chomp | Quarto (board game) | Domineering | Nimber | Combinatorial game theory | Subtract a square