Search
Skip to Search Results- 3Bowling, Michael
- 3Schaeffer, Jonathan
- 3Zinkevich, Martin
- 2Billings, Darse
- 2Johanson, Michael
- 2Lanctot, Marc
-
1993
Lake, Robert, Schaeffer, Jonathan, Lu, Paul
Technical report TR93-13. Chess endgame databases, while of important theoretical interest, have yet to make a significant impact in tournament chess. In the game of checkers, however, endgame databases have played a pivotal role in the success of our World Championship challenger program...
-
2004
Cutumisu, M., McNaughton, M., Parker, D., Schaeffer, Jonathan, Redford, J., Szafron, Duane
Technical report TR04-05. Recently, some researchers have argued that generative design patterns (GDPs) can leverage the obvious design re-use that characterizes traditional design patterns into code re-use. This paper provides additional evidence that GDPs are both useful and productive. ...
-
2007
Bowling, Michael, Johanson, Michael, Zinkevich, Martin, Piccione, Carmelo
Technical report TR07-14. Extensive games are a powerful model of multiagent decision-making scenarios with incomplete information. Finding a Nash equilibrium for very large instances of these games has received a great deal of recent attention. In this paper, we describe a new technique for...
-
2009
Bowling, Michael, Zinkevich, Martin, Waugh, Kevin, Lanctot, Marc
Technical report TR09-15. Sequential decision-making with multiple agents and imperfect information is commonly modeled as an extensive game. One efficient method for computing Nash equilibria in large, zero-sum, imperfect information games is counterfactual regret minimization (CFR). In the...
-
1992
Technical report TR92-19. In August 1992, the first man versus machine world championship took place. The champion, Dr. Marion Tinsley, is arguably the greatest checkers player that ever lived. The challenger was the computer checkers program Chinook, a 3 year team effort from the University of...
-
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...
-
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...
-
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...
-
2013
Fuegito is an educational software package for learning about programming two player games. The package provides a simple, yet flexible and extensible framework which allows students to study the core search algorithms of computer game-playing, and extend them easily in projects. The current...