SearchSkip to Search Results
- 3Bowling, Michael
- 3Schaeffer, Jonathan
- 3Zinkevich, Martin
- 2Billings, Darse
- 2Johanson, Michael
- 2Lanctot, Marc
Given nothing but the generative model of the environment, Monte Carlo Tree Search techniques have recently shown spectacular results on domains previously thought to be intractable. In this thesis we try to develop generic techniques for temporal abstraction inside MCTS that would allow the...
The creation of rich, immersive game worlds is one of the major goals for designers of modern story-based games. The inclusion of unique and interesting dialogues for all of a game's non-player characters (NPCs), especially the secondary NPCs, does a great deal to increase the believability of...
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. ...
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...
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...
Technical report TR06-07. The development of the Ignorant Value Assessment Tool (DIVAT) for two-player Limit Texas Hold'em is discussed in detail. The tool is then applied to several poker matches to obtain a statistically unbiased reduced-variance analysis of skill differences. Please note:...
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...
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...
Technical report TR95-22. Games are an interesting and challenging domain for computer science research, having the nice characteristics of a clearly defined set of rules and a specific goal. Developing a program to play a strategic game well often involves the application of theoretical...
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...