[工程科技]Playing Games with Algorithms Algorithmic Combinatorial Game Theory.pdfVIP

Playing Games with Algorithms: Algorithmic Combinatorial Game Theory∗ Erik D. Demaine† Robert A. Hearn‡ 8 0 0 2 Abstract r p Combinatorial games lead to several interesting, clean problems in algorithms and complexity A theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we begin with general background 2 in Combinatorial Game Theory, which analyzes ideal play in perfect-information games, and 2 Constraint Logic, which provides a framework for showing hardness. Then we survey results ] about the complexity of determining ideal play in these games, and the related problems of C solving puzzles, in terms of both polynomial-time algorithms and computational intractability C results. Our review of background and survey of algorithmic results are by no means complete, . but should serve as a useful primer. s c [ 1 Introduction 2 v 9 Many classic games are known to be computationally intractable (assuming P = NP): one-player 1 puzzles are often NP-complete (as in Minesweeper) or PSPACE-complete (as in Rush Hour), and 0 6 two-player games are often PSPACE-complete (as in Othello) or EXPTIME-complete (as in Check- 0 ers, Chess, and Go). Surprisingly, many seemingly simple puzzles and games are also hard. Other 1 results are positive, proving that some games can be played optimally in polynomial time. In some 0 / cases, particularly with one-player puzzles, the computationally t