Discovering and Searching Loosely Coupled Subproblems in Dou Shou Qi

Burnett, Joseph W.
2010

We present a technique for discovering, isolating and searching loosely coupled subproblems in the game of Dou Shou Qi. Subproblem discovery utilizes a minimum weight spanning tree to find clustering structure [10] in a complete graph of causality, which captures the distance between pieces in terms of a lower-bound on time-to-effect. A heuristic extends the duration of the split by isolating subp... read more

This object is in collection:
Undergraduate honors theses
Subjects
Department of Computer Science
Permanent URL
http://hdl.handle.net/10427/70353
ID: tufts:UA005.036.003.00001
To Cite: DCA Citation Guide
Usage: Detailed Rights