Accepted Papers for ACG2015

All presentations are on video. 

Click here for the page with the ACG2015 videos

The following papers will be presented at ACG2015.

The Conference Program is available here (including papers: press “List View”)

Please go to conftool for conference registration.

Please go to icga.org for hotel information.

Jakub Pawlewicz, Ryan B Hayward Feature Strength and Parallelization of Sibling Conspiracy Number Search
Ingo Althöfer, Matthias Beckmann, Friedrich Salzer On some Random Walk Games with Micro Control
Chu-Hsuan Hsueh, I-Chen Wu, Wen-Jie Tseng, Shi-Jim Yen, Jr-Chang Chen Strength Improvement and Analysis for an MCTS-Based Chinese Dark Chess Program
Yusaku Mandai, Tomoyuki Kaneko LinUCB Applied to Monte Carlo Tree Search
Tristan Cazenave. Playout Policy Adaptation for Games
Édouard Bonnet, Florian Jamain, Abdallah Saffidine Slither a similar yet different connection game
Guy McCrossan Haworth A Comparative Review of Skill Assessment: Performance, Prediction and Profiling
Tobias Graf, Marco Platzner Adaptive Playouts in Monte Carlo Tree Search with Policy Gradient Reinforcement Learning
Shu Yokoyama, Tomoyuki Kaneko, Testuro Tanaka Parameter-Free Tree Style Pipeline in Asynchronous Parallel Game-Tree Search
Yoshiaki Yamaguchi, Todd.W Neller First Player’s Cannot-Lose Strategy in Cylinder-Infinite-Connect-Four for Widths 2 and 6
Taichi Ishitobi, Aske Plaat, Hiroyuki Iida, Jaap van den Herik Reducing the Seesaw Effect in Proof Number Search
Olivier Teytaud, Abdallah Saffidine, Shi-Jim Yen The complexities of Go
Matthias Beckmann On some Evacuation Games with Random Walks
Richard Lorentz. Early Playout Termination in MCTS
Nikolaos Papahristou, Ioannis Refanidis Constructing Pin Endgame Databases for the Backgammon Variant Plakoto
Yuichiro Sato, Hiroyuki Iida, H.J. van den Herik Transfer Learning by Inductive Logic Programming
Yun-Ching Liu, Yoshimasa Tsuruoka Adapting Improved Upper Confidence Bounds for Monte-Carlo Tree Search
Vito Janko, Matej Guid Development of a Program for Playing Progressive Chess
Kei Takada, Masaya Honjo, Hiroyuki Iizuka, Masahito Yamamoto Developing Computer Hex using Global and Local Evaluation based on Board Network Characteristics
Kokolo Ikeda, Shishido Takanari, Simon Viennot Machine-Learning of Shape Names for the Game of Go
Jos Uiterwijk. Crystallisation of Domineering Snowflakes
Cameron Browne Boundary Matching for Realtime Sprouts
Advertisements

About Aske Plaat

Professor of Data Science at Leiden University
This entry was posted in Geen categorie. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s