Download Initial state: Goal state:

yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Multi-armed bandit wikipedia , lookup

Gene expression programming wikipedia , lookup

History of artificial intelligence wikipedia , lookup

Existential risk from artificial general intelligence wikipedia , lookup

Genetic algorithm wikipedia , lookup

COMP 703
Artificial Intelligence - Assignment 2
Due Date: 11 April 2014
Marks: 20
Implement a genetic programming system to evolve an algorithm to solve the Towers of
Hanoi problem. The Towers of Hanoi problem is defined as follows:
Towers of Hanoi
Initial state:
Goal state:
The initial state contains n rings on the leftmost pole. These rings must be moved to
the rightmost pole as illustrated in the goal state. At most one ring can be moved at a
time. A larger ring cannot be placed on top of a smaller ring. Rings can be placed on all
three poles.
Determine the steps that must be performed to get from the initial state to the goal
The user should be able to enter:
The number of rings. This should range from 3 to 7.
Values for the GP control parameters in a file or via an interface.
In addition to submitting your program you must submit a report:
Describing the elements of both the function and terminal sets.
Comparing the performance of GP in solving problems of varying difficulty, i.e. 3
to 7 rings.
A table listing the genetic programming parameters used (can be submitted as a
separate file).
The solution obtained for each seed (perform about 10 runs) and the generation
on which each solution was found for each of the problems (can be submitted as
a separate file). Please note that the same parameter values should be used for
all 10 runs performed for a problem.