Title: APLICACIÓN DEL SIMULATED ANNEALING AL PROBLEMA DE LAS N REINAS
Abstract: Simulated Annealing, as combinatorial optimization technique, is used to deals with problems of great mathematical complexity; it counts with an acceptation strategy for the new configuration that allows escape from local minimums and find high quality solutions. N Queens problem is a classic problem of combinatorial search that requires to locate N queens on a board of nxn dimensions with the condition that the queens must not attack each other. This paper shows the Simulated Annealing algorithm, the way to use it and its implementation to solve the N Quens problem.
Publication Year: 2005
Publication Date: 2005-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot