The Genetic Algorithm Game - Solving a Complex Pathway Problem with Evolution:
You start with a complex map (attached here as a pdf file, or see the picture above or create your own map). There is a way of getting from point A to area B in very many different combinations. Figuring out the fastest way to get there is the object of the game.
There are five sections (decisions) to the path. Starting at point A, once could go left (L), straight (S), or right (R). Each time you reach the next point (crossroads) you can choose to go left, straigt, or right. Since the path has five such points, the "genetic code" will consist of five such decisions.
For example, one student in the class can go first left, then right, then left, then straight, and finally straight to reach the final destination of B. For this student, the genetic code would be: LRLSS.