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

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Adrijan Bozinovski Zagreb University, Croatia
Stevo Bozinovski South Carolina State University
Published in:
· Proceeding
ISICT '04 Proceedings of the 2004 international symposium on Information and communication technologies
Pages 281 - 286
Trinity College Dublin ©2004
table of contents ISBN:1-59593-170-8
N-queens pattern generation: an insight into space complexity of a backtracking algorithm 2004 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 51
· Downloads (cumulative): 1,317
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder