On Playing Well in a Sum of Games
| dc.contributor.advisor | Rivest, Ronald L. | en_US |
| dc.contributor.author | Yedwab, Laura | en_US |
| dc.date.accessioned | 2023-03-29T15:11:50Z | |
| dc.date.available | 2023-03-29T15:11:50Z | |
| dc.date.issued | 1985-08 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149617 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-348 | |
| dc.title | On Playing Well in a Sum of Games | en_US |
| dc.identifier.oclc | 14055501 |
