Attempt 2 - Eight Queen Problem using Genetic Algorithm
Attempt 1 - Sudoku Solver (Failed)

May 24, 2012

7

Ali Raza

Optimizing strategy of kicking behavior

May 21, 2012

8

Nida Sadaf Khan

Computational intelligence in cryptography

May 24, 2012

9

Arif Imran

Solving N-Queens Chess Problem In chess, a queen can move as far as she pleases, horizontally, vertically, or diagonally. A chess board has 8 rows and 8 columns. The standard 8 by 8 queen's problem asks how to place 8 queens on an ordinary chess board so that none of them can hit any other in one move. Here we solve this problem with a genetic algorithm for a n (n is between 8 and 30) queen problem.

May 24, 2012

10

Shamaila Mahmood

Game content development for the Android based game Move the box

May 21, 2012

11

Tahir Akhtar

Solution of the game Move the box.

May 21, 2012

12

Maira Ata

Classification of news items using neuro-evolution approach

S.#Student NameTopicPresentation DayAttempt 1 - Sudoku Solver (Failed)

Solving N-Queens Chess ProblemIn chess, a queen can move as far as she pleases, horizontally, vertically, or diagonally. A chess board has 8 rows and 8 columns. The standard 8 by 8 queen's problem asks how to place 8 queens on an ordinary chess board so that none of them can hit any other in one move. Here we solve this problem with a genetic algorithm for a n (n is between 8 and 30) queen problem.