Monte-Carlo methods in pool strategy game trees

Authors:
Will Leckie;Michael Greenspan
Affiliations:
Department of Electrical and Computer Engineering, School of Computing, Queen's University, Kingston, Canada;Department of Electrical and Computer Engineering, School of Computing, Queen's University, Kingston, Canada
Venue:
CG'06 Proceedings of the 5th international conference on Computers and games
Year:
2006

Citing 5
Cited 0

New advances in Alpha-Beta searching

CSC '96 Proceedings of the 1996 ACM 24th annual conference on Computer science
Performance evaluation of fuzzy-based decision system for pool

Applied Soft Computing
An event-based pool physics simulator

ACG'05 Proceedings of the 11th international conference on Advances in Computer Games
Optimization of a billiard player – position play

ACG'05 Proceedings of the 11th international conference on Advances in Computer Games
*-MINIMAX performance in backgammon

CG'04 Proceedings of the 4th international conference on Computers and Games

Quantified Score

Hi-index	0.00

Visualization

Abstract

An Eight Ball pool strategy algorithm with look-ahead is presented. The strategy uses a probabilistically evaluated game search tree to discover the best shot to attempt at each turn. Performance results of the strategy algorithm from a simulated tournament are presented. Players looking further ahead in the search tree performed better against their shallower-searching competitors, at the expense of larger execution time. The advantage of a deeper search tree was magnified for players with greater shooting precision.