---
title: "Solving Strategies for Highly Symmetric CSPs"
authors:
  - "Pedro Meseguer"
  - "Carme Torras"
doi: ""
url: "https://ijcai.org/proceedings/1999/58"
pdf: "https://ijcai.org/proceedings/1999/0058.pdf"
venue: "Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence"
year: 1999
pages: "400-404"
track: "Constraint Satisfaction"
keywords:
---

# Solving Strategies for Highly Symmetric CSPs

Pedro Meseguer, Carme Torras

*Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence*, pages 400-404.

## Abstract

Symmetry often appears in real-world constraint satisfaction problems, but strategies for exploiting it are only beginning to be developed. Here, a rationale for exploiting symmetry within depth-first search is proposed, leading to an heuristic for variable selection and a domain pruning procedur e. These strategies are then applied to a highly symmetric comb inat orial problem, namely the generation of balanced incomplete block designs. Experimental results show that these strategies achieve a reduction of up to two orders of magnitude in computational effort. Int erestingly, two previously developed strategies are shown to be particular instances of this approach.