Strategy-stealing argument
id:
strategy-stealing-argument-263-1638866
title:
Strategy-stealing argument
text:
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 in which an extra move can never be a disadvantage. A key property of a strategy-stealing argument is that it proves that the first player can win the game without actually constructing such a strategy. So, although it might prove the existence of a w
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Strategy-stealing_argument
date created:
date modified:
2024-02-27T11:12:44Z
main entity:
{"identifier":"Q1158962","url":"https://www.wikidata.org/entity/Q1158962"}
image:
fields total:
13
integrity:
13