# On numbers and games

@article{Guy1978OnNA, title={On numbers and games}, author={Richard K. Guy}, journal={Proceedings of the IEEE}, year={1978}, volume={66}, pages={716-717} }

Some readers know to play the game of nim well, fewer play a perfect annihilation game, and nobody knows whether there exists an opening move in chess that will guarantee a win for white. These games and many more, belong to the family of combinatorial games, by which we mean the set of all two-player perfect-information games without chance moves and with outcomes lose or win (and sometimes: dynamic tie). The motivation for ONAG may have been, and perhaps was-and I would like to think that it…

## 527 Citations

### Simultaneous Combinatorial Game Theory

- Economics
- 2018

Combinatorial game theory (CGT), as introduced by Berlekamp, Conway and Guy, involves two players who move alternately in a perfect information, zero-sum game, and there are no chance devices. Also…

### Combinatorial Games: selected Bibliography with a Succinct Gourmet Introduction

- Economics
- 1996

The family of combinatorial games consists of two-player games with perfect information, no hidden information as in some card games, no chance moves and outcome restricted to (lose, win), (tie, tie) and (draw, draw) for the two players who move alternately.

### On the Complexity and Topology of Scoring Games: of Pirates and Treasure

- MathematicsIntegers
- 2017

It is shown that it is PSPACE-complete to decide whether or not Left has a winning strategy in the Pirates and Treasure game, and that the winning space of Left is connected, but not always convex.

### Guaranteed Scoring Games

- Mathematics, Computer ScienceElectron. J. Comb.
- 2016

It is proved that if a game has an inverse it is obtained by `switching the players' and the structure of GS is a quotient monoid with partially ordered congruence classes.

### All Games Bright and Beautiful

- Economics
- 1977

In this section, two master expositors lead us through many examples of such games, and introduce the theory that has been developed to deal with them.

### An Investigation of Partizan Misere Games

- Mathematics
- 2010

Partizan combinatorial \mis play games are investigated, by taking Plambeck's indistinguishability and \mis monoid theory for impartial positions and extending it to partizan ones, as well as examining the difficulties in constructing a category of \ Mis play games in a similar manner to Joyal's category of normal play games.

### On Some Combinatorial Games Connected with Go

- Computer Science
- 1993

In the last part of this thesis, a simple game played with coins is deene, and it is shown that many Go endgame subpositions without kos are equivalent to properly placed coins in this game.

### Combinatorial Game Theory, Well-Tempered Scoring Games, and a Knot Game

- EconomicsArXiv
- 2011

The theory of fixed-length scoring games is shown to have properties similar to the theory of loopy combinatorial games, with operations similar to onsides and offsides.

### Pomax games - a family of partizan games played on posets

- Economics
- 2014

We introduce the following class of partizan games, called pomax games. Given a partially ordered set whose elements are colored black or white, the players Black and White take turns removing any…

### Impartial games with entailing moves

- EconomicsArXiv
- 2021

Fine impartial is defined, which extends classical impartial games, and their algebra is analyzed by extending the established Sprague-Grundy theory, with an accompanying minimum excluded rule.

## References

SHOWING 1-10 OF 10 REFERENCES

### Complexity of decision problems based on finite two-person perfect-information games

- Computer Science, MathematicsSTOC '76
- 1976

We present a number of simply-structured combinatorial games for which the problem of determining the outcome of optimal play is complete in polynomial space—a condition which gives very strong…

### The Theory of a Class of Games on a Sequence of Squares, in Terms of the Advancing Operation in a Special Group

- Mathematics
- 1954

### The Hackenbush Number System for Compression of Numerical Data

- Computer Science, MathematicsInf. Control.
- 1974

### and R

- K. Guy, Winning ways, a book estimated to appear in
- 1978

### Constructions in combinatorial games with cycles, Colloquia Mathematica Societatis Jânos Bolyai 10: Proc

- International Colloquium on Infinite and Finite Sets, Keszthely, Hungary, 1973 (A. Hajnal, R. Rado, V. T. Sós, eds.), Vol. 2, North-Holland, Amsterdam,
- 1975

### Constructions in combinatorial games with cycles ,

- Colloquia Mathematica Societatis Jânos Bolyai 10 : Proc . International Colloquium on Infinite and Finite Sets , Keszthely , Hungary
- 1977

### Partizan and impartial combinatorial games, Univ

- of Calgary Math. Res. Paper #315,1976. Shortened version to appear in Proc. Colloq. Internat. C.N.R.S., Paris,
- 1976