N-queens pattern generation: an insight into space complexity of a backtracking algorithm

Authors:
Adrijan Bozinovski;Stevo Bozinovski
Affiliations:
Zagreb University, Croatia;South Carolina State University
Venue:
ISICT '04 Proceedings of the 2004 international symposium on Information and communication technologies
Year:
2004

Citing 16
Cited 1

The average complexity of depth-first search with backtracking and cutoff

IBM Journal of Research and Development
Solutions to the n Queens problem using tasking in Ada

ACM SIGPLAN Notices
Efficient search techniques—an empirical study of the N-Queens problem

IBM Journal of Research and Development
Expected performance of m-solution backtracking

SIAM Journal on Computing
Solving the n-queens problem using genetic algorithms

SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
A dynamic programming solution to the n-queens problem

Information Processing Letters
Linear congruence equations for the solutions of the N-Queens problem

Information Processing Letters
Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
Fundamentals of algorithmics

Fundamentals of algorithmics
Evaluation of declarative n-queens recursion: a deductive database approach

Information Sciences: an International Journal
Backtrack Programming

Journal of the ACM (JACM)
Construction through decomposition: a divide-and-conquer algorithm for the N-queens problem

ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Backtrack programming techniques

Communications of the ACM
Program development by stepwise refinement

Communications of the ACM
Java, Java, Java!: Object-Oriented Problem Solving with Cdrom

Java, Java, Java!: Object-Oriented Problem Solving with Cdrom
Java How to Program (6th Edition)

Java How to Program (6th Edition)

Optimization of N-queens solvers on graphics processors

APPT'11 Proceedings of the 9th international conference on Advanced parallel processing technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.