NP-completeness of the game KingdominoTM

  title={NP-completeness of the game KingdominoTM},
  author={Viet-Ha Nguyen and K{\'e}vin Perrot and Mathieu Vallet},
  journal={Theor. Comput. Sci.},
Rikudo is NP-complete
The Crew: The Quest for Planet Nine is NP-Complete
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.


Monte Carlo Methods for the Game Kingdomino
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
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
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
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
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
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.
GO Is Polynomial-Space Hard
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
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.