SearchSkip to Search Results
- 1Adaptive programming
- 1Computer Games
- 1Computer game
- 1Extensive Form Games
- 1Extensive games
- 2Educational Psychology, Department of
- 2Educational Psychology, Department of/Journal Articles (Educational Psychology)
- 1Computing Science, Department of
- 1Computing Science, Department of/Technical Reports (Computing Science)
- 1Graduate Studies and Research, Faculty of
- 1Graduate Studies and Research, Faculty of/Theses and Dissertations
For zero-sum games, we have efficient solution techniques. Unfortunately, there are interesting games that are too large to solve. Here, a popular approach is to solve an abstract game that models the original game. We assume that more accurate the abstract games result in stronger strategies....
The unprecedented growth in numbers of children playing computer games has stimulated discussion and research regarding what, if any, educational value these games have for teaching and learning. The research on this topic has primarily focused on children as players of computer games rather than...
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...
Schaeffer, Jonathan, Siegel, Jeff, Duff, Harvey, Schumacher, Allan, Roy, Thomas, Gillis, Stephanie, Onuczko, Curtis, McNaughton, Matthew, Carbonaro, Mike, Waugh, Kevin, Szafron, Duane, Cutumisu, Maria
The traditional approach to implementing interactions between a player character (PC) and objects in computer games is to write scripts in a procedural scripting language. These scripts are usually so complex that they must be written by a computer programmer rather than by the author of the game...