Tom Pepels

According to our database, Tom Pepels authored at least 8 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Ancestor-Based α-β Bounds for Monte-Carlo Tree Search.

Tom Pepels, Mark H. M. Winands

Proceedings of the IEEE Conference on Games, 2024

2015

Sequential Halving for Partially Observable Games.

Tom Pepels, Tristan Cazenave, Mark H. M. Winands

Proceedings of the Computer Games - Fourth Workshop on Computer Games, 2015

2014

Real-Time Monte Carlo Tree Search in Ms Pac-Man.

Tom Pepels, Mark H. M. Winands, Marc Lanctot

IEEE Trans. Comput. Intell. AI Games, 2014

Quality-based Rewards for Monte-Carlo Tree Search Simulations.

Tom Pepels, Mandy J. W. Tak, Marc Lanctot, Mark H. M. Winands

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Minimizing Simple and Cumulative Regret in Monte-Carlo Tree Search.

Tom Pepels, Tristan Cazenave, Mark H. M. Winands, Marc Lanctot

Proceedings of the Computer Games - Third Workshop on Computer Games, 2014

Monte Carlo Tree Search with heuristic evaluations using implicit minimax backups.

Marc Lanctot, Mark H. M. Winands, Tom Pepels, Nathan R. Sturtevant

Proceedings of the 2014 IEEE Conference on Computational Intelligence and Games, 2014

2012

The CIG'12 MS Pac-Man vs. Ghosts Competition.

Tom Pepels

J. Int. Comput. Games Assoc., 2012

Enhancements for Monte-Carlo Tree Search in Ms Pac-Man.

Tom Pepels, Mark H. M. Winands

Proceedings of the 2012 IEEE Conference on Computational Intelligence and Games, 2012