Streamlining Local Search for Spatially Balanced Latin Squares
Abstract
Streamlined constrained reasoning powerfully boosts the performance of backtrack search methods for finding hard combinatorial objects. We use so-called spatially balanced Latin squares to show how streamlining can also be very effective for local search: Our approach is much faster and generates considerably larger spatially balanced Latin squares than previously reported approaches (up to order 35; the previous best results could only generate solutions up to order 18). We also provide a detailed characterization of our streamliner and solution topology for small orders. We believe that streamlined local search is a general technique suitable for solving a wide range of hard combinatorial design problems.
Cite
Text
Smith et al. "Streamlining Local Search for Spatially Balanced Latin Squares." International Joint Conference on Artificial Intelligence, 2005.Markdown
[Smith et al. "Streamlining Local Search for Spatially Balanced Latin Squares." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/smith2005ijcai-streamlining/)BibTeX
@inproceedings{smith2005ijcai-streamlining,
title = {{Streamlining Local Search for Spatially Balanced Latin Squares}},
author = {Smith, Casey and Gomes, Carla P. and Fernández, Cèsar},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2005},
pages = {1539-1540},
url = {https://mlanthology.org/ijcai/2005/smith2005ijcai-streamlining/}
}