The task is to build a genetic algorithm engine. It would use a modular architecture allowing pluggable breeding/mutation methods and pluggable fitness calculations. The winners of each generation will be saved to file.
The final product will have at least two breeding/mutation methods. The test case for fitness will be a very simple "shortest path through a region" type of problem.
The project will be written in C# (can use Visual Studio or MonoDevelop).
Telephone: 0504 658 750
Preferred method of contact: Don't care
Location (if not on main UWA campus): Leederville, but can meet students at UWA