Author:
Arena Francesco,Di Ianni Miriam
Subject
General Computer Science,Theoretical Computer Science
Reference5 articles.
1. Complexity results for standard benchmark domains in planning;Helmert;Artif. Intell.,2003
2. The complexity of Solitaire;Longpré;Theor. Comput. Sci.,2009
3. Solitaire: man versus machine;Yan,2004
4. A History of Card Games;Parlett,1991
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Calculation Solitaire is NP-Complete;IEICE Transactions on Information and Systems;2023-03-01