IEICE TRANSACTIONS on Information
Computational Complexity of Generalized Forty Thieves
Summary :
Forty Thieves is a solitaire game with two 52-card decks. The object is to move all cards from ten tableau piles of four cards to eight foundations. Each foundation is built up by suit from ace to king of the same suit, and each tableau pile is built down by suit. You may move the top card from any tableau pile to a tableau or foundation pile, and from the stock to a foundation pile. We prove that the generalized version of Forty Thieves is NP-complete.
- Publication
- IEICE TRANSACTIONS on Information Vol.E98-D No.2 pp.429-432
- Publication Date
- 2015/02/01
- Publicized
- 2014/11/11
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2014EDL8154
- Type of Manuscript
- LETTER
- Category
- Fundamentals of Information Systems
Authors
Chuzo IWAMOTO
Hiroshima University
Yuta MATSUI
Hiroshima University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Chuzo IWAMOTO, Yuta MATSUI, "Computational Complexity of Generalized Forty Thieves" in IEICE TRANSACTIONS on Information,
vol. E98-D, no. 2, pp. 429-432, February 2015, doi: 10.1587/transinf.2014EDL8154.
Abstract: Forty Thieves is a solitaire game with two 52-card decks. The object is to move all cards from ten tableau piles of four cards to eight foundations. Each foundation is built up by suit from ace to king of the same suit, and each tableau pile is built down by suit. You may move the top card from any tableau pile to a tableau or foundation pile, and from the stock to a foundation pile. We prove that the generalized version of Forty Thieves is NP-complete.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2014EDL8154/_p
Copy
@ARTICLE{e98-d_2_429,
author={Chuzo IWAMOTO, Yuta MATSUI, },
journal={IEICE TRANSACTIONS on Information},
title={Computational Complexity of Generalized Forty Thieves},
year={2015},
volume={E98-D},
number={2},
pages={429-432},
abstract={Forty Thieves is a solitaire game with two 52-card decks. The object is to move all cards from ten tableau piles of four cards to eight foundations. Each foundation is built up by suit from ace to king of the same suit, and each tableau pile is built down by suit. You may move the top card from any tableau pile to a tableau or foundation pile, and from the stock to a foundation pile. We prove that the generalized version of Forty Thieves is NP-complete.},
keywords={},
doi={10.1587/transinf.2014EDL8154},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - Computational Complexity of Generalized Forty Thieves
T2 - IEICE TRANSACTIONS on Information
SP - 429
EP - 432
AU - Chuzo IWAMOTO
AU - Yuta MATSUI
PY - 2015
DO - 10.1587/transinf.2014EDL8154
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E98-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2015
AB - Forty Thieves is a solitaire game with two 52-card decks. The object is to move all cards from ten tableau piles of four cards to eight foundations. Each foundation is built up by suit from ace to king of the same suit, and each tableau pile is built down by suit. You may move the top card from any tableau pile to a tableau or foundation pile, and from the stock to a foundation pile. We prove that the generalized version of Forty Thieves is NP-complete.
ER -
English
