Solving N Queen Problem using Genetic Algorithm

Farhan, Ahmed S.; Tareq, Wadhah Zeyad; Awad, Fouad H.

doi:10.5120/21750-5005

Cited by 5 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Pada penelitian [7], n queens problem dipecahkan menggunakan algoritma genetika dengan jumlah n yang diujikan yaitu n=10-25, dan mendapatkan 3 solusi optimal masing-masing n dengan hasil iterasi yang bervariasi. Penelitian lain [8] menerapkan GA untuk menemukan jumlah maksimal solusi yang mungkin diperoleh pada papan catur 8x8, dan hasilnya ditemukan 92 kemungkinan solusi optimal untuk papan catur 8x8. Menurut penelitian [9] algoritma Firefly dapat diterapkan pada problem serupa dalam teka-teki catur yaitu Knight Tour Problem (KTP) yang merupakan urutan langkah kuda pada papan catur tepat satu kali.…”

Section: Pendahuluanunclassified

See 1 more Smart Citation

Implementation of the Firefly Algorithm in the Case of N-Queens Problem

Nggego

Setyanto

Sukoco

2020

RESTI

View full text Add to dashboard Cite

N-Queen problem is a form of puzzle game that uses chess rules for the queen on the standard chessboard with modified size. The challenge of the n-queen problem is finding the N ( N is positive integer) queens position on the chessboard, so that no queen can attack another queen on the board in a single move. Implementation of firefly algorithm in n-queens problem in this study aims to find n-queen problem solutions and count the number of iterations to achieve the optimal solution of each queen which will then be compared with the results of Sarkar and Nag's research (2017). This study uses an experimental method with a number of N between 10 to 20 and uses a population of 15 and 1000 firefly. The results showed that the firefly algorithm is able to find all the optimal solutions for the queen's position on a chessboard with dimensions 10 to 20 in a population of 1000 firefly. The firefly algorithm can find the optimal solution fewer iterations compared to the genetic algorithm. According to the experiment, firefly algorithm shows better performance in finding the optimal solution compared to genetic algorithm.

show abstract

Section: Pendahuluanunclassified

“…Hasilnya menunjukkan bahwa algoritma mempunyai kemampuan untuk menemukan solusi terkait masalah ini, tidak hanya cepat namun juga mengarah pada kinerja yang lebih baik. [10,18,7,12,1,6,2,14,8,13,16,3,11,4,17,5,9,15,0] 3268.2356 s ± -2 [13,0,17,11,5,12,16,3,15,6,1,4,10,8,14,18,2,9,7] -1 [17,9,5,2,8,3,15,7,14,16,1,13,11,18,…”

Section: Gambar 1 Solusi N-queens 8x8unclassified