For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Generalized Pyramid is NP-Complete
Chuzo IWAMOTO Yuta MATSUI
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/11/01
Online ISSN: 1745-1361
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Fundamentals of Information Systems
NP-complete, computational complexity, one-player game, pyramid,
Full Text: PDF(371.7KB)>>
Pyramid is a solitaire game, where the object is to remove all cards from both a pyramidal layout and a stock of cards. Two exposed cards can be matched and removed if their values total 13. Any exposed card of value 13 and the top card of the stock can be discarded immediately. We prove that the generalized version of Pyramid is NP-complete.