8 research outputs found

    Quoridor agent using Monte Carlo Tree Search

    Get PDF
    This thesis presents a preliminary study using Monte Carlo Tree Search (MCTS) upon the board game of Quoridor. The system is shown to perform well against current existing methods, defeating a set of player agents drawn from an existing digital implementation

    What Does the Gradient Tell When Attacking the Graph Structure

    Full text link
    Recent research has revealed that Graph Neural Networks (GNNs) are susceptible to adversarial attacks targeting the graph structure. A malicious attacker can manipulate a limited number of edges, given the training labels, to impair the victim model's performance. Previous empirical studies indicate that gradient-based attackers tend to add edges rather than remove them. In this paper, we present a theoretical demonstration revealing that attackers tend to increase inter-class edges due to the message passing mechanism of GNNs, which explains some previous empirical observations. By connecting dissimilar nodes, attackers can more effectively corrupt node features, making such attacks more advantageous. However, we demonstrate that the inherent smoothness of GNN's message passing tends to blur node dissimilarity in the feature space, leading to the loss of crucial information during the forward process. To address this issue, we propose a novel surrogate model with multi-level propagation that preserves the node dissimilarity information. This model parallelizes the propagation of unaggregated raw features and multi-hop aggregated features, while introducing batch normalization to enhance the dissimilarity in node representations and counteract the smoothness resulting from topological aggregation. Our experiments show significant improvement with our approach.Furthermore, both theoretical and experimental evidence suggest that adding inter-class edges constitutes an easily observable attack pattern. We propose an innovative attack loss that balances attack effectiveness and imperceptibility, sacrificing some attack effectiveness to attain greater imperceptibility. We also provide experiments to validate the compromise performance achieved through this attack loss

    Selective search in games of different complexity

    Get PDF

    Le champ du football professionnel en Angleterre : Manchester United Football Club, un modele d'excellence

    Get PDF
    Available from British Library Document Supply Centre- DSC:DXN062492 / BLDSC - British Library Document Supply CentreSIGLEGBUnited Kingdo

    Playing Connect6 With Threat Space Search And Temporal Difference Learning

    No full text
    In this paper we combine threat space search (TSS) and temporal difference (TD) learning to create three bots for the board game Connect6. By using TD learning to train a novel evaluation function based on a neural network, our best bot, Bryony, performs better than 89% of all Connect6 players on the board game website Little Golem (littlegolem.net)
    corecore