We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

On Playing Well in a Sum of Games

Thumbnail Image
Download
Name

MIT-LCS-TR-348.pdf

Size

2.66 MB

Format

Adobe PDF

Checksum (MD5)

d15a8702c31326f987440c39ccc3121a

Author(s)
Yedwab, Laura
Advisor(s)
Rivest, Ronald L.
Date Issued
August 1985
Series/Report no.
MIT-LCS-TR-348
Abstract
Many games are naturally described as a sum of games, e.g., nim and the endgame of Go. Let G ,...,G represent n games. Then a move in the sum G + ...+G consists of picking a component game G and making a move in G .. This thesis analyzes play in a sum of games from three different perspective: computational complexity, approximate solutions, and optimal research algorithms.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.