A Non-asymptotic Space Complexity of a Backtracking Algorithm for the N-queens Problem
Adrijan Bozinovski, Stevo Bozinovski
Progress in Signals and Telecommunication Engineering, Vol. 9, No. 2, 2020.
DOI: 
Link: http://www.dline.info/pste/fulltext/v9n2/pstev9n2_2.pdf
Abstract:
In this research we have studied the space complexity function to offset the shortcoming in the application memory. This is applied particularly when solving the N-queens issue. We found that it is essential to design the required memory space and to monitor the space complexity function in some input domain. We have described the detailed space complexity which is given for when the condition the value of N is less than forty.