Search

1994

de Bruin, Arie, Pijls, Wim, Schaeffer, Jonathan, Plaat, Aske

Technical report TR94-19. Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth minimax tree-search algorithm traversing a uniform tree must explore, the so-called minimal tree Since real-life minimax trees aren't uniform, the exact size of this tree...

2015

Blair, Kristen Pilner, Cutumisu, Maria, Schwartz, Daniel Lewis , Chin, Doris B.

We introduce one instance of a game-based assessment designed to measure students’ self-regulated learning choices. We describe our overarching measurement strategy and we present Posterlet, an assessment game in which students design posters and learn graphic design principles from feedback. We...

1993

Schaeffer, Jonathan, Lobe, Greg, Szafron, Duane

Technical report TR93-04. The Enterprise programming environment supports the development of applications that run concurrently on a network of workstations. This paper describes the object-oriented components of Enterprise, implemented in Smalltalk-80, and their seamless integration with ...

2007

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...

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. ...

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...

1994

Schaeffer, Jonathan, Pijls, Wim, Plaat, Aske, de Bruin, Arie

Technical report TR94-17. In 1979 Stockman introduced the SSS* minimax search algorithm that dominates Alpha-Beta in the number of leaf nodes expanded. Further investigation of the algorithm showed that it had three serious drawbacks, which prevented its use by practitioners: it is difficult to...

1996

Schaeffer, Jonathan, Brockington, Mark

Technical report TR96-07. This paper introduces the APHID (Asynchronous Parallel Hierarchical Iterative Deepening) game-tree search algorithm. An APHID search is a hierarchical search with a master controlling the top of the tree (d' ply), and the slaves searching the rest of the tree (d-d'...

1992

Schaeffer, Jonathan, Lobe, Greg, Parsons, Ian, Szafron, Duane, Melax, Stan, Smith, Carol, Lu, Paul

Technical report TR92-20. Workstations have been in use for more than a decade now. Although a network of workstations represents a large amount of aggregate computing power, there is a need for software that can harness this power for single, distributed applications. Enterprise is an...

Fall 2009

Cutumisu, Maria

Character behaviours in computer role-playing games have a significant impact on game-play, but are often difficult for story authors to implement and modify. Many computer games use custom scripts to control the behaviours of non-player characters (NPCs). Therefore, a story author must write...