{"type":"ScholarlyArticle","title":"Streamlining Local Search for Spatially Balanced Latin Squares","authors":[{"name":"Casey Smith","slug":"casey-smith","given":"Casey","family":"Smith","affiliation":""},{"name":"Carla P. Gomes","slug":"carla-p-gomes","given":"Carla P.","family":"Gomes","affiliation":""},{"name":"Cèsar Fernández","slug":"cesar-fernandez","given":"Cèsar","family":"Fernández","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2005/330","pdf":"https://ijcai.org/proceedings/2005/0330.pdf","markdown":"https://ijcai.org/proceedings/2005/330.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/330","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":330,"pages":{"first":1539,"last":1539},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}