Strategy-stealing Argument

In combinatorial game theory, the strategy-stealing argument is a general argument that shows, for many two-player games, that the second player cannot have a guaranteed winning strategy. The strategy-stealing argument applies to any symmetric game (one in which either player has the same set of available moves with the same results, so that the first player can "use" the second player's strategy) in which an extra move can never be a disadvantage. The argument works by obtaining a contradiction. A winning strategy is assumed to exist for the second player, who is using it. But then, roughly speaking, after making their first move – which by the conditions above is not a disadvantage – the first player may then also play according to this winning strategy. The result is that both players are guaranteed to win – which is absurd, thus contradicting the assumption that such a strategy exists. Read all..

Comments

You could also like

What people searched for

Explanation

[You can read the original article here], Licensed under CC-BY-SA.

In combinatorial game theory, the strategy-stealing argument is a general argument that shows, for many two-player games, that the second player cannot have a guaranteed winning strategy. The strategy-stealing argument applies to any symmetric game (one in which either player has the same set of available moves with the same results, so that the first player can "use" the second player's strategy) in which an extra move can never be a disadvantage.

The argument works by obtaining a contradiction. A winning strategy is assumed to exist for the second player, who is using it. But then, roughly speaking, after making their first move – which by the conditions above is not a disadvantage – the first player may then also play according to this winning strategy. The result is that both players are guaranteed to win – which is absurd, thus contradicting the assumption that such a strategy exists.

Strategy-stealing was invented by John Nash in the 1940s to show that the game of hex is always a first-player win, as ties are not possible in this game.[1] However, Nash did not publish this method, and Beck (2008) credits its first publication to Alfred W. Hales and Robert I. Jewett, in the 1963 paper on tic-tac-toe in which they also proved the Hales–Jewett theorem.[2] Other examples of games to which the argument applies include the m,n,k-games such as gomoku. In the game of Sylver coinage, strategy stealing has been used to show that the first player wins, rather than that the game ends in a tie.[3]

Example

A strategy-stealing argument can be used on the example of the game of tic-tac-toe, for a board and winning rows of any size.[1][2] Suppose that the second player is using a strategy, S, which guarantees them a win. The first player places an X in an arbitrary position, and the second player then responds by placing an O according to S. But if they ignore the first random X that they placed, the first player finds themselves in the same situation that the second player faced on their first move; a single enemy piece on the board. The first player may therefore make their moves according to S – that is, unless S calls for another X to be placed where the ignored X is already placed. But in this case, the player may simply place his X in some other random position on the board, the net effect of which will be that one X is in the position demanded by S, while another is in a random position, and becomes the new ignored piece, leaving the situation as before. Continuing in this way, S is, by hypothesis, guaranteed to produce a winning position (with an additional ignored X of no consequence). But then the second player has lost – contradicting the supposition that they had a guaranteed winning strategy. Such a winning strategy for the second player, therefore, does not exist, and tic-tac-toe is either a forced win for the first player or a tie. Further analysis shows it is in fact a tie.

The same proof holds for any strong positional game.

Chess

Philidor, 1777
abcdefgh
8
a4 white queen
d3 white king
b2 black rook
b1 black king
8
77
66
55
44
33
22
11
abcdefgh
Black is in zugzwang, since they must move their rook away from their king.

There is a class of chess positions called Zugzwang in which the player obligated to move would prefer to "pass" if this were allowed. Because of this, the strategy-stealing argument cannot be applied to chess.[4] It is not currently known whether White or Black can force a win with optimal play, or if both players can force a draw. However, virtually all students of chess consider White's first move to be an advantage and statistics from modern high-level games have White's winning percentage about 10% higher than Black's.

Go

In Go passing is allowed. When the starting position is symmetrical (empty board, neither player has any points), this means that the first player could steal the second player's winning strategy simply by giving up the first move. Since the 1930s, however,[5] the second player is typically awarded some compensation points, which makes the starting position asymmetrical, and the strategy-stealing argument will no longer work.

An elementary strategy in the game is "mirror go", where the second player performs moves which are diagonally opposite those of this opponent. This approach may be defeated using ladder tactics, ko fights, or successfully competing for control of the board's central point.

Constructivity

The strategy-stealing argument shows that the second player cannot win, by means of deriving a contradiction from any hypothetical winning strategy for the second player. The argument is commonly employed in games where there can be no draw, by means of the law of the excluded middle. However, it does not provide an explicit strategy for the first player, and because of this it has been called non-constructive.[4] This raises the question of how to actually compute a winning strategy.

For games with a finite number of reachable positions, such as chomp, a winning strategy can be found by exhaustive search.[6] However, this might be impractical if the number of positions is large.

In 2019, Greg Bodwin and Ofer Grossman proved that the problem of finding a winning strategy is PSPACE-hard in two kinds of games in which strategy-stealing arguments were used: the minimum poset game and the symmetric Maker-Maker game.[7]

References

  1. 1 2 Beck, József (2008), Combinatorial Games: Tic-Tac-Toe Theory, Encyclopedia of Mathematics and its Applications, 114, Cambridge: Cambridge University Press, p.65, 74, doi:10.1017/CBO9780511735202, ISBN 9780511735202, MR 2402857.
  2. 1 2 Hales, A. W.; Jewett, R. I. (1963), "Regularity and positional games", Transactions of the American Mathematical Society, 106 (2): 222–229, doi:10.2307/1993764, JSTOR 1993764, MR 0143712.
  3. Sicherman, George (2002), "Theory and Practice of Sylver Coinage" (PDF), Integers, 2, G2
  4. 1 2 Bishop, J. M.; Nasuto, S. J.; Tanay, T.; Roesch, E. B.; Spencer, M. C. (2016), "HeX and the single anthill: Playing games with Aunt Hillary", in Müller, Vincent C. (ed.), Fundamental Issues of Artificial Intelligence (PDF), Synthese Library, 376, Springer, pp. 369–390, doi:10.1007/978-3-319-26485-1_22. See in particular Section 22.2.2.2, The Strategy-Stealing Argument, p. 376.
  5. Fairbairn, John, History of Komi, retrieved 2010-04-09
  6. rjlipton (2013-10-02). "Stealing Strategies". Gödel's Lost Letter and P=NP. Retrieved 2019-11-30.
  7. Bodwin, Greg; Grossman, Ofer (2019-11-15). "Strategy-Stealing is Non-Constructive". arXiv:1911.06907 [cs.DS].
Read all..
© 2019 raptorfind.com. Imprint, All rights reserved.