Rikudo is NP-complete
Copyright policy )Rikudo is NP-complete
Rikudo is a number-placement puzzle, where the player is asked to complete a Hamiltonian path on a hexagonal grid, given some clues (numbers already placed and edges of the path). We prove that the game is complete for NP, even if the puzzle has no hole. When all odd numbers are placed it is in P, whereas it is still NP-hard when all numbers of the form $3k+1$ are placed.
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), one-player number-placement game, Rikudo, Computational Complexity (cs.CC), NP-completeness, Computer Science - Computational Complexity, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Combinatorial games, Computer Science - Discrete Mathematics
FOS: Computer and information sciences, Discrete Mathematics (cs.DM), one-player number-placement game, Rikudo, Computational Complexity (cs.CC), NP-completeness, Computer Science - Computational Complexity, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Combinatorial games, Computer Science - Discrete Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!