Search
Skip to Search Results- 85Artificial Intelligence
- 22Machine Learning
- 10Reinforcement Learning
- 8Planning
- 7Computer Games
- 7Computing Science
- 4Müller, Martin
- 3Mueller, Martin
- 2Johanson, Michael
- 2Nakhost, Hootan
- 2Pelletier, Francis J.
- 2Schaeffer, Jonathan
- 50Graduate and Postdoctoral Studies (GPS), Faculty of
- 50Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 18Computing Science, Department of
- 18Computing Science, Department of/Technical Reports (Computing Science)
- 4Toolkit for Grant Success
- 4WISEST Summer Research Program
- 50Thesis
- 20Report
- 8Research Material
- 3Conference/Workshop Poster
- 2Review
- 1Conference/Workshop Presentation
-
Fuego - An Open-source Framework for Board Games and Go Engine Based on Monte-Carlo Tree Search
Download2009
Enzenberger, Markus, Mueller, Martin
Technical report TR09-08. Fuego is an open-source software framework for developing game engines for full-information two-player board games, with a focus on the game of Go. It was mainly developed by the Computer Go group of the University of Alberta. Fuego includes a Go engine with a playing...
-
Fuego-GB Prototype at the Human machine competition in Barcelona 2010: a Tournament Report and Analysis
Download2010
Technical report TR10-08. A Human vs Computer Go competition took place in Barcelona, Spain on July 20, 2010. This report provides a report and some analysis of the games played by FUEGO-GB PROTOTYPE in this event. The program played well in its 9 x 9 games with White, winning against...
-
Spring 2010
This research focuses on developing AI agents that play arbitrary Atari 2600 console games without having any game-specific assumptions or prior knowledge. Two main approaches are considered: reinforcement learning based methods and search based methods. The RL-based methods use feature vectors...
-
Spring 2015
Computer-based interactive environments present a compelling platform for research in Artificial Intelligence. Using games as its domains, this work has traditionally focused on building AI agents that can play games well (e.g., Checkers, Go, or StarCraft). In more recent years, a parallel line...
-
2012
Lanctot, Marc, Gibson, Richard, Burch, Neil, Szafron, Duane
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. While the base algorithm performs a full tree traversal on each iteration, Monte Carlo CFR (MCCFR) reduces the per...
-
Fall 2019
Improvisation is a form of live theatre where artists perform real-time, dynamic problem solving to collaboratively generate interesting narratives. The main contribution of this thesis is the development of artificial improvisation: improvised theatre performed by humans alongside intelligent...
-
Fall 2017
Modern board, card, and video games are challenging domains for AI research due to their complex game mechanics and large state and action spaces. For instance, in Hearthstone — a popular collectible card (CC) (video) game developed by Blizzard Entertainment — two players first construct their...
-
Spring 2019
Current state-of-the-art algorithms for trick-taking card games use a process called determinization. Determinization is a technique that allows the application of perfect information state evaluation algorithms to imperfect information games. It involves a two-step process in which a perfect...
-
2010
Mueller, Martin, Hoffman, Joerg, Nakhost, Hootan
Technical report TR10-02. A ubiquitous feature of planning problems -- problems involving the automatic generation of action sequences for attaining a given goal -- is the need to economize limited resources such as fuel or money. While heuristic search, mostly based on standard algorithms such...