Discovery - University of Dundee - Online Publications

Library & Learning Centre

Combination

Standard

Combination : automated generation of puzzles with constraints. / Jefferson, Christopher; Moncur, Wendy; Petrie, Karen E.

SAC '11: proceedings of the ACM Symposium on Applied Computing. NewYork : Association for Computing Machinery, 2011. p. 907-912.

Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

Harvard

Jefferson, C, Moncur, W & Petrie, KE 2011, 'Combination: automated generation of puzzles with constraints'. in SAC '11: proceedings of the ACM Symposium on Applied Computing. Association for Computing Machinery, NewYork, pp. 907-912.

APA

Jefferson, C., Moncur, W., & Petrie, K. E. (2011). Combination: automated generation of puzzles with constraints. In SAC '11. (pp. 907-912). NewYork: Association for Computing Machinery. doi: 10.1145/1982185.1982383

Vancouver

Jefferson C, Moncur W, Petrie KE. Combination: automated generation of puzzles with constraints. In SAC '11: proceedings of the ACM Symposium on Applied Computing. NewYork: Association for Computing Machinery. 2011. p. 907-912.

Author

Jefferson, Christopher; Moncur, Wendy; Petrie, Karen E. / Combination : automated generation of puzzles with constraints.

SAC '11: proceedings of the ACM Symposium on Applied Computing. NewYork : Association for Computing Machinery, 2011. p. 907-912.

Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

Bibtex - Download

@inbook{fe917dadbcac417395b199f4221b1c43,
title = "Combination",
publisher = "Association for Computing Machinery",
author = "Christopher Jefferson and Wendy Moncur and Petrie, {Karen E.}",
year = "2011",
isbn = "9781450301138",
pages = "907-912",
booktitle = "SAC '11",

}

RIS (suitable for import to EndNote) - Download

TY - CHAP

T1 - Combination

T2 - SAC '11

A1 - Jefferson,Christopher

A1 - Moncur,Wendy

A1 - Petrie,Karen E.

AU - Jefferson,Christopher

AU - Moncur,Wendy

AU - Petrie,Karen E.

PB - Association for Computing Machinery

CY - NewYork

PY - 2011

Y1 - 2011

N2 - Constraint Programming offers a powerful means of solving a wide variety of combinatorial problems. We have used this powerful paradigm to create a successful computer game called Combination. Combination is an application for the iPhone and iPod touch. It has been on sale internationally through the iTunes store since December, 2008 and received a number of positive reviews. In this paper we explain how all the levels of Combination were generated, checked for correctness and rated for difficulty completely automatically through the use of constraints. We go on to evaluate this method of creation with the use of a human evaluation. This showed that fun, immersing computer games can be created with constraint programming. © 2011 ACM.

AB - Constraint Programming offers a powerful means of solving a wide variety of combinatorial problems. We have used this powerful paradigm to create a successful computer game called Combination. Combination is an application for the iPhone and iPod touch. It has been on sale internationally through the iTunes store since December, 2008 and received a number of positive reviews. In this paper we explain how all the levels of Combination were generated, checked for correctness and rated for difficulty completely automatically through the use of constraints. We go on to evaluate this method of creation with the use of a human evaluation. This showed that fun, immersing computer games can be created with constraint programming. © 2011 ACM.

KW - Automated generation

KW - Combinatorial problem

KW - Computer games

KW - Constraint programming

KW - Human evaluation

KW - Human computer interaction

UR - http://www.scopus.com/inward/record.url?partnerID=yv4JPVwI&eid=2-s2.0-79959314165&md5=e6963a45083e602d6b7647a33472efb4

U2 - 10.1145/1982185.1982383

DO - 10.1145/1982185.1982383

M1 - Other chapter contribution

SN - 9781450301138

BT - SAC '11

SP - 907

EP - 912

ER -

Documents

Library & Learning Centre

Contact | Accessibility | Policy