## 2 Citations

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

- Computer ScienceArXiv
- 2021

This work introduces and formally define a perfect-information model of this decision problem deciding whether or not all players can complete their objectives can be solved in polynomial time, and shows that the general unbounded version, as well as the constant player count version are both intractable.

## References

SHOWING 1-10 OF 25 REFERENCES

Monte Carlo Methods for the Game Kingdomino

- Computer Science2018 IEEE Conference on Computational Intelligence and Games (CIG)
- 2018

A variation of UCT called progressive win bias and a playout policy (Player-greedy) focused on selecting good moves for the player are examined and it is shown that surprisingly MCE is stronger than MCTS for a game like Kingdomino.

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards

- Computer ScienceFUN
- 2016

A simplified mathematical model of a single-player version of the cooperative card game Hanabi is introduced, and several complexity results are shown: the game is intractable in a general setting even if the authors forego with the hidden information aspect of the game.

Bejeweled, Candy Crush and other match-three games are (NP-)hard

- Computer Science2014 IEEE Conference on Computational Intelligence and Games
- 2014

This work generalizes this kind of games by only parameterizing the size of the board, while all the other elements (such as the rules or the number of gems) remain unchanged and proves that answering many natural questions regarding such games is actually NP-Hard.

Hex ist PSPACE-vollständig

- MathematicsActa Informatica
- 2004

The crucial point of the proof is to establish PSPACE-hardness for a generalization of Hex played on planar graphs by showing that the problem, whether a given quantified Boolean formula in conjunctive normal form is true, is polynomial time-reducible to the decision problem for generalized Hex.

The complexity of checkers on an N × N board

- Mathematics19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
- 1978

Under certain reasonable assumptions about the "drawing rule" in force, the problem of whether a specified player can force a win against best play by his opponent is shown to be PSPACE-hard.

The Computational Complexity of the Game of Set and Its Theoretical Applications

- MathematicsLATIN
- 2014

The version where one seeks to find the smallest number of disjoint Sets that overlap all possible Sets is shown to be NP-complete, through a close connection to the Independent Edge Dominating Set problem.

On the Complexity of Some Two-Person Perfect-Information Games

- Computer ScienceJ. Comput. Syst. Sci.
- 1978

GO Is Polynomial-Space Hard

- MathematicsJACM
- 1980

It is proved that GO is Pspace hard by reducing a Pspace-complete set, TQBF, to a game called generalized geography, then to a planar version of that game, and finally to GO.

A Combinatorial Problem Which Is Complete in Polynomial Space

- MathematicsJACM
- 1976

It is shown that determining who wins such a game if each player plays perfectly is very hard; this result suggests that the theory of combinational games is difficult.