Search

1995

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

Technical report TR95-15. This paper has three main contributions to our understanding of fixed-depth minimax search: (A) A new formulation for Stockman's SSS* algorithm, based on Alpha-Beta, is presented. It solves all the perceived drawbacks of SSS, finally transforming it into a practical...

1994

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

Technical report TR94-18. This paper introduces a new paradigm for minimax game-tree search algorithms. MT is a memory-enhanced version of Pearl's Test procedure. By changing the way MT is called, a number of best-first game-tree search algorithms can be simply and elegantly constructed...

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

2008

Schaeffer, Jonathan, Cutumisu, Maria, Waugh, Kevin, Siegel, Jeff, Szafron, Duane, Schumacher, Allan, Duff, Harvey, Gillis, Stephanie, Carbonaro, Mike, Onuczko, Curtis

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

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

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

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