{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/modelling-langfords-problem-a-viewpoint-for","title":"Modelling Langford's Problem: A Viewpoint for Search","arxiv_id":"1808.09847","date":"2018-08-29","proceeding":null,"authors":["Özgür Akgün","Ian Miguel"],"abstract":"The performance of enumerating all solutions to an instance of Langford's\nProblem is sensitive to the model and the search strategy. In this paper we\ncompare the performance of a large variety of models, all derived from two base\nviewpoints. We empirically show that a channelled model with a static branching\norder on one of the viewpoints offers the best performance out of all the\noptions we consider. Surprisingly, one of the base models proves very effective\nfor propagation, while the other provides an effective means of stating a\nstatic search order.","url_abs":"http://arxiv.org/abs/1808.09847v1","url_pdf":"http://arxiv.org/pdf/1808.09847v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"modelling-langfords-problem-a-viewpoint-for","repo_url":"https://github.com/stacs-cp/ModRef2018-Langfords","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"all","task_name":"All"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}