Skip to main content

All Questions

Filter by
Sorted by
Tagged with
12 votes
1 answer
361 views

An averaging game on finite multisets of integers

The following procedure is a variant of one suggested by Patrek Ragnarsson (age 10). Let $M$ be a finite multiset of integers. A move consists of choosing two elements $a\neq b$ of $M$ of the same ...
Richard Stanley's user avatar
22 votes
5 answers
3k views

Irreversible chess

Suppose we play a chess-variant, where any finite number of pieces are allowed, and the board is as large as we wish, but only two kings in total. And there is no 50 move-rule, no castling and no ...
GM2001's user avatar
  • 223
20 votes
1 answer
1k views

A Ramsey avoidance game

Consider the following game: Given $K_n$ the complete graph on $n$ vertices, two players take turns coloring its edges. Initially no edges are colored. At his turn a player can color a prevoiusly not ...
Daniel Soltész's user avatar
19 votes
5 answers
1k views

When is a game tree the game tree of a board game?

This question arises from what I find interesting in the recently asked question What is a chess piece mathematically? My answer to that question was that mathematically, game pieces are in general ...
Joel David Hamkins's user avatar
18 votes
2 answers
3k views

Determine or estimate the number of maximal triangle-free graphs on $n$ vertices

Among the collections of the open problems of Paul Erdős on the website of Professor Fan Chung, there is one called "number of triangle-free graphs". http://www.math.ucsd.edu/~erdosproblems/erdos/...
user avatar
17 votes
1 answer
2k views

What does "game theory" cover and how should it be called?

There seems to be a huge discrepancy in what people refer to when they speak of "game theory". I tend to think of it as including, among other things: Combinatorial game theory dealing with certain ...
Gro-Tsen's user avatar
  • 32.5k
5 votes
0 answers
306 views

Generalization of Sprague-Grundy Theorem

In my research on Combinatorial Game Theory, I used a certain theorem that is essentially a generalization of the Sprague-Grundy theorem. Because the result hinges too much on the work of others to be ...
Halbort's user avatar
  • 1,129
4 votes
2 answers
426 views

Study of Hex on the Torus

Hex is usually played on a parallelogram shaped board. What if you play it on a Torus? One thing I notice is that the idea of connecting opposite sides doesn't make much sense anymore, since a torus ...
Christopher King's user avatar
3 votes
1 answer
315 views

Difficulty of 3-color forest Hackenbush

"Forest Hackenbush" (for lack of a better name) is the particular case of the game of Hackenbush where the initial position (and therefore all subsequent positions) is a (finite) forest (:= disjoint ...
Gro-Tsen's user avatar
  • 32.5k
2 votes
2 answers
1k views

Generalized Sprague-Grundy Theorem

Hey, I know what is Sprague-Grundy theorem, but I want to know about generalized Sprague-Grundy (GSG) theorem ( which is used for games with cycles ). Apparently there seems to be very less ...
Pranav Raj's user avatar