Add Papers Marked0
Paper checked off!

Marked works

Viewed0

Viewed works

Shopping Cart0
Paper added to shopping cart!

Shopping Cart

Register Now

eKönyvtár library
FAQ
 

Great deal: today with a discount!

Regular price:
4 717 Ft
You save:
566 Ft
Discounted price*:
4 150 Ft
Purchase
Add to Wish List
ID number:546096
Evaluation:
Published: 28.11.2004.
Language: English
Level: Secondary school
Literature: n/a
References: Not used
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…

Load more similar papers

Send to email

Your name:

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

Choose Authorization Method

Email & Password

Email & Password

Wrong e-mail adress or password!
Log In

Forgot your password?

Facebook

Not registered yet?

Register and redeem free papers!

To receive free papers from eKönyvtár.com it is necessary to register. It's quick and will only take a few seconds.

If you have already registered, simply to access the free content.

Cancel Register