Solving n-Queen problem using global parallel genetic algorithm

Bozikovic, M.; Golub, Marin; Budin, Leo

doi:10.1109/eurcon.2003.1248159

Cited by 11 publications

(9 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Over the time, there are many authors employ different techniques to solve the N-queens, such as [1] applied genetic algorithms (GA) to solve N-queens problem. In order to improve GA speed and performance, a promising algorithm so-called global parallel genetic algorithm is introduced [1]. The results showed that GA managed to catch multiple solutions for nth of queens.…”

Section: Related Workmentioning

confidence: 99%

Hybridization of Bat and Genetic Algorithm to Solve N-Queens Problem

Al-Gburi¹,

Naim²,

Boraik³

2018

Bulletin EEI

View full text Add to dashboard Cite

In this paper, a hybrid of Bat-Inspired Algorithm (BA) and Genetic Algorithm (GA) is proposed to solve N-queens problem. The proposed algorithm executes the behavior of microbats with changing pulse rates of emissions and loudness to final all the possible solutions in the initialization and moving phases. This dataset applied two metaheuristic algorithms (BA and GA) and the hybrid to solve N-queens problem by finding all the possible solutions in the instance with the input sizes of area 8*8, 20*20, 50*50, 100*100 and 500*500 on a chessboard. To find the optimal solution, consistently, ten run have been set with 100 iterations for all the input sizes. The hybrid algorithm obtained substantially better results than BA and GA because both algorithms were inferior in discovering the optimal solutions than the proposed randomization method. It also has been discovered that BA outperformed GA because it requires a reduced amount of steps in determining the solutions.

show abstract

Section: Related Workmentioning

confidence: 99%

Hybridization of Bat and Genetic Algorithm to Solve N-Queens Problem

Al-Gburi¹,

Naim²,

Boraik³

2018

Bulletin EEI

View full text Add to dashboard Cite

show abstract

“…Also, Shagrir [10] continually oscillates but relaxes into a resolution in polynomial time and it solves the n-queens problem regardless of the dimension n or the initialized values.In addition, in reference [8], has been presented a new algorithm by global parallel genetic algorithm to solve n-queens problem. Also, reference [9] presents a new probabilistic algorithm that it is based on gradient based heuristic.…”

Section: Review Literaturementioning

confidence: 99%

A New Solution for N-Queens Problem using Blind Approaches: DFS and BFS Algorithms

SoleimanianGharehchopogh¹,

Seyyedi²,

Feyzipour³

2012

IJCA

View full text Add to dashboard Cite

The N×N queen's puzzle is the problem of placing N chess queen on an N×N chess board so that no two queens attack each other. This approach is a classical problem in the artificial intelligence area. A solution requires that no two queens share the same row, column or diagonal. These problems for computer scientists present practical solution to many useful applications and have become an important issue. In this paper we proposed new resolution for solving nQueens used combination of depth firs search (DFS) and breathe first search (BFS) techniques. The proposed algorithm act based on placing queens on chess board directly. This is possible by regular pattern on the basis of the work law of minister.The results show that performance and run time in this approach better then back tracking methods and hill climbing modes.

show abstract

“…1. The algorithm used in this paper differs from [3], [4] and [5] in which there were no two-point crossover operation employed. At the beginning of the search, a set of initial populations is created through random generation.…”

Section: Genetic Algorithm Implementationmentioning

confidence: 99%

Using genetic algorithm for solving N-Queens problem

Turky

Ahmad

2010

2010 International Symposium on Information Technology

View full text Add to dashboard Cite

The N-Queens problem is a well-known NP-Hard problem. Optimal solutions to small N values can be found in reasonable time by classical search algorithms or linear programming. However, since the N-Queens problem is a constraint satisfaction problem (CSP), it will be very time consuming to solve larger N values with guaranteed optimality. In this paper, genetic algorithm was adopted to solve the N-Queens problem. Results show that this evolutionary approach is very efficient and able to produce good results compared with other approaches e.g. classical search algorithms or linear programming.

show abstract

Solving n-Queen problem using global parallel genetic algorithm

Cited by 11 publications

References 0 publications

Hybridization of Bat and Genetic Algorithm to Solve N-Queens Problem

Hybridization of Bat and Genetic Algorithm to Solve N-Queens Problem

A New Solution for N-Queens Problem using Blind Approaches: DFS and BFS Algorithms

Using genetic algorithm for solving N-Queens problem

Contact Info

Product

Resources

About