{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/a-non-recursive-space-efficient-blind","title":"A Non-Recursive Space-Efficient Blind Approach to Find All Possible Solutions to the N-Queens Problem","arxiv_id":null,"date":"2023-06-01","proceeding":"International Conference on Innovations in Data Analytics: ICIDA 2023 6","authors":["Suklav Ghosh","Sarbajit Manna"],"abstract":"N-Queen’s problem is the problem of placing N number of chess\r\nqueens on an NxN chessboard such that none of them attack each other. A chess\r\nqueen can move horizontally, vertically, and diagonally. So, the neighbours of a\r\nqueen have to be placed in such a way so that there is no clash in these three directions. Scientists accepts the fact that the branching factor increases in a nearly\r\nlinear fashion. With the use of artificial intelligence search patterns like Breadth\r\nFirst Search (BFS), Depth First Search (DFS) and backtracking algorithms, many\r\nacademics have identified the problem and found out a number of techniques to\r\ncompute possible solutions to n-queen’s problem. The solutions using a blind\r\napproach, that is, uninformed searches like BFS and DFS, use recursion. Also,\r\nbacktracking uses recursion for the solution of this problem. All these recursive\r\nalgorithms use a system stack which is limited. So, for a small value of N, it exhausts the memory quickly though it depends on machine. This paper deals with\r\nthe above problem and proposes a non-recursive DFS search-based approach to\r\nsolve the problem to save system memory. In this work, Depth First Search (DFS)\r\nis used as a blind approach or uninformed search. This experimental study yields\r\na noteworthy result in terms of time and space.","url_abs":"https://doi.org/10.1007/978-981-99-0550-8_27","url_pdf":"https://doi.org/10.1007/978-981-99-0550-8_27","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":"a-non-recursive-space-efficient-blind","repo_url":"https://github.com/suklav/Artificial-Intelligence/blob/main/Nqueens_DFS.cpp","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"all","task_name":"All"},{"task_slug":"n-queens-problem-all-possible-solutions","task_name":"N-Queens Problem - All Possible Solutions"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/n-queens-problem-all-possible-solutions-on","task":"N-Queens Problem - All Possible Solutions","dataset":".","model":"Non-Recursive Blind Approach by Ghosh et al","rank_in_archive_order":1,"of":1,"metrics":{"Delay (seconds)":"41 for N=14 Queens"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"suklav/Artificial-Intelligence","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"de400df79c716aec75086745c96611b9b9b569ed6230203700e55c11e54b3ebf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}