Indexed by:
Abstract:
© 2014 Walter de Gruyter GmbH, Berlin/Boston. In this paper we introduce a new game; in this game there are two players, who play as rival pirate gangs. The goal is to gather more treasure than your rival. The game is played on a graph and a player gathers treasure by moving to an unvisited vertex. At the end of the game, the player with the most treasure wins. We will show that this game is NP-hard, and we will also look at the structure of this game under the disjunctive sum. We will show that there are cases where this game behaves like a normal play game, and cases where it behaves like a misére play game. We then leave an open problem about scoring play games in general.
Keyword:
Reprint Author's Address:
Email:
Source :
Year: 2014
Publish Date: 2014-01-01
Page: 286-303
Language: English
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: