{"id":"https://openalex.org/W4367146453","doi":"https://doi.org/10.1109/csicc58665.2023.10105390","title":"Henry V: A linear time algorithm for solving the N-Queens Problem using only 5 patterns","display_name":"Henry V: A linear time algorithm for solving the N-Queens Problem using only 5 patterns","publication_year":2023,"publication_date":"2023-01-25","ids":{"openalex":"https://openalex.org/W4367146453","doi":"https://doi.org/10.1109/csicc58665.2023.10105390"},"language":"en","primary_location":{"id":"doi:10.1109/csicc58665.2023.10105390","is_oa":false,"landing_page_url":"https://doi.org/10.1109/csicc58665.2023.10105390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 28th International Computer Conference, Computer Society of Iran (CSICC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101861374","display_name":"Ali Dehghani","orcid":"https://orcid.org/0000-0001-9355-8035"},"institutions":[{"id":"https://openalex.org/I4210088809","display_name":"University of Hormozgan","ror":"https://ror.org/003jjq839","country_code":"IR","type":"education","lineage":["https://openalex.org/I4210088809"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Ali Dehghani","raw_affiliation_strings":["University of Hormozgan,Department of Electrical and Computer Engineering,Bandar Abbas,Iran","Department of Electrical and Computer Engineering, University of Hormozgan, Bandar Abbas, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hormozgan,Department of Electrical and Computer Engineering,Bandar Abbas,Iran","institution_ids":["https://openalex.org/I4210088809"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Hormozgan, Bandar Abbas, Iran","institution_ids":["https://openalex.org/I4210088809"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064079150","display_name":"Reza Namvar","orcid":null},"institutions":[{"id":"https://openalex.org/I166459259","display_name":"Shiraz University","ror":"https://ror.org/028qtbk54","country_code":"IR","type":"education","lineage":["https://openalex.org/I166459259"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Reza Namvar","raw_affiliation_strings":["Shiraz University,Faculty of Electrical and Computer Engineering,Department of CSE/IT,Shiraz,Iran","Department of CSE/IT, Faculty of Electrical and Computer Engineering, Shiraz University, Shiraz, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shiraz University,Faculty of Electrical and Computer Engineering,Department of CSE/IT,Shiraz,Iran","institution_ids":["https://openalex.org/I166459259"]},{"raw_affiliation_string":"Department of CSE/IT, Faculty of Electrical and Computer Engineering, Shiraz University, Shiraz, Iran","institution_ids":["https://openalex.org/I166459259"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000484102","display_name":"Abdullah Khalili","orcid":"https://orcid.org/0000-0003-4006-2815"},"institutions":[{"id":"https://openalex.org/I4210088809","display_name":"University of Hormozgan","ror":"https://ror.org/003jjq839","country_code":"IR","type":"education","lineage":["https://openalex.org/I4210088809"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Abdullah Khalili","raw_affiliation_strings":["University of Hormozgan,Department of Electrical and Computer Engineering,Bandar Abbas,Iran","Department of Electrical and Computer Engineering, University of Hormozgan, Bandar Abbas, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Hormozgan,Department of Electrical and Computer Engineering,Bandar Abbas,Iran","institution_ids":["https://openalex.org/I4210088809"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Hormozgan, Bandar Abbas, Iran","institution_ids":["https://openalex.org/I4210088809"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4356,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.55252057,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7361578345298767},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.7096821069717407},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.6498538255691528},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5867818593978882},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5744311213493347},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49562275409698486},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4571281969547272},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3442089855670929},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3417798578739166},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.13343927264213562},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.10363790392875671}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7361578345298767},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7096821069717407},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.6498538255691528},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5867818593978882},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5744311213493347},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49562275409698486},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4571281969547272},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3442089855670929},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3417798578739166},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.13343927264213562},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.10363790392875671}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/csicc58665.2023.10105390","is_oa":false,"landing_page_url":"https://doi.org/10.1109/csicc58665.2023.10105390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 28th International Computer Conference, Computer Society of Iran (CSICC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W583775701","https://openalex.org/W1508746969","https://openalex.org/W1985997738","https://openalex.org/W1997283223","https://openalex.org/W2078622012","https://openalex.org/W2080042417","https://openalex.org/W2091257817","https://openalex.org/W2125799878","https://openalex.org/W2137958753","https://openalex.org/W2168009894","https://openalex.org/W2170937519","https://openalex.org/W2808406582","https://openalex.org/W2810937500","https://openalex.org/W2883600947","https://openalex.org/W2994611039","https://openalex.org/W3003186056","https://openalex.org/W3117244950","https://openalex.org/W3140248288","https://openalex.org/W4233200259","https://openalex.org/W4235434177","https://openalex.org/W6616958779","https://openalex.org/W6752407564","https://openalex.org/W6752948398","https://openalex.org/W6771123172"],"related_works":["https://openalex.org/W1523547988","https://openalex.org/W1483438220","https://openalex.org/W1676587966","https://openalex.org/W4301041047","https://openalex.org/W2963209704","https://openalex.org/W2595899102","https://openalex.org/W1768862053","https://openalex.org/W2421475109","https://openalex.org/W1629505938","https://openalex.org/W1504650505"],"abstract_inverted_index":{"It":[0,98],"has":[1,85,120,137],"been":[2,30,61,86,121,138],"known":[3],"that":[4,101],"the":[5,10,34,78,82,131,135],"time":[6,69],"complexity":[7],"of":[8,81,130],"solving":[9,33],"N-Queens":[11,107,132],"problem,":[12],"a":[13,55,143],"classic":[14],"problem":[15,35,66,133],"with":[16,108],"many":[17],"applications":[18],"in":[19,40,67,114],"computer":[20],"science":[21],"is":[22,99],"Nondeterministic":[23],"Polynomial":[24],"(NP).":[25],"Many":[26],"different":[27,128],"approaches":[28],"have":[29,60],"proposed":[31,62,83,118],"for":[32,74,88],"since":[36],"its":[37],"first":[38],"presentation":[39],"1848":[41],"including":[42],"genetic":[43],"algorithms,":[44],"brute":[45],"force":[46],"search":[47],"and":[48,96,147],"propositional":[49],"logic":[50],"statements.":[51],"In":[52],"this":[53,65],"paper,":[54],"novel":[56],"idea":[57],"called":[58],"Layouts":[59,71],"to":[63,126],"solve":[64],"\u03b8(n)":[68],"complexity.":[70],"are":[72],"patterns":[73],"placing":[75],"queens":[76],"on":[77],"chessboard.":[79],"Correctness":[80],"approach":[84,119],"proven":[87],"all":[89],"natural":[90],"numbers":[91],"using":[92,103],"proof":[93],"by":[94,102,123,140],"contradiction":[95],"exhaustion.":[97],"shown":[100],"only":[104],"5":[105],"layouts,":[106],"any":[109],"size":[110,136],"can":[111],"be":[112],"solved":[113],"linear":[115],"time.":[116],"The":[117],"verified":[122],"being":[124],"applied":[125],"60":[127],"sizes":[129],"where":[134],"chosen":[139],"randomly":[141],"selecting":[142],"number":[144],"between":[145],"1000":[146],"10000.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}