...
首页> 外文期刊>IEICE transactions on information and systems >Computational Complexity of Generalized Forty Thieves
【24h】

Computational Complexity of Generalized Forty Thieves

机译:Computational Complexity of Generalized Forty Thieves

获取原文
获取原文并翻译 | 示例
           

摘要

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.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号