181,605 research outputs found

    Aspects of opening play

    Get PDF
    In this paper, we study opening play in games. We show experiments using minimax and a semi-random player. In the experiment, we let each semi-random player use an opening-book, created by different player. Results show evidence for the following statements. The game length increases. Expert player against an intermediate player should not use an opening book in a tournament match. Some opening books are good for novices and some opening books are bad for novices. The game outcome will approach the outcome of the game when the opening book was created, and if a grandmaster creates the opening book then the outcome will be the same as the grandmaster’s

    On the Complexity of the Mis\`ere Version of Three Games Played on Graphs

    Full text link
    We investigate the complexity of finding a winning strategy for the mis\`ere version of three games played on graphs : two variants of the game NimG\text{NimG}, introduced by Stockmann in 2004 and the game Vertex Geography\text{Vertex Geography} on both directed and undirected graphs. We show that on general graphs those three games are PSPACE\text{PSPACE}-Hard or Complete. For one PSPACE\text{PSPACE}-Hard variant of NimG\text{NimG}, we find an algorithm to compute an effective winning strategy in time O(∣V(G)∣.∣E(G)∣)\mathcal{O}(\sqrt{|V(G)|}.|E(G)|) when GG is a bipartite graph

    How do we remember the past in randomised strategies?

    Full text link
    Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance. In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely winning situation may become almost-surely losing if the player is only allowed to use a weaker notion of strategy. In more reasonable settings, translations exist, but they require infinite memory, even in simple cases. Finally, some traditional problems becomes undecidable for the strongest type of strategies

    Nudging Cooperation in a Crowd Experiment

    Get PDF
    We examine the hypothesis that driven by a competition heuristic, people don't even reflect or consider whether a cooperation strategy may be better. As a paradigmatic example of this behavior we propose the zero-sum game fallacy, according to which people believe that resources are fixed even when they are not. We demonstrate that people only cooperate if the competitive heuristic is explicitly overridden in an experiment in which participants play two rounds of a game in which competition is suboptimal. The observed spontaneous behavior for most players was to compete. Then participants were explicitly reminded that the competing strategy may not be optimal. This minor intervention boosted cooperation, implying that competition does not result from lack of trust or willingness to cooperate but instead from the inability to inhibit the competition bias. This activity was performed in a controlled laboratory setting and also as a crowd experiment. Understanding the psychological underpinnings of these behaviors may help us improve cooperation and thus may have vast practical consequences to our society.Fil: Niella, Tamara. Universidad Torcuato di Tella; ArgentinaFil: Stier, Nicolas. Universidad Torcuato di Tella; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Sigman, Mariano. Universidad Torcuato di Tella; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentin
    • …
    corecore