Eight Queens

Project Name : N Queens (8)

Under Supervision of :

Prof.Dr. Taher Hamza
Eng. Islam Foad

-----------------------------------------------------------------------------

The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens attack each other. Thus, a solution requires that no two queens share the same row, column, or diagonal. The eight queens puzzle is an example of the more general n-queens problem of placing n queens on an n×n chessboard.

-----------------------------------------------------------------------------

Problems solution:
We will solve this problem by using A* algorithm.
Implementation by Java Programming Language
-----------------------------------------------------------------------------
ODESA:
Observable (O) : Full observable.
Deterministic (D) : Deterministic.
Episode (E) : Sequential.
Episode (E) : Static.
Agent (A) : Single.
-----------------------------------------------------------------------------
Problem Formulating:
Initial State : Empty chessboard.
Successor Function : Move to legal position .
Goal test: 7 queens don't attack each other.
Path cost Each move cost 1.

Team Members :
1- Bahy Mohamed El-Sa'eed (Section : 2)
2- Khaled Sultan Abdel-Majeed (Section : 2)
3- Tawfeek Yahia Muhammad (Section : 2)