Solving N-Queens problem using Genetic Algor... / ID: 546096

Get information about new eKönyvtár works!

Regular price:: 4 702 Ft
You save:: 753 Ft
Discounted price*:: 3 949 Ft

Purchase

Add to Wish List

In Wish List

ID number:546096

Author: Anonymous author (5)

Evaluation:

Published: 28.11.2004.

Language: English

Level: Secondary school

Literature: n/a

References: Not used

Enlarge preview

Extract

1 Introduction
The N-Queens problem is a classical AI problem. Its name is derived from the allowed moves for the queen piece in chess. Queens are allowed to move horizontally, vertically, or diagonally, backward and forward, with the only restriction being that they can move in only one direction at a time. A queen that can reach another piece in one move captures it.
The N-Queens problem is based on the notion of trying to place N queens on an N x N grid, such that no queen will be able to capture any other queen. The N-queens problem is typical of many combinatorial problems, in that…

Work pack:

GREAT DEAL buying in a pack ➞ your savings −2 206 Ft

Solving N-Queens problem using Genetic Algorithms
Essays10 Computers, Consumer Electronics
The Effects of Wireless Technology on Hospitality Retail and Tourism Trade
Essays5 Computers, Consumer Electronics
The Negative Side of the Internet and how Censorship Should Be Dealt with Concerning Others Especially Children
Essays2 Computers, Consumer Electronics

Work pack Nr. 1290883

Purchase a work pack of 3

Show work pack

Send to email

Your name:

Your name

Enter an email address where the link will be sent:

Enter an email address where the link will be sent

Hi!

{Your name} suggests you to check out this eKönyvtár paper on „Solving N-Queens problem using Genetic Algorithms”.

Link to paper:
https://eng.ekonyvtar.eu/w/546096

Send

Email has been sent

Essays

Technologies

Computers, Consumer Electronics

Solving N-Queens problem using Genetic Algorithms