Survey of various problems about combinatorial games. ## O. Introduction A combinatorial game is the situation where two players, usually called A and B, play alternately by selecting an element in a finite set X according to fixed rules; the first player to achieve a certain configuration has wo
✦ LIBER ✦
On a combinatorial game
✍ Scribed by P Erdös; J.L Selfridge
- Publisher
- Elsevier Science
- Year
- 1973
- Tongue
- English
- Weight
- 159 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Combinatorial games on a graph
✍
Claude Berge
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 365 KB
On a combinatorial game with an applicat
✍
L. Csmiraz
📂
Article
📅
1980
🏛
Elsevier Science
🌐
English
⚖ 480 KB
Let A be a finite set and 9 be a family of its subsets. Two players pick m resp. n points alternately from A. I wins if he picks all the points of some element of 9, otherwise II wins. We give a sufficient condition for II to have a winning strategy. Using this we prove the following statement. If i
Sequential compounds of combinatorial ga
✍
Walter Stromquist; Daniel Ullman
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 671 KB
Combinatorial optimization in nash games
✍
Michael M. Kostreva
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 546 KB
Remark on a combinatorial identity
✍
L Carlitz
📂
Article
📅
1974
🏛
Elsevier Science
🌐
English
⚖ 56 KB
✍
Anthea Sharp; Alethea Kontis; Sarra Cannon; Avril Sabine; Alexia Purdy; Marilyn
📂
Fiction
📅
2019
🏛
Fiddlehead Press
🌐
English
⚖ 167 KB
👁 1 views