Chapter 15. Theory of Combinatorial Games

Aim: To present a systematic development of the theory of combinatorial games from the ground up. Approach: Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of strategies. Methodology: Divide and conquer. Ascend from Nim to Chess and Go in small strides at a gradient that is not too steep. Presentation: Mostly informal; examples of combinatorial games sampled from various strategic viewing points along scenic mountain trails illustrate the theory. Add-on: Atasteof constraint logic , a new tool to prove intractabilities of games.

MoreLess

Year of publication:	2015
Authors:	Fraenkel, Aviezri S. ; Hearn, Robert A. ; Siegel, Aaron N.
Published in:	Handbook of game theory with economic applications : volume 4. - Amsterdam : North Holland, ISBN 978-0-444-53767-6. - 2015, p. 811-859
Subject:	Combinatorial game theory \| Partizan games \| Misère play \| Nim \| Chess \| Go \| Impartial games \| Sprague-grundy theory \| Computational complexity \| Constraint logic

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

I need help

Type of publication:	Article
Language:	English
Other identifiers:	10.1016/B978-0-444-53766-9.00015-X [DOI]
Classification:	C72 - Noncooperative Games ; C79 - Game Theory and Bargaining Theory. Other
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10014025444