Combination: automated generation of puzzles with constraints

@article{Jefferson2011CombinationAG,
  title={Combination: automated generation of puzzles with constraints},
  author={Christopher Jefferson and Wendy Moncur and Karen E. Petrie},
  journal={Proceedings of the 2011 ACM Symposium on Applied Computing},
  year={2011}
}
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… 

Figures and Tables from this paper

Plotting: A Planning Problem with Complex Transitions

TLDR
This work highlights the difficulties and inefficiencies of modelling and solving Plotting using PDDL, the de-facto standard language for AI planners and provides two constraint models that are able to capture the inherent complexities of the problem.

ConGuess: a learning environment for configuration tasks

TLDR
A gamification-based environment (ConGuess) that can help to learn configuration rule semantics is introduced that is based on the idea of presenting configuration knowledge to game players (learners) and let players figure out correct solutions.

A systematic review of quantitative studies on the enjoyment of digital entertainment games

TLDR
A systematic review of 87 quantitative studies suggests that game enjoyment describes the positive cognitive and affective appraisal of the game experience, and may in part be associated with the support of player needs and values.

References

SHOWING 1-10 OF 14 REFERENCES

Symmetry Breaking in the Alien Tiles Puzzle

TLDR
This is the first integration of an algebraic system like GAP and a constraint programming system like ILOG Solver, based on the Alien Tiles game, and a 40-fold run-time provement over code with no symmetry breaking is obtained.

Models and Symmetry Breaking for 'Peaceable Armies of Queens'

We discuss a difficult optimization problem on a chess-board, requiring equal numbers of black and white queens to be placed on the board so that the white queens cannot attack the black queens. We

HEURISTICS AND USABILITY GUIDELINES FOR THE CREATION AND EVALUATION OF FUN IN VIDEO GAMES

TLDR
The heuristics created in this study are a starting point for the construction of a standard list of game heuristic for use by the game development community.

Generalized Arc Consistency for Global Cardinality Constraint

TLDR
This paper presents an efficient way of implementing generalized arc consistency for a gcc based on a new theorem of flow theory and shows how this algorithm can efficiently be combined with other filtering techniques.

Theoretical analysis of singleton arc consistency and its extensions

A Language and a Program for Stating and Solving Combinatorial Problems

Proceedings of ModRef'08, the Seventh International Workshop on Constraint Modelling and Reformulation

TLDR
Proceedings of ModRef'08, the Seventh International Workshop on Constraint Modelling and Reformulation, the seventh international workshop onconstraint modelling and reformulation are presented.

Measuring and defining the experience of immersion in games

Physiological indicators for the evaluation of co-located collaborative play

TLDR
Evidence is found that there is a different physiological response in the body when playing against a computer versusPlaying against a friend.

Sudoku as a Constraint Problem

TLDR
This paper tries to understand the puzzle from a constraint point of view, shows models to solve and generate puzzles and gives an objective measure of the difficulty of a puzzle instance.