Search
Skip to Search Results- 5Schaeffer, Jonathan
- 4Szafron, Duane
- 3Bowling, Michael
- 3Zinkevich, Martin
- 2Billings, Darse
- 2Carbonaro, Mike
- 14Computing Science, Department of
- 13Computing Science, Department of/Technical Reports (Computing Science)
- 6Graduate and Postdoctoral Studies (GPS), Faculty of
- 6Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 2Educational Psychology, Department of
- 2Educational Psychology, Department of/Journal Articles (Educational Psychology)
-
2006
Onuczko, Curtis, Schaeffer, Jonathan, Cutumisu, Maria, Roy, Thomas, Carbonaro, Mike, McNaughton, Matthew, Szafron, Duane
To compete in today's market, companies that develop computer role-playing games (CRPGs) must quickly and reliably create realistic, engaging game stories. Indeed, intricate storylines and realism that goes beyond graphics have become major product differentiators. To establish both, it's...
-
2006
Cutumisu, Maria, Szafron, Duane, Roy, Thomas, Carbonaro, Mike, McNaughton, Matthew, Schaeffer, Jonathan, Onuczko, Curtis
Many computer games use custom scripts to control the ambient behaviors of non-player characters (NPCs). Therefore, a story writer must write fragments of computer code for the hundreds or thousands of NPCs in the game world. The challenge is to create entertaining and non-repetitive behaviors...
-
Fall 2009
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...
-
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...
-
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...
-
Spring 2012
Havannah is a recent game that is interesting from an AI research perspective. Some of its properties, including virtual connections, frames, dead cells, draws and races to win, are explained. Monte Carlo Tree Search (MCTS) is well suited to play Havannah, but many improvements are possible....
-
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...
-
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. ...