On a combinatorial game |
| |
Authors: | P Erdös J.L Selfridge |
| |
Affiliation: | Hungarian Academy of Sciences, Budapest 9, Hungary;Northern Illinois University, DeKalb, Illinois 60115, USA |
| |
Abstract: | ![]() A drawing strategy is explained which applies to a wide class of combinatorial and positional games. In some settings the strategy is best possible. When applied to n-dimensional Tic-Tac-Toe, it improves a result of Hales and Jewett [5]. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|