{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T06:39:51Z","timestamp":1711435191435},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2005,6]]},"abstract":"<jats:p> This paper presents a fast algorithm for solving the n-queens problem. The basic idea of this algorithm is to use pre-computed solutions in 75% of the cases, while the remaining cases are solved by calling the Sosic's algorithm. The novelty of this algorithm is in the observation that these pre-computable cases exhibit a modular nature. In addition, the pre-computed solutions run 100 times faster than Sosic's algorithm in most cases. <\/jats:p>","DOI":"10.1142\/s0218213005002247","type":"journal-article","created":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T08:56:03Z","timestamp":1117616163000},"page":"545-557","source":"Crossref","is-referenced-by-count":2,"title":["REDUCING THE TIME COMPLEXITY OF THE N-QUEENS PROBLEM"],"prefix":"10.1142","volume":"14","author":[{"given":"EYAS","family":"EL-QAWASMEH","sequence":"first","affiliation":[{"name":"Computer Science Dept.,  Applied Science Private University, Amman 11931, Jordan"}]},{"given":"KHADER","family":"AL-NOUBANI","sequence":"additional","affiliation":[{"name":"Talal Abu-Ghazaleh &amp; Co. International, P.O.Box 921100 Amman, 11192, Jordan"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(89)90011-7"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.2307\/2690923"},{"key":"rf3","first-page":"272","volume":"24","author":"Demiroers O.","journal-title":"J. of Recreational Mathematics"},{"key":"rf5","first-page":"20","volume":"13","author":"Kuechmann F. C.","journal-title":"MacTech Magazine: for Macintosh programmers & developers"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/BF00203674"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00201419"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90171-2"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1145\/101340.101343"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/21.135698"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1109\/69.317698"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-111X(199710)12:10<739::AID-INT3>3.0.CO;2-Z"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213005002247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:31:40Z","timestamp":1565130700000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213005002247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":11,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2005,6]]}},"alternative-id":["10.1142\/S0218213005002247"],"URL":"https:\/\/doi.org\/10.1142\/s0218213005002247","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}