The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “An introduction to clobber.”

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...

Two pile move-size dynamic Nim.

Holshouser, Arthur, Reiter, Harold (2005)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Dynamic one-pile blocking Nim.

Flammenkamp, Achim, Holshouser, Arthur, Reiter, Harold (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity: