40 search results - page 1 / 8 » Fast winning strategies in positional games |
ENDM
2007
13 years 5 months ago
2007
For the unbiased Maker-Breaker game, played on the hypergraph H, let τM (H) be the smallest integer t such that Maker can win the game within t moves (if the game is a Breaker’...
ITA
2002
13 years 4 months ago
2002
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...
JCT
2010
13 years 3 months ago
2010
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
CG
2002
Springer
13 years 5 months ago
2002
Springer
Abstract. In this paper, we applied the decomposition method to obtain a new winning strategy for 7x7 Hex. We also found that some positions on the 7x7 Hex board, called trivial po...