Pomax games: A new class of partizan games played on posets
A new class of partizan games (Pomax games) played on posets is presented. It is shown that all Pomax games are integer valued, and that it is NP-hard to determine the winner of an arbitrary Pomax game. Pomax games played on trees are solved, and also for Pomax games played on a chess-colored Young...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Matematik (Avd.)
2013
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-129532 |
| Summary: | A new class of partizan games (Pomax games) played on posets is presented. It is shown that all Pomax games are integer valued, and that it is NP-hard to determine the winner of an arbitrary Pomax game. Pomax games played on trees are solved, and also for Pomax games played on a chess-colored Young diagram. === En ny klass av partiska spel (Pomax-spel) som spelas på pomängder introduceras i detta exjobb. Vi visar att Pomax-spel är heltal, samt att det är NP-svårt att bestämma vinnaren hos godtyckliga Pomax spel. Vi visar även hur man kan lösa Pomax spel som spelas på träd, och även hur man löser Pomax-spel som spelas på Young diagram med schackfärgning. |
|---|