Corpus ID: 116763333

Symmetry Breaking in the Alien Tiles Puzzle

@inproceedings{Gent2000SymmetryBI,
  title={Symmetry Breaking in the Alien Tiles Puzzle},
  author={Ian P. Gent and Steve Linton and Barbara M. Smith},
  year={2000}
}
We describe an application of symmetry breaking in constrai n programming to a combinatorial puzzle based on the Alien Tiles game. We obtain a 40-fold run-tim e provement over code with no symmetry breaking. We believe this is the first integration o f an algebraic system like GAP and a constraint programming system like ILOG Solver. Available from http://www.cs.strath.ac.uk/ ̃apes/apesr eports.html School of Computer Science, University of St Andrews, St And rews, Fife, KY16 9SS, UK. ipg@cs.st… Expand
Comparison of Symmetry Breaking Methods in Constraint Programming
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the search algorithm soExpand
Symmetry Breaking Revisited
  • J. Puget
  • Computer Science, Mathematics
  • Constraints
  • 2004
TLDR
This paper presents a new method based on the symmetries of decisions taken from the root of the search tree that is theoretically more efficient as the size of each no-good is smaller and can be seen as an improvement of the SBDD method. Expand
Reducing Symmetry in a Combinatorial Design Problem
TLDR
The most successful strategy for the problem of this paper employs a complex model with less inherent symmetry than the others, combined with symmetry breaking during search. Expand
Symmetry in Constraint Programming
TLDR
This chapter reviews that symmetry in constraints has always been important but in recent years has become a major research area in its own right, and explores the most important application of symmetry in constraint programming to reduce search: “symmetry breaking”. Expand
Combination: automated generation of puzzles with constraints
TLDR
This showed that fun, immersing computer games can be created with constraint programming, and all the levels of Combination were generated, checked for correctness and rated for difficulty completely automatically through the use of constraints. Expand
Symmetry Breaking in Graceful Graphs
TLDR
Symmetry occurs frequently in Constraint Satisfaction Problems (CSPs) and can cause wasted search, because the search for solutions may repeatedly visit partial assignments symmetric to ones already considered. Expand
Partial Symmetry Breaking
TLDR
This paper is the first systematic study of partial symmetry breaking in constraint programming, and shows experimentally that performing symmetry breaking with only a subset of all symmetries can result in greatly reduced run-times. Expand
Optimum Symmetry Breaking in CSPs Using Group Theory
TLDR
The research carried out has detailed how to exploit the symmetries in CSPs so that it will take less time to find unique solutions i.e. the authors will count two symmetrically equivalent solutions as one solution. Expand
Groups and Constraints: Symmetry Breaking during Search
We present an interface between the ECLiPSe constraint logic programming system and the GAP computational abstract algebra system. The interface provides a method for efficiently dealing with largeExpand
Algebraic Constraint Programming ∗
Combinatorial Search and Constraint Programming Combinatorial search is arguably the most fundamental aspect of Artificial Intelligence (AI). Some of the most basic research questions in searchExpand
...
1
2
...

References

SHOWING 1-3 OF 3 REFERENCES
Symmetry Breaking in Constraint Programming
TLDR
This work describes a method for symmetry breaking during search (SBDS) in constraint programming that guarantees to return a unique solution from each set of symmetrically equivalent ones, which is the one found first by the variable and value ordering heuristics. Expand
Excluding Symmetries in Constraint-Based Search
TLDR
This work introduces a new method for excluding symmetries in constraint based search based on the notion of symmetric constraints, which is used in the modification of a general constraintbased search algorithm. Expand
GAP – Groups, Algorithms, and Programming
  • GAP – Groups, Algorithms, and Programming
  • 1998