Your score
Top score
Mins left
60
-
Downward pointing paths
x400 -
Non-crossing edge pairsx3
-
Edge lengthx1
-
Node distributionx1
-
Node edge separationx1
Your primary goal is to maximize the number of downward pointing paths from triangles to squares.
Example High Score solution
Here is an example of a good solution generated by crowd workers in a different game. Note: To reach such a good solution you should ignore the poor scores in the intermediate steps.
