TETRAVEX is NP-complete

Authors:
Yasuhiko Takenaga;Toby Walsh
Affiliations:
Department of Computer Science, The University of Electro-Communications, Tokyo, Japan;National ICT Australia and University of NSW, Sydney, Australia
Venue:
Information Processing Letters
Year:
2006

Citing 3
Cited 2

The (n2-1)-puzzle and related relocation problems

Journal of Symbolic Computation
It is tough to be a plumber

Theoretical Computer Science - Algorithmic combinatorial game theory
Tetris is hard, even to approximate

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

How Hard is a Commercial Puzzle: the Eternity II Challenge

Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
On the hardness of solving edge matching puzzles as SAT or CSP problems

Constraints

Quantified Score

Hi-index	0.89

Visualization

Abstract