Project Code Name: Baked Alaska


Student's Guide



In this project l use the history list in an attempt to solve the Koenigsberg Bridge problem. The problem was one of the first major problems in the area of mathematics called graph theory. Graph theory is somewhat related to the theory of computer networks.

    As in the diagram below there were seven bridges in the old town of Koenigsberg, at that time in Prussia, but now in present day Latvia. Starting at any point, can you travel across every bridge exactly once without crossing any bridge twice?

Konigsberg Bridge Problem

Pick a starting point on an island or side of the river!

A famous mathematician by the name of Leonard Euler (pronounced Oiler just like the football team) proved that there were no solutions to the problem, i.e. every path fails.

  • Step 1

    Open the game by clicking on the map above



  • Step 2

    Access the history list on the browser. Try all the links and the history list until you are feel good about using it.

  • Step 3


    Follow the directions and click on the various positions in the town.