A Survey of NP-Complete Puzzles

A Survey of NP-Complete Puzzles
复制标题

NP 完全谜题综述

DOI:
10.3233/icg-2008-31103
复制
发表时间:
2008
期刊:
J. Int. Comput. Games Assoc.
影响因子:
--
通讯作者:
Kristian Spoerer
Kristian Spoerer
中科院分区:
--
文献类型:
--
作者:
G. Kendall;A. Parkes;Kristian Spoerer

文献摘要

被引文献

相似文献

单人游戏(通常称为谜题)已经受到科学界的极大关注。因此,出现了一些有趣的见解,以及解决这些问题的方法。然而,许多谜题被忽视了,可能是因为它们不为许多人所知。在这篇文章中,我们调查NP完全难题,希望在这一迷人的领域,特别是那些迄今为止很少受到科学关注的难题,激励进一步的研究。
Single-player games (often called puzzles) have received considerable attention from the scientific community. Consequently, interesting insights into some puzzles, and into the approaches for solving them, have emerged. However, many puzzles have been neglected, possibly because they are unknown to many people. In this article, we survey NP-Complete puzzles in the hope of motivating further research in this fascinating area, particularly for those puzzles which have received little scientific attention to date.