Abstract
To solve the 8-queen problem in Chess is always the classical problem in mathematics and computer fields. Based on brief introduction of logic programming language Prolog, the author uses Prolog program to solve the 8-queen up to N-queen problem and improve running speed and simplify the algorithm complexity by the agency of features of Prolog logic language and through optimizing recursive algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Mai, Z., Lv, W.: Principles of programming languages. Beihang University press (February 2011)
Gu, B.: Multi-paradigm programming language. Science Press (June 2006)
Louden, K.C., Lambert, K.: Programming Languages Principles and Practice, 3rd edn. Course Technology (January 2011)
Pratt, T.W., Zelkowitz, M.V.: Programming Languages Design and Implementation, 4th edn. Prentice-Hall (September 2000)
Mitchell, J.C.: Concepts in Programming Languages. Cambridge Univ. Press (2003)
Lei, Y., Xing, Q.: Visual Prolog programming environment and interface. National Defence Industry Press (January 2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gu, B. (2012). Research and Realization of N–Queens Problem Based on the Logic Language Prolog. In: Li, Z., Li, X., Liu, Y., Cai, Z. (eds) Computational Intelligence and Intelligent Systems. ISICA 2012. Communications in Computer and Information Science, vol 316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34289-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-34289-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34288-2
Online ISBN: 978-3-642-34289-9
eBook Packages: Computer ScienceComputer Science (R0)