N-queens pattern generation: an insight into space complexity of a backtracking algorithm
Adrijan Božinovski, Stevo Bozinovski · 2004
It is proposed a method for tracking partial solutions while executing a backtracking algorithm. That enables observation of space requirements of a backtracking algorithm. To illustrate the method, the well known benchmark N-queens problem is considered. Results of the experiments are shown and discussed.