How to Play
The idea behind this game is to untangle the shown graph into a planar graph which means that no two lines are intersecting.
To achieve this drag the nodes around and once you think you are finished press the check button. Upon success you will advance to the next and more difficult stage. Otherwise you are shown how many intersections need to be cleared before advancing to the next stage is possible.
Pressing the cross button resets the game and the arrow button lets you choose the difficulty level.
Developing
You can clone the project with Git by running:
$ git clone git://github.com/mkroehnert/JSPlanarity
or browse the source code on GitHub : mkroehnert/JSPlanarity
JSPlanarity is developed using the excellent Cloud9 IDE.
