利用局部搜索、启发式和禁忌搜索元素的高效非回溯算法求解n皇后问题

The 10th International Conference on Digital Technologies 2014 Pub Date : 2014-07-09 DOI:10.1109/DT.2014.6868708

M. Kováč

{"title":"利用局部搜索、启发式和禁忌搜索元素的高效非回溯算法求解n皇后问题","authors":"M. Kováč","doi":"10.1109/DT.2014.6868708","DOIUrl":null,"url":null,"abstract":"This paper presents an efficient algorithm using Local search, various heuristics and Tabu search elements, which is capable to find solution for huge instances of the n-queens (hundreds of millions n). The algorithm returns random solutions in short time even on an ordinary personal computer. There is no other faster algorithm in n-Queens bibliography as our presented algorithm so far.","PeriodicalId":330975,"journal":{"name":"The 10th International Conference on Digital Technologies 2014","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"N-queens problem by efficient non-backtracking algorithm using local search, heuristics and Tabu search elements\",\"authors\":\"M. Kováč\",\"doi\":\"10.1109/DT.2014.6868708\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an efficient algorithm using Local search, various heuristics and Tabu search elements, which is capable to find solution for huge instances of the n-queens (hundreds of millions n). The algorithm returns random solutions in short time even on an ordinary personal computer. There is no other faster algorithm in n-Queens bibliography as our presented algorithm so far.\",\"PeriodicalId\":330975,\"journal\":{\"name\":\"The 10th International Conference on Digital Technologies 2014\",\"volume\":\"112 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 10th International Conference on Digital Technologies 2014\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DT.2014.6868708\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 10th International Conference on Digital Technologies 2014","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DT.2014.6868708","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文提出了一种利用局部搜索、各种启发式和禁忌搜索元素的高效算法，该算法能够对n个皇后(数亿个n)的巨大实例进行求解，即使在普通个人计算机上也能在短时间内返回随机解。到目前为止，在n-Queens书目中还没有其他比我们提出的算法更快的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

N-queens problem by efficient non-backtracking algorithm using local search, heuristics and Tabu search elements

This paper presents an efficient algorithm using Local search, various heuristics and Tabu search elements, which is capable to find solution for huge instances of the n-queens (hundreds of millions n). The algorithm returns random solutions in short time even on an ordinary personal computer. There is no other faster algorithm in n-Queens bibliography as our presented algorithm so far.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

The 10th International Conference on Digital Technologies 2014

自引率

0.00%

发文量