Skip to main content
Top

2020 | OriginalPaper | Chapter

Faster Convergence to N-Queens Problem Using Reinforcement Learning

Authors : Patnala Prudhvi Raj, Preet Shah, Pragnya Suresh

Published in: Modeling, Machine Learning and Astronomy

Publisher: Springer Singapore

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Algorithmic complexity has been a constraint to solving problems efficiently. Wide use of an algorithm is dependent on its space and time complexity for large inputs. Exploiting an inherent pattern to solve a problem could be easy compared to an algorithm-based approach. Such patterns are quite necessary at cracking games with a vast number of possibilities as an algorithm-based approach would be computationally expensive and time-consuming. The N-Queens problem is one such problem with many possible configurations and realizing a solution to this is hard as the value of N increases. Reinforcement Learning has proven to be good at building an agent that can learn these hidden patterns over time to converge to a solution faster. This study shows how reinforcement learning can outperform traditional algorithms in solving the N-Queens problem.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
2.
go back to reference Draa, A., Meshoul, S., Talbi, H., Batouche, M.: A quantum-inspired differential evolution algorithm for solving the n-queens problem. Neural Networks 1(2) (2011) Draa, A., Meshoul, S., Talbi, H., Batouche, M.: A quantum-inspired differential evolution algorithm for solving the n-queens problem. Neural Networks 1(2) (2011)
3.
go back to reference Hu, X., Eberhart, R.C., Shi, Y.: Swarm intelligence for permutation optimization: a case study of n-queens problem. In: Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS 2003 (Cat. No. 03EX706), pp. 243–246. IEEE (2003) Hu, X., Eberhart, R.C., Shi, Y.: Swarm intelligence for permutation optimization: a case study of n-queens problem. In: Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS 2003 (Cat. No. 03EX706), pp. 243–246. IEEE (2003)
4.
go back to reference Kumar, V.: Algorithms for constraint-satisfaction problems: a survey. AI Mag. 13(1), 32 (1992) Kumar, V.: Algorithms for constraint-satisfaction problems: a survey. AI Mag. 13(1), 32 (1992)
5.
go back to reference Lim, S., Son, K., Park, S., Lee, S.: The improvement of convergence rate in n-queen problem using reinforcement learning. J. Korean Inst. Intell. Syst. 15(1), 1–5 (2005)CrossRef Lim, S., Son, K., Park, S., Lee, S.: The improvement of convergence rate in n-queen problem using reinforcement learning. J. Korean Inst. Intell. Syst. 15(1), 1–5 (2005)CrossRef
6.
go back to reference Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529 (2015)CrossRef Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518(7540), 529 (2015)CrossRef
7.
go back to reference Papavassiliou, V.A., Russell, S.: Convergence of reinforcement learning with general function approximators. In: IJCAI, pp. 748–757 (1999) Papavassiliou, V.A., Russell, S.: Convergence of reinforcement learning with general function approximators. In: IJCAI, pp. 748–757 (1999)
8.
go back to reference Potapov, A., Ali, M.: Convergence of reinforcement learning algorithms and acceleration of learning. Phys. Rev.E 67(2), 026706 (2003)CrossRef Potapov, A., Ali, M.: Convergence of reinforcement learning algorithms and acceleration of learning. Phys. Rev.E 67(2), 026706 (2003)CrossRef
11.
go back to reference Zhang, C., Ma, J.: Counting solutions for the n-queens and latin-square problems by monte carlo simulations. Phys. Rev. E 79(1), 016703 (2009)CrossRef Zhang, C., Ma, J.: Counting solutions for the n-queens and latin-square problems by monte carlo simulations. Phys. Rev. E 79(1), 016703 (2009)CrossRef
Metadata
Title
Faster Convergence to N-Queens Problem Using Reinforcement Learning
Authors
Patnala Prudhvi Raj
Preet Shah
Pragnya Suresh
Copyright Year
2020
Publisher
Springer Singapore
DOI
https://doi.org/10.1007/978-981-33-6463-9_6

Premium Partner