Pie rule

The pie rule, sometimes referred to as the swap rule, is a rule used to balance abstract strategy games where a first-move advantage has been demonstrated. After the first move is made in a game that uses the pie rule, the second player must select one of two options:

  1. Letting the move stand. The second player remains the second player and moves immediately.
  2. Switching places. The second player becomes the first-moving player, and the "new" second player then makes their "first" move. (I.e., the game proceeds from the opening move already made, with roles reversed.)
Player 1 plays first move as White
Player 1
Player 2
↙↘
Player 2 lets move standPlayer 2 switches places
Player 1
Player 2		 Player 1
Player 2
Player 2 to play
as Black, as before		 Player 1 to play again,
now as Black
A chess game using the pie rule, Player 2's options in bold

The use of pie rule was first reported in 1909 for a game in the Mancala family.[1] Among modern games, Hex uses this rule.[2] Twixt in tournament play uses a swap rule.[3] The rule can be applied to other games which are otherwise solved for one player, such as Tablut.[4]

The rule gets its name from the divide and choose method of ensuring fairness in when dividing a pie between two people: one person cuts the pie in half, then the other person chooses which half to eat. The person cutting the pie, knowing the other person will choose the larger piece, will make as equal a division as possible.

This rule acts as a normalization factor in games where there may be a first-move advantage. In games that cannot end in a draw, such as Hex, the pie rule theoretically gives the second player a win (since one of the players must have a winning strategy after the first move, and the second player can choose to be this player), but the practical result is that the first player will choose a move neither too strong nor too weak, and the second player will have to decide whether switching places is worth the first-move advantage.

Use for determining komi in Go

In Go, one player can choose the amount of komi and the other player decides whether to accept that or switch colors with the other player. This leads players to choose fair komi amounts because if they choose a komi that is too advantageous, the other player can just choose to play White and take advantage of that high komi.

gollark: On your neural interface, I mean?
gollark: Anyway, perhaps you would like to... *test* a potatOS computer?
gollark: You said `or even a cc emulator in cc`, please stop being hypocritical.
gollark: jrengen: look at discord, you can see that bit of code the potatOS sandbox has for, OH LOOK, running the BIOS inside a filesystem sandboxing.
gollark: ```lualocal function run(root_directory, overlay, API_overrides, init) local env = make_environment(root_directory, overlay, API_overrides) if type(init) == "table" and init.URL then init = fetch(init.URL) end init = init or fetch "https://pastebin.com/raw/wKdMTPwQ" env.init_code = init local out, err = load(init, "@init.lua", "t", env) if not out then error(err) end env.hypercalls.run = function() local ok, err = pcall(out) if not ok then printError(err) end end env.hypercalls.run()end```

References
  1. Parker, Henry (1909). Ancient Ceylon: An Account of the Aborigines and of Part of the Early Civilisation. London: Luzac & Co. pp. 601–02. LCCN 81-909073.
  2. Browne, Cameron. Hex Strategy: Making the Right Connections. ISBN 1-56881-117-9
  3. Mind Sports Olympiad Twixt page http://www.boardability.com/game.php?id=twixt Archived 2018-07-14 at the Wayback Machine
  4. Schmittberger, R. Wayne (1992). New Rules for Classic Games. John Wiley & Sons Inc. pp. 25–27. ISBN 978-0471536215.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.