On the parameterized complexity of finding short winning strategies in combinatorial games
A combinatorial game is a game in which all players have perfect information and there is no element of chance; some well-known examples include othello, checkers, and chess. When people play combinatorial games they develop strategies, which can be viewed as a function which takes as input a game p...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/2676 |