Cite Article
Development of an Application for Interactive Research and Analysis of the N-Queens Problem
Choose citation formatBibTeX
@article{IJASEIT14523, author = {Velin Kralev and Radoslava Kraleva and Dimitar Chakalov}, title = {Development of an Application for Interactive Research and Analysis of the N-Queens Problem}, journal = {International Journal on Advanced Science, Engineering and Information Technology}, volume = {11}, number = {5}, year = {2021}, pages = {1811--1817}, keywords = {N-queens problem; backtracking algorithm; decision problem; software development; application programs.}, abstract = {This paper presents a study on the N-Queens Problem. Different approaches to its solution discussed in the scientific literature are analyzed. The implementation of an algorithm based on the backtracking method is also presented. The algorithm is optimized to find solutions in a specific subset of configurations among all possible ones. With this approach, the computational complexity of the algorithm is reduced from exponential to quadratic. In this way, the algorithm finds all possible solutions in a shorter time: fundamental and their symmetrical equivalents. The methodology for conducting the experiments is presented. The purpose of the study, the tasks to be performed, and the conditions for conducting the experiments are presented as well. In connection with the research, an application that implements the presented algorithm has been developed. This application generated all the results obtained in this study. The experimental results show that with a linear increase in the number of queens (equivalent to a quadratic increase in the number of fields on the board, the number of recursive calls made by the algorithm increases exponentially. Similarly, the number of possible solutions, as well as the execution time of the algorithm (in the different modes of the application - internal, interactive, and combined), also increases exponentially. However, the algorithm's execution time in the internal mode is significantly shorter than in the other two modes - interactive and combined. The future guidelines for the study are presented.}, issn = {2088-5334}, publisher = {INSIGHT - Indonesian Society for Knowledge and Human Development}, url = {http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=14523}, doi = {10.18517/ijaseit.11.5.14523} }
EndNote
%A Kralev, Velin %A Kraleva, Radoslava %A Chakalov, Dimitar %D 2021 %T Development of an Application for Interactive Research and Analysis of the N-Queens Problem %B 2021 %9 N-queens problem; backtracking algorithm; decision problem; software development; application programs. %! Development of an Application for Interactive Research and Analysis of the N-Queens Problem %K N-queens problem; backtracking algorithm; decision problem; software development; application programs. %X This paper presents a study on the N-Queens Problem. Different approaches to its solution discussed in the scientific literature are analyzed. The implementation of an algorithm based on the backtracking method is also presented. The algorithm is optimized to find solutions in a specific subset of configurations among all possible ones. With this approach, the computational complexity of the algorithm is reduced from exponential to quadratic. In this way, the algorithm finds all possible solutions in a shorter time: fundamental and their symmetrical equivalents. The methodology for conducting the experiments is presented. The purpose of the study, the tasks to be performed, and the conditions for conducting the experiments are presented as well. In connection with the research, an application that implements the presented algorithm has been developed. This application generated all the results obtained in this study. The experimental results show that with a linear increase in the number of queens (equivalent to a quadratic increase in the number of fields on the board, the number of recursive calls made by the algorithm increases exponentially. Similarly, the number of possible solutions, as well as the execution time of the algorithm (in the different modes of the application - internal, interactive, and combined), also increases exponentially. However, the algorithm's execution time in the internal mode is significantly shorter than in the other two modes - interactive and combined. The future guidelines for the study are presented. %U http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=14523 %R doi:10.18517/ijaseit.11.5.14523 %J International Journal on Advanced Science, Engineering and Information Technology %V 11 %N 5 %@ 2088-5334
IEEE
Velin Kralev,Radoslava Kraleva and Dimitar Chakalov,"Development of an Application for Interactive Research and Analysis of the N-Queens Problem," International Journal on Advanced Science, Engineering and Information Technology, vol. 11, no. 5, pp. 1811-1817, 2021. [Online]. Available: http://dx.doi.org/10.18517/ijaseit.11.5.14523.
RefMan/ProCite (RIS)
TY - JOUR AU - Kralev, Velin AU - Kraleva, Radoslava AU - Chakalov, Dimitar PY - 2021 TI - Development of an Application for Interactive Research and Analysis of the N-Queens Problem JF - International Journal on Advanced Science, Engineering and Information Technology; Vol. 11 (2021) No. 5 Y2 - 2021 SP - 1811 EP - 1817 SN - 2088-5334 PB - INSIGHT - Indonesian Society for Knowledge and Human Development KW - N-queens problem; backtracking algorithm; decision problem; software development; application programs. N2 - This paper presents a study on the N-Queens Problem. Different approaches to its solution discussed in the scientific literature are analyzed. The implementation of an algorithm based on the backtracking method is also presented. The algorithm is optimized to find solutions in a specific subset of configurations among all possible ones. With this approach, the computational complexity of the algorithm is reduced from exponential to quadratic. In this way, the algorithm finds all possible solutions in a shorter time: fundamental and their symmetrical equivalents. The methodology for conducting the experiments is presented. The purpose of the study, the tasks to be performed, and the conditions for conducting the experiments are presented as well. In connection with the research, an application that implements the presented algorithm has been developed. This application generated all the results obtained in this study. The experimental results show that with a linear increase in the number of queens (equivalent to a quadratic increase in the number of fields on the board, the number of recursive calls made by the algorithm increases exponentially. Similarly, the number of possible solutions, as well as the execution time of the algorithm (in the different modes of the application - internal, interactive, and combined), also increases exponentially. However, the algorithm's execution time in the internal mode is significantly shorter than in the other two modes - interactive and combined. The future guidelines for the study are presented. UR - http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=14523 DO - 10.18517/ijaseit.11.5.14523
RefWorks
RT Journal Article ID 14523 A1 Kralev, Velin A1 Kraleva, Radoslava A1 Chakalov, Dimitar T1 Development of an Application for Interactive Research and Analysis of the N-Queens Problem JF International Journal on Advanced Science, Engineering and Information Technology VO 11 IS 5 YR 2021 SP 1811 OP 1817 SN 2088-5334 PB INSIGHT - Indonesian Society for Knowledge and Human Development K1 N-queens problem; backtracking algorithm; decision problem; software development; application programs. AB This paper presents a study on the N-Queens Problem. Different approaches to its solution discussed in the scientific literature are analyzed. The implementation of an algorithm based on the backtracking method is also presented. The algorithm is optimized to find solutions in a specific subset of configurations among all possible ones. With this approach, the computational complexity of the algorithm is reduced from exponential to quadratic. In this way, the algorithm finds all possible solutions in a shorter time: fundamental and their symmetrical equivalents. The methodology for conducting the experiments is presented. The purpose of the study, the tasks to be performed, and the conditions for conducting the experiments are presented as well. In connection with the research, an application that implements the presented algorithm has been developed. This application generated all the results obtained in this study. The experimental results show that with a linear increase in the number of queens (equivalent to a quadratic increase in the number of fields on the board, the number of recursive calls made by the algorithm increases exponentially. Similarly, the number of possible solutions, as well as the execution time of the algorithm (in the different modes of the application - internal, interactive, and combined), also increases exponentially. However, the algorithm's execution time in the internal mode is significantly shorter than in the other two modes - interactive and combined. The future guidelines for the study are presented. LK http://ijaseit.insightsociety.org/index.php?option=com_content&view=article&id=9&Itemid=1&article_id=14523 DO - 10.18517/ijaseit.11.5.14523