
Tackling Morpion Solitaire with AlphaZerolikeRanked Reward Reinforcement Learning
Morpion Solitaire is a popular single player game, performed with paper ...
read it

The Second Type of Uncertainty in Monte Carlo Tree Search
Monte Carlo Tree Search (MCTS) efficiently balances exploration and expl...
read it

WarmStart AlphaZero SelfPlay Search Enhancements
Recently, AlphaZero has achieved landmark results in deep reinforcement ...
read it

A New Challenge: Approaching Tetris Link with AI
Decades of research have been invested in making computer programs for p...
read it

Analysis of HyperParameters for Small Games: Iterations or Epochs in SelfPlay?
The landmark achievements of AlphaGo Zero have created great research in...
read it

FaultTolerant Nanosatellite Computing on a Budget
Micro and nanosatellites have become popular platforms for a variety of...
read it

HyperParameter Sweep on AlphaZero General
Since AlphaGo and AlphaGo Zero have achieved breakground successes in th...
read it

Dynamic Fault Tolerance Through Resource Pooling
Miniaturized satellites are currently not considered suitable for critic...
read it

Assessing the Potential of Classical Qlearning in General Game Playing
After the recent groundbreaking results of AlphaGo and AlphaZero, we hav...
read it

A0C: Alpha Zero in Continuous Action Space
A core novelty of Alpha Zero is the interleaving of tree search and deep...
read it

Monte Carlo Tree Search for Asymmetric Trees
We present an extension of Monte Carlo Tree Search (MCTS) that strongly ...
read it

Monte Carlo Qlearning for General Game Playing
Recently, the interest in reinforcement learning in game playing has bee...
read it

Bringing FaultTolerant GigaHertzComputing to Space: A MultiStage SoftwareSide FaultTolerance Approach for Miniaturized Spacecraft
Modern embedded technology is a driving factor in satellite miniaturizat...
read it

Structured Parallel Programming for Monte Carlo Tree Search
In this paper, we present a new algorithm for parallel Monte Carlo tree ...
read it

A Minimax Algorithm Better Than Alphabeta?: No and Yes
This paper has three main contributions to our understanding of fixedde...
read it

Ensemble UCT Needs High Exploitation
Recent results have shown that the MCTS algorithm (a new, adaptive, rand...
read it

BestFirst and DepthFirst Minimax Search in Practice
Most practitioners use a variant of the AlphaBeta algorithm, a simple d...
read it

Data Science and Ebola
Data ScienceToday, everybody and everything produces data. People pro...
read it

Why Local Search Excels in Expression Simplification
Simplifying expressions is important to make numerical integration of la...
read it

HEPGAME and the Simplification of Expressions
Advances in high energy physics have created the need to increase comput...
read it

Nearly Optimal Minimax Tree Search?
Knuth and Moore presented a theoretical lower bound on the number of lea...
read it

SSS* = AlphaBeta + TT
In 1979 Stockman introduced the SSS* minimax search algorithm that domi...
read it

A New Paradigm for Minimax Search
This paper introduces a new paradigm for minimax gametree search algo ...
read it

MTD(f), A Minimax Algorithm Faster Than NegaScout
MTD(f) is a new minimax search algorithm, simpler and more efficient tha...
read it

Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification
In many applications of computer algebra large expressions must be simpl...
read it
Aske Plaat
is this you? claim profile
Professor & Scientific Director of Computer Science at Leiden University