• Corpus ID: 239616275

The Crew: The Quest for Planet Nine is NP-Complete

@article{Reiber2021TheCT,
  title={The Crew: The Quest for Planet Nine is NP-Complete},
  author={Frederick Reiber},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.11758}
}
In this paper we study the cooperative card game, The Crew: The Quest for Planet Nine from the viewpoint of algorithmic combinatorial game theory. The Crew: The Quest for Planet Nine, is a game based off of traditional trick taking card games, like bridge or hearts. In The Crew, players are dealt a hand of cards, with cards being from one of c colors and having a value between 1 to n. Players also draft objectives, which correspond to a card in the current game that they must collect in order… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 20 REFERENCES
Computers and intractability
  • Vol. 174. freeman San Francisco,
  • 1979
NP-completeness of the game KingdominoTM
Magic: The Gathering is Turing Complete
TLDR
It is shown that optimal play in real-world $\textit{Magic}$ is at least as hard as the Halting Problem, solving a problem that has been open for a decade and implications for a unified computational theory of games are discussed.
Boosting a Bridge Artificial Intelligence
TLDR
The adaptation to Bridge of a recent methodology used for boosting game Artificial Intelligence by seeking a random seed, or a probability distribution on random seeds, better than the others on a particular game is presented.
Complexity results for standard benchmark domains in planning
Improving State Evaluation, Inference, and Search in Trick-Based Card Games
TLDR
This paper presents the world's first computer skat player that plays at the level of human experts, achieved by improving state evaluations using game data produced by human players and by using these state evaluations to perform inference on the unobserved hands of opposing players.
NP-Completeness of Pandemic
TLDR
It is shown that the problem to decide if the player can win the generalized Pandemic from the given situation of the game is NP-complete.
Nim, A Game with a Complete Mathematical Theory
Hanabi is NP-hard, even for cheaters who look at their cards
Dynamic fractional cascading
TLDR
This paper shows that fractional cascading also supports insertions into and deletions from the lists efficiently and shows that queries, insertions, and deletion into segment trees or range trees can be supported in timeO(logn log logn), whenn is the number of segments (points).
...
...