{"id":"https://openalex.org/W7207828398","doi":"https://doi.org/10.20894/ijcoa.101.015.001.005","title":"Performance Analysis of the N-Queen Problem Using a Brute Force Optimization Approach","display_name":"Performance Analysis of the N-Queen Problem Using a Brute Force Optimization Approach","publication_year":2026,"publication_date":"2026-08-24","ids":{"openalex":"https://openalex.org/W7207828398","doi":"https://doi.org/10.20894/ijcoa.101.015.001.005"},"language":"en","primary_location":{"id":"doi:10.20894/ijcoa.101.015.001.005","doi":"https://doi.org/10.20894/ijcoa.101.015.001.005","is_oa":false,"landing_page_url":"https://doi.org/10.20894/ijcoa.101.015.001.005","pdf_url":null,"source":{"id":"https://openalex.org/S2764729214","display_name":"International Journal of Computing Algorithm","issn_l":"2278-2397","issn":["2278-2397"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computing Algorithm","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W7207828398"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5133776972","display_name":"Vishal Khanna","orcid":"https://orcid.org/0009-0000-4207-6423","observed_orcids":["https://orcid.org/0009-0000-4207-6423"]},"institutions":[{"id":"https://openalex.org/I110360157","display_name":"Lovely Professional University","ror":"https://ror.org/00et6q107","country_code":"IN","type":"education","lineage":["https://openalex.org/I110360157"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Vishal Khanna","raw_affiliation_strings":["Lovely Professional University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lovely Professional University","institution_ids":["https://openalex.org/I110360157"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5133776972"],"corresponding_institution_ids":["https://openalex.org/I110360157"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"1","first_page":"49","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.8779000043869019,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.8779000043869019,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.10660000145435333,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.004000000189989805,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/n-queens-problem","display_name":"N-Queens problem","score":0.9269999861717224},{"id":"https://openalex.org/keywords/exhaustive-search","display_name":"exhaustive search","score":0.9879999756813049},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.8619999885559082},{"id":"https://openalex.org/keywords/space-complexity","display_name":"space complexity","score":0.9990000128746033},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.9350000023841858},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"constraint satisfaction","score":0.6259999871253967},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9409999847412109},{"id":"https://openalex.org/keywords/search-space-explosion","display_name":"search space explosion","score":0.597000002861023}],"concepts":[{"id":"https://openalex.org/C2986801135","wikidata":"https://www.wikidata.org/wiki/Q1209494","display_name":"Brute force","level":2,"score":0.7670999765396118},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6172999739646912},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6150000095367432},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.609000027179718},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.604200005531311},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5878000259399414},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5622000098228455},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5414000153541565},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.531000018119812},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5062000155448914},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.42899999022483826},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.421099990606308},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4047999978065491},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.39629998803138733},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.3564000129699707},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.34299999475479126},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C207468940","wikidata":"https://www.wikidata.org/wiki/Q869370","display_name":"Brute-force attack","level":3,"score":0.3190000057220459},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.31130000948905945},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.30489999055862427},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.29260000586509705},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C84211073","wikidata":"https://www.wikidata.org/wiki/Q117879","display_name":"Floating point","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26759999990463257},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2581000030040741},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.2526000142097473}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.20894/ijcoa.101.015.001.005","doi":"https://doi.org/10.20894/ijcoa.101.015.001.005","is_oa":false,"landing_page_url":"https://doi.org/10.20894/ijcoa.101.015.001.005","pdf_url":null,"source":{"id":"https://openalex.org/S2764729214","display_name":"International Journal of Computing Algorithm","issn_l":"2278-2397","issn":["2278-2397"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computing Algorithm","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2080042417","https://openalex.org/W2121766240","https://openalex.org/W2295268496"],"related_works":["https://openalex.org/W7155494300","https://openalex.org/W7123747586","https://openalex.org/W4403605348","https://openalex.org/W7125806889","https://openalex.org/W7123573280","https://openalex.org/W7213524069","https://openalex.org/W7125830220","https://openalex.org/W7123450846","https://openalex.org/W2755979702","https://openalex.org/W7123733475"],"abstract_inverted_index":{"The":[0,92,262],"N-Queen":[1,73,246],"problem":[2,11,48,74,247],"is":[3,127,143,163,179,206],"a":[4,54,68,189,236,251,282],"well-known":[5],"combinatorial":[6,277],"optimization":[7,60,258,289],"and":[8,44,62,100,138,173,248,259,279],"constraint":[9],"satisfaction":[10],"in":[12,98,145,225,288],"computer":[13],"science,":[14],"which":[15,81],"requires":[16],"placing":[17],"N":[18,22,24,119],"queens":[19,30],"on":[20,166],"an":[21],"\u00d7":[23],"chessboard":[25],"such":[26,132],"that":[27,200],"no":[28],"two":[29],"threaten":[31],"each":[32],"other":[33],"horizontally,":[34],"vertically,":[35],"or":[36,108],"diagonally.":[37],"Owing":[38],"to":[39,88,102,181,222,281],"its":[40,213,229],"exponential":[41,223],"search":[42,195,272],"space":[43,136],"strict":[45],"constraints,":[46],"the":[47,72,77,116,124,151,185,193,202,231,241,245,268],"has":[49],"been":[50],"extensively":[51],"used":[52],"as":[53,115,133,250],"benchmark":[55],"for":[56,169,208,217,239,254,274],"evaluating":[57],"algorithmic":[58,286],"efficiency,":[59],"strategies,":[61],"computational":[63,155],"complexity.":[64],"This":[65],"paper":[66],"presents":[67],"comprehensive":[69],"analysis":[70],"of":[71,118,147,154,211,244,264,270,285],"solved":[75],"using":[76,129],"brute":[78,93,203,232],"force":[79,94,204,233],"technique,":[80],"systematically":[82],"explores":[83],"all":[84],"possible":[85],"board":[86,159,171,219],"configurations":[87,172],"identify":[89],"valid":[90,190],"solutions.":[91],"approach,":[95],"although":[96],"simple":[97],"design":[99],"easy":[101],"implement,":[103],"does":[104],"not":[105],"employ":[106],"heuristics":[107],"pruning":[109],"mechanisms,":[110],"making":[111],"it":[112],"computationally":[113],"intensive":[114],"value":[117],"increases.":[120],"In":[121],"this":[122,265],"study,":[123],"algorithm's":[125],"performance":[126,214],"evaluated":[128],"key":[130],"parameters":[131],"time":[134],"complexity,":[135,137],"convergence":[139,177],"rate.":[140],"Time":[141],"complexity":[142,162],"examined":[144],"terms":[146],"factorial":[148],"growth,":[149],"highlighting":[150],"rapid":[152],"escalation":[153],"cost":[156],"with":[157],"increasing":[158],"size.":[160],"Space":[161],"analysed":[164],"based":[165],"memory":[167],"requirements":[168],"storing":[170],"recursive":[174],"processing.":[175],"Additionally,":[176],"rate":[178],"discussed":[180],"assess":[182],"how":[183],"quickly":[184],"algorithm":[186],"arrives":[187],"at":[188],"solution":[191],"within":[192],"exhaustive":[194],"space.":[196],"Experimental":[197],"observations":[198],"indicate":[199],"while":[201],"method":[205],"effective":[207],"small":[209],"values":[210],"N,":[212],"degrades":[215],"significantly":[216],"larger":[218],"sizes":[220],"due":[221],"growth":[224],"computation":[226],"time.":[227],"Despite":[228],"limitations,":[230],"technique":[234],"provides":[235],"fundamental":[237],"baseline":[238],"understanding":[240,284],"inherent":[242],"difficulty":[243],"serves":[249],"reference":[252],"point":[253],"comparing":[255],"more":[256],"advanced":[257],"heuristic-based":[260],"algorithms.":[261],"findings":[263],"study":[266],"emphasize":[267],"necessity":[269],"intelligent":[271],"strategies":[273],"solving":[275],"large-scale":[276],"problems":[278],"contribute":[280],"deeper":[283],"trade-offs":[287],"research.":[290]},"counts_by_year":[],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2026-09-04T00:00:00"}