Life In 19x19 http://www.lifein19x19.com/ |
|
fair share go http://www.lifein19x19.com/viewtopic.php?f=45&t=18208 |
Page 1 of 1 |
Author: | phillip1882 [ Mon May 17, 2021 10:09 am ] |
Post subject: | fair share go |
i believe this would make for a fair game without komi. use the fair share sequence, 1 2 2 1 2 1 1 2 2 1 1 2 1 2 2 1 etc. for move order. |
Author: | CDavis7M [ Mon May 17, 2021 3:15 pm ] |
Post subject: | Re: fair share go |
It would be a different game entirely if the players could play twice in a row. |
Author: | gennan [ Tue May 18, 2021 12:27 am ] |
Post subject: | Re: fair share go |
Groups may need more than 2 eyes when players can play more than 1 stone at a time, or are multiple moves on a turn not considered simultaneous? |
Author: | phillip1882 [ Tue May 18, 2021 6:32 am ] |
Post subject: | Re: fair share go |
Quote: or are multiple moves on a turn not considered simultaneous? yes, each move has to be go legal. your not playing two move in a row, your taking two turns. |
Author: | Matti [ Sun May 23, 2021 6:18 am ] |
Post subject: | Re: fair share go |
phillip1882 wrote: i believe this would make for a fair game without komi. use the fair share sequence, 1 2 2 1 2 1 1 2 2 1 1 2 1 2 2 1 etc. for move order. How do you suggest to keep track whose move is it? |
Author: | tundra [ Sun May 23, 2021 12:34 pm ] |
Post subject: | Re: fair share go |
Matti wrote: phillip1882 wrote: i believe this would make for a fair game without komi. use the fair share sequence, 1 2 2 1 2 1 1 2 2 1 1 2 1 2 2 1 etc. for move order. How do you suggest to keep track whose move is it? Btw, for those who may not have seen this sequence before, it has actually been known and studied for a while. Mathematicians sometimes refer to it as the Thue–Morse sequence. It has been independently rediscovered several times. (To take a personal example, I once knew someone who discovered it for himself when he was in Grade 6, i.e., 11 or 12 years old. He was, like the OP, trying to find a way to make turn-based games more fair. I was rather impressed, though we never actually tried it out.) (Also, the wikipedia page mentions another application: allocating items between two people as part of, say, a divorce settlement. For example, the wife might get first choice from the pile, then the husband gets second and third choices, then the wife gets fourth choice, and so on, just as in the Thue-Morse sequence. But I do not know if this has ever been tried in real life.) As for whether this is necessary to make go into a fair game, I am doubtful. (Indeed, it is not even clear if Thue-Morse would make it fair. There might still be an advantage for one of the players.) We already have ways to balance things between players, namely komi and, if needed, handicap stones. |
Author: | Bill Spight [ Sun May 23, 2021 4:54 pm ] |
Post subject: | Re: fair share go |
phillip1882 wrote: i believe this would make for a fair game without komi. use the fair share sequence, 1 2 2 1 2 1 1 2 2 1 1 2 1 2 2 1 etc. for move order. tundra wrote: Btw, for those who may not have seen this sequence before, it has actually been known and studied for a while. Mathematicians sometimes refer to it as the Thue–Morse sequence. It has been independently rediscovered several times. (Emphasis mine.)(To take a personal example, I once knew someone who discovered it for himself when he was in Grade 6, i.e., 11 or 12 years old. He was, like the OP, trying to find a way to make turn-based games more fair. I was rather impressed, though we never actually tried it out.) (Also, the wikipedia page mentions another application: allocating items between two people as part of, say, a divorce settlement. For example, the wife might get first choice from the pile, then the husband gets second and third choices, then the wife gets fourth choice, and so on, just as in the Thue-Morse sequence. But I do not know if this has ever been tried in real life.) As for whether this is necessary to make go into a fair game, I am doubtful. (Indeed, it is not even clear if Thue-Morse would make it fair. There might still be an advantage for one of the players.) We already have ways to balance things between players, namely komi and, if needed, handicap stones. It may apply to Nim, but I doubt if it applies to go. To quote Wikipedia: https://en.wikipedia.org/wiki/Thue–Morse_sequence#Equitable_sequencing Wikipedia wrote: In their book on the problem of fair division, Steven Brams and Alan Taylor invoked the Thue–Morse sequence but did not identify it as such. When allocating a contested pile of items between two parties who agree on the items' relative values, Brams and Taylor suggested a method they called balanced alternation, or taking turns taking turns taking turns . . . , as a way to circumvent the favoritism inherent when one party chooses before the other. (Emphasis mine.)For instance. The marked points may seem preferable to the unmarked points for both players, but isn't that so only for Black? They help Black to form an eye. Even if White takes two of them on his next turn, Black can form an eye with the other two, and win the game. |
Author: | tundra [ Tue May 25, 2021 7:02 pm ] |
Post subject: | Re: fair share go |
Hello Bill: I agree with the general view, that Thue-Morse may not always lead to a fair game. But I am not sure if your example follows the Thue-Morse sequence. The sequence is: 1 2 2 1 2 1 1 2 2 1 1 2 1 2 2 1 ... Or, to make the application to Go more explicit, for players Black and White: B W W B W B B W W B B W B W W B ... In particular, the first five moves are: B W W B W, with the fifth move being White's. However, your example seems to follow: B W W B B, with the fifth move being Black's. Looking forward to your update (unless I am mistaken, in which case, mea culpa) ![]() |
Author: | Bill Spight [ Tue May 25, 2021 9:08 pm ] |
Post subject: | Re: fair share go |
tundra wrote: Hello Bill: I agree with the general view, that Thue-Morse may not always lead to a fair game. But I am not sure if your example follows the Thue-Morse sequence. The sequence is: 1 2 2 1 2 1 1 2 2 1 1 2 1 2 2 1 ... Or, to make the application to Go more explicit, for players Black and White: B W W B W B B W W B B W B W W B ... In particular, the first five moves are: B W W B W, with the fifth move being White's. However, your example seems to follow: B W W B B, with the fifth move being Black's. Looking forward to your update (unless I am mistaken, in which case, mea culpa) ![]() It's symmetrical. The advantage is to the first player, whoever that may be. If the empty points correspond to the items on the pile, then after the first play, their preferences are different for each player. That is different from Nim, where no item in any Nim pile is preferable to any other item in that pile. OC, the piles need not be equivalent. Here is another example from a modified game of tictactoe in CGT. As we know, tictactoe is a tie with correct play. However, as the first player gets the last play, it is, under CGT a first player win. So let's change the rules so that each player gets four moves. This new tictactoe game is a second player win. Using go stones to play tictactoe, suppose that the first player (Black, by convention) starts in the corner. Now ![]() |
Author: | phillip1882 [ Wed May 26, 2021 4:27 pm ] |
Post subject: | Re: fair share go |
for tic tak toe agian the move order is x o o x o x x o so lets day x make the strongest first move, the center. Code: | | ---|---|--- | x | ---|---|--- | | now o has two moves. lets say he plays two diagonals Code: o | | ---|---|--- | x | ---|---|--- | | o now its x's turn. let say he plays a diagonal as well. Code: o | | ---|---|--- | x | ---|---|--- x | | o now white get one turn. obviously he has to block with the other diagonal. Code: o | | o ---|---|--- | x | ---|---|--- x | | o now x gets two turns. and he has two ways of making 3 in a row. so lets try something else for the o player. lets try two diagonals on the same line. Code: o | | ---|---|--- | x | ---|---|--- o | | now its x's turn so he's forced to block. Code: o | | ---|---|--- x | x | ---|---|--- o | | now it's o's turn. again forces to block Code: o | | ---|---|--- x | x | 0 ---|---|--- o | | now x get two turns, and he can easily get 3 in a row. it seems black can win no matter what white does. i don't know about whether that would be true for go as well though. |
Author: | Bill Spight [ Wed May 26, 2021 6:00 pm ] |
Post subject: | Re: fair share go |
OK, my mistake. One possible Thue-Morse sequence for go. ( ![]() White has two choices for ![]() ( ![]() Ditto. As for new tictactoe: Now, even though Black gets two moves, she cannot make three in a row. ![]() ---- But the point is that the empty points on the board do not act like items in a Nim heap. For the Thue-Morse sequence to approach fairness, it appears that the original game must be impartial. Neither go nor tictactoe are impartial. Nim and Kayles are, as is the Brams-Taylor division game, and others. So there is no particular reason to think that the Thue-Morse sequence will approach fairness for go or tictactoe or five-in-a-row, or, I suppose, Othello. In go, the opponent's best play is my best play is often correct, but not always. |
Author: | Bill Spight [ Thu May 27, 2021 11:30 am ] |
Post subject: | Re: fair share go |
Also, one thing that gives the first player an advantage in a game with alternating play is when the value of plays decrease over time. In general, that is so in go, but sente is the main exception, as sente raises the local temperature. But early in the game actual sente are rare, so perhaps the Thue-Morse sequence would be good for early play. First, let's apply it to the first four moves. Let both players start on the 4-4 points. White can enforce a parallel opening with ![]() In this sequence it is Black who can enforce a parallel opening with ![]() The Thue-Morse sequence allows White to enforce the diagonal opening. A diagonal opening probably does not favor White, but this fact mitigates any advantage Black might have in the first four moves. So far, so good. ![]() How about extending the Thue-Morse sequence to the first eight moves? In regular go, ![]() ![]() ![]() ![]() ![]() So it seems to me that maybe the Thue-Morse sequence is not a bad idea for the first four moves. For instance, In his later years Go Seigen advocated the two space high approach to ![]() Go Seigen also advocated the mukai komoku, which the Thue-Morse sequence allows White to enforce. All of these possibilities that the B-W-W-B sequence give to White seem to me to reduce Black's first move advantage and also to make for interesting openings. ![]() |
Page 1 of 1 | All times are UTC - 8 hours [ DST ] |
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group http://www.phpbb.com/ |