Computer Science – Computer Science and Game Theory
Scientific paper
2011-11-21
Computer Science
Computer Science and Game Theory
Scientific paper
10.1016/j.ipl.2011.09.016
Partially-ordered set games, also called poset games, are a class of two-player combinatorial games. The playing field consists of a set of elements, some of which are greater than other elements. Two players take turns removing an element and all elements greater than it, and whoever takes the last element wins. Examples of poset games include Nim and Chomp. We investigate the complexity of computing which player of a poset game has a winning strategy. We give an inductive procedure that modifies poset games to change the nim- value which informally captures the winning strategies in the game. For a generic poset game G, we describe an efficient method for constructing a game not G such that the first player has a winning strategy if and only if the second player has a winning strategy on G. This solves the long-standing problem of whether this construction can be done efficiently. This construction also allows us to reduce the class of Boolean formulas to poset games, establishing a lower bound on the complexity of poset games.
No associations
LandOfFree
Flipping the Winner of a Poset Game does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Flipping the Winner of a Poset Game, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Flipping the Winner of a Poset Game will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-377058