scholarly journals Predicting Game Difficulty and Engagement Using AI Players

2021 ◽  
Vol 5 (CHI PLAY) ◽  
pp. 1-17
Author(s):  
Shaghayegh Roohi ◽  
Christian Guckelsberger ◽  
Asko Relas ◽  
Henri Heiskanen ◽  
Jari Takatalo ◽  
...  
Keyword(s):  
Monte Carlo ◽  
Reinforcement Learning ◽  
Prediction Accuracy ◽  
Selection Strategy ◽  
Tree Search ◽  
Monte Carlo Tree Search ◽  
Average Performance ◽  
Novel Approach ◽  
Player Modelling ◽  
Human Player

This paper presents a novel approach to automated playtesting for the prediction of human player behavior and experience. We have previously demonstrated that Deep Reinforcement Learning (DRL) game-playing agents can predict both game difficulty and player engagement, operationalized as average pass and churn rates. We improve this approach by enhancing DRL with Monte Carlo Tree Search (MCTS). We also motivate an enhanced selection strategy for predictor features, based on the observation that an AI agent's best-case performance can yield stronger correlations with human data than the agent's average performance. Both additions consistently improve the prediction accuracy, and the DRL-enhanced MCTS outperforms both DRL and vanilla MCTS in the hardest levels. We conclude that player modelling via automated playtesting can benefit from combining DRL and MCTS. Moreover, it can be worthwhile to investigate a subset of repeated best AI agent runs, if AI gameplay does not yield good predictions on average.

scholarly journals Towards efficient discovery of green synthetic pathways with Monte Carlo tree search and reinforcement learning

2020 ◽  
Vol 11 (40) ◽  
pp. 10959-10972
Author(s):  
Xiaoxue Wang ◽  
Yujie Qian ◽  
Hanyu Gao ◽  
Connor W. Coley ◽  
Yiming Mo ◽  
...  
Keyword(s):  
Monte Carlo ◽  
Reinforcement Learning ◽  
Prediction Model ◽  
Tree Search ◽  
Monte Carlo Tree Search ◽  
Value Network ◽  
Synthesis Routes

A new MCTS variant with a reinforcement learning value network and solvent prediction model proposes shorter synthesis routes with greener solvents.

scholarly journals Scalable and Efficient Bayes-Adaptive Reinforcement Learning Based on Monte-Carlo Tree Search

2013 ◽  
Vol 48 ◽  
pp. 841-883 ◽  
Author(s):  
A. Guez ◽  
D. Silver ◽  
P. Dayan
Keyword(s):  
Monte Carlo ◽  
Reinforcement Learning ◽  
Search Space ◽  
Search Tree ◽  
Benchmark Problems ◽  
Tree Search ◽  
Monte Carlo Tree Search ◽  
The Face ◽  
Almost All ◽  
Infinite State

Bayesian planning is a formally elegant approach to learning optimal behaviour under model uncertainty, trading off exploration and exploitation in an ideal way. Unfortunately, planning optimally in the face of uncertainty is notoriously taxing, since the search space is enormous. In this paper we introduce a tractable, sample-based method for approximate Bayes-optimal planning which exploits Monte-Carlo tree search. Our approach avoids expensive applications of Bayes rule within the search tree by sampling models from current beliefs, and furthermore performs this sampling in a lazy manner. This enables it to outperform previous Bayesian model-based reinforcement learning algorithms by a significant margin on several well-known benchmark problems. As we show, our approach can even work in problems with an infinite state space that lie qualitatively out of reach of almost all previous work in Bayesian exploration.

scholarly journals An Entropy-Guided Monte Carlo Tree Search Approach for Generating Optimal Container Loading Layouts

Entropy ◽  
2018 ◽  
Vol 20 (11) ◽  
pp. 866 ◽  
Author(s):  
Richard Cant ◽  
Ayodeji Remi-Omosowon ◽  
Caroline Langensiepen ◽  
Ahmad Lotfi
Keyword(s):  
Monte Carlo ◽  
Deterministic Algorithm ◽  
Computational Time ◽  
Entropy Measure ◽  
Tree Search ◽  
Container Loading ◽  
Monte Carlo Tree Search ◽  
Spatial Entropy ◽  
Novel Approach ◽  
Search Approach

In this paper, a novel approach to the container loading problem using a spatial entropy measure to bias a Monte Carlo Tree Search is proposed. The proposed algorithm generates layouts that achieve the goals of both fitting a constrained space and also having “consistency” or neatness that enables forklift truck drivers to apply them easily to real shipping containers loaded from one end. Three algorithms are analysed. The first is a basic Monte Carlo Tree Search, driven only by the principle of minimising the length of container that is occupied. The second is an algorithm that uses the proposed entropy measure to drive an otherwise random process. The third algorithm combines these two principles and produces superior results to either. These algorithms are then compared to a classical deterministic algorithm. It is shown that where the classical algorithm fails, the entropy-driven algorithms are still capable of providing good results in a short computational time.

Sign in / Sign up

Export Citation Format

Share Document