Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Hoogeboom, Hendrik Jan1 | Kosters, Walter A.2 | van Rijn, Jan N.3 | Vis, Jonathan K.4
Affiliations: Leiden Institute of Advanced Computer Science, Universiteit Leiden, The Netherlands
Note: [1] h.j.hoogeboom@liacs.leidenuniv.nl
Note: [2] w.a.kosters@liacs.leidenuniv.nl
Note: [3] j.n.van.rijn@liacs.leidenuniv.nl
Note: [4] j.k.vis@liacs.leidenuniv.nl
Abstract: Non-deterministic Constraint Logic is a family of graph games introduced by Demaine and Hearn that facilitates the construction of complexity proofs. It is very convenient for the analysis of games, providing a uniform view. We focus on the acyclic version, apply this to Klondike, Mahjong Solitaire and Nonogram (that requires planarity), and discuss the more complicated game of Dou Shou Qi. While for the first three games we reobtain known characterizations in a simple and uniform manner, the result for Dou Shou Qi is new.
DOI: 10.3233/ICG-2014-37102
Journal: ICGA Journal, vol. 37, no. 1, pp. 3-16, 2014
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl