Displaying similar documents to “Winning strong games through fast strategies for weak games.”

Permissive strategies : from parity games to safety games

Julien Bernet, David Janin, Igor Walukiewicz (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem...

Carcassonne -- description of the game

Kárná, Lucie

Similarity:

This article formalizes some aspects of the board game Carcassonne. Combinatorical problems related to the number of tile types are mentioned. Then the paper describes a game map using graph theory.