Showing posts with label sums. Show all posts
Showing posts with label sums. Show all posts

Tuesday, September 20, 2011

Quiz Time!

I asked my students the following questions in class. We've covered outcome classes, but are not quite at game values yet.

Let X be the Domineering position that is two empty squares tall.

Let Y be the Domineering position that is four empty squares tall.

Find a Domineering position, G, such that X + G is in P (Zero) but Y + G is in L (Positive)

That one's not too tough. Neither is the next one:

Find G such that X + G is in R (Negative) but Y + G is in P.

This one's nice:

Find G such that X + G is in N (Fuzzy) but Y + G is in L.

My first solution for this one had a composite (sum) game for G, but I've since found a non-composite solution:

Find G such that X + G is in R, but Y + G is in L.

If you know a bunch about the values of Domineering positions, I guess these are relatively simple. If not (or if you are good at forgetting), perhaps they require a bit of extra time to consider.

Friday, January 15, 2010

Bonus-play Hex

Though I keep talking about the game Hex, please do not assume that I'm a good player at all! I don't know why I have this fascination with a game I rarely play, but apparently I do. Perhaps the reason I like it is that you can define interesting variations on it. The study of Misere Hex has a nice proof that from the staring position, optimal strategies will force the board to fill up.

Alternatively, we could define Either-Color-Hex, which allows a player to paint either red or blue on their turn, but you still only win if a path uses your color. That doesn't change much of anything from standard Hex (why play the other person's color instead of your own?). Now, however, Misere Either-Color-Hex has similar strategies to regular Hex; you're always going to try to create a bridge with the other player's color.

... depending on how you define "winning" and "losing". It seems like we'd like to say that in Hex, you win if you complete your path. However, as we've covered before on this blog, we define this by describing when no further moves are available. Then, under Normal play, you lose if you cannot play on your turn. With Misere play, the opposite is true: you win if you cannot play on your turn. Hex games are "over" when a connecting path is created. Thus, you create your path and now the other player cannot make a move.

Unfortunately, now Either-Color-Hex doesn't work as anticipated. If the Left (Blue) player is about to complete a blue path, the Red (Right) player can color the last open hex blue to complete it. Then a path is complete and Right wins, despite the fact that the path was blue. That doesn't work as expected! (In fact, this game is now an impartial game, which isn't what was expected either.)

Misere Hex still works pretty correctly. Instead of trying to avoid creating a path in your color, you try to avoid creating a path of either color. However, since you can't play opposing pieces, their path will never end the game against your favor. Misere Either-Color-Hex, though, just has the same problem as Either-Color-Hex: both players will avoid creating a path of any color.

Let's see if we can fix this by changing the rules slightly. Instead of ending a game when a path is created, let's rule that a player cannot make a move when a path of the opposing color exists.

Now the Either-Color version of this game works just fine. Right can play the blue hexagon if they want, but the blue path "belongs" to Left. Left will continue to be able to make plays on the board, but Right will not. On their next turn, Left will paint a hexagon and then Right will have no more legal moves. Left wins.

Now the Misere Either-Color version does something strange: players are actively trying to create a path in only the opposing color. Once that is complete, the opponent will have another turn, but you won't have any. This works almost the same as standard Hex, but with the player roles switched! (The exception is on the last move. If Left makes the last hexagon and completes the red path, they won't be able to make any more moves. Unfortunately, since there are no more hexagons, Right wins anyways.)

This Bonus-play Hex has another nice property. When adding with other combinatorial games, it offers a bunch of extra free moves to the player who completes their path. If the board is mostly empty, the winner can keep making moves on that board later on in the game sum. This gives the Hex summand more priority: the winner will be able to use those extra plays later.

I should print out a board for Hex!

Have a great weekend, everyone!

Monday, December 7, 2009

Different Game Sums

Previously there had been some discussion about different methods for summing games. Normally, given two games G1 = {L1 | R1} and G2 = {L2 | R2}, we use the disjunctive sum to describe making one move:

Disjunctive:
G1 + G2 =
{ { L + G2 : L \in L1} U { G1 + L: L \in L2} |
{R + G2: R \in R1} U {G1 + R: R \in R2} }

Informally, a player may choose one of the subgames, and make one of the moves available to them normally on that summand.

Lots of the discussion of last month concerned "where to apply misereness" to a game. I was trying to apply it to the game objects themselves, while it is usually applied to the play of a game instead. Paul Ottaway stepped in and said this was okay while evaluating games using the short disjunctive sum. When taking the short disjunctive sum, a player does not need to choose a subgame on which they have a move, but if none legal move exists, they immediately lose.

This is not as immediately obvious to define in the above set-notation, so let's give it a try:
(Warning: Attempted Ascii Brackets ahead! Update: Ascii Brackets removed!)

Short Disjunctive: (Update: fixed spacing issue. Did I get it right, though?)
G1 + G2 = { Left | Right } where
if either L1 = null or L2 = null, Left = { L + G2 : L \in L1} U { G1 + L: L \in L2} U { | 0}
otherwise, Left = { L + G2 : L \in L1} U { G1 + L: L \in L2}
and
if either R1= null or R2=null, Right = {R + G2: R \in R1} U {G1 + R: R \in R2} U {0 | }
otherwise, Right = {R + G2: R \in R1} U {G1 + R: R \in R2}

(Did I do that right?)

Alternatively, one may want to consider the sum where each player chooses to make a move on each of the available game boards. This is called the conjunctive sum of games:

Conjunctive:
G1 + G2 = { { l1 + l2 | r1 + r2} : l1 \in L1, l2 \in L2, r1 \in R1, r2 \in R2}

This may seem simpler, but after getting used to the disjunctive sum, it likely seems much more complicated from a gamester's point of view. Perhaps we will cover these sums more in the future!

Are there sums I missed? Please let me know!