| 词条 | Col (game) |
| 释义 |
Example gameIn the following game, the first of the two players is using red, and the second is using blue. The last move in each image is shown brighter than the other areas. The starting graph:The first player may colour any of the areas to begin. However, the region around the outside of the graph is not included as an area for this game. After the first move:The second player now colours a white cell. As no areas are currently blue, any white cell is allowed. Two moves in:At this point, the requirement that the graph be proper comes into effect, as a red area must be made which does not touch the existing one: Once the third region is coloured:Note that areas only count as touching if they share edges, not if they only share vertices, so this move is legal. The game continues, players moving alternately, until one player cannot make a move. This player loses. A possible continuation of the game is as follows (with each move numbered for clarity): Game over:In this outcome, the blue player has lost. SnortSnort, invented by Simon P. Norton, uses a similar partisan assignment of two colors, but with the anticlassical constraint: neighboring regions are not allowed to be given different colors. Coloring the regions is explained as assigning fields to bulls and cows, where neighboring fields may not contain cattle of the opposite sex, lest they be distracted from their grazing. Deciding the outcome in Snort is PSPACE-complete on general graphs.[2] This is proven by reducing partizan node Kayles, which is PSPACE-complete, to a game of Snort. AnalysisThe value of a Col position is always either a number or a number plus star[3] This makes the game relatively simple compared with Snort, which features a much greater variety of values. References
| last=Berlekamp | first=Elwyn R. | authorlink=Elwyn Berlekamp |author2=John H. Conway |author3=Richard K. Guy | title=Winning Ways for your Mathematical Plays | publisher=Academic Press | year=1982 | isbn=978-0-12-091101-1 | ref=WW}} Revised and reprinted as
| author=--- | title=Winning Ways for your Mathematical Plays |edition=2nd | publisher=A K Peters Ltd | origyear=2001 | year=2004 | isbn=978-1-56881-130-7}}
| last = Conway | first = John Horton | authorlink = John Horton Conway | title = On numbers and games | publisher = Academic Press | year = 1976 | isbn = 978-0-12-186350-0 | ref=ONaG}} Revised and reprinted as
| last = --- | authorlink = John Horton Conway | title = On numbers and games | publisher = A K Peters Ltd | year = 2000 | isbn = 978-1-56881-127-7}} 1. ^On Numbers and Games: 1 2. ^{{cite arxiv|last1=Demaine|first1=Erik|last2=Hearn|first2=Robert|title=Playing Games with Algorithms: Algorithmic Combinatorial Game Theory|eprint=cs/0106019v2|year=2001}} 3. ^Winning Ways: 2 External links
3 : Paper-and-pencil games|Combinatorial game theory|Graph coloring |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。