strategy? 1) select some corner 2) look for node with 2 neighbors 3) put it to corner (1) 4) uncross neighbors to first node 5) use searching to weight of uncrossed nodes with crossed neighbors (with primary selection of node that has one crossed neighbor - else use intelect ;]) 6) uncross that node 7) repeat 5 until end ;]
Just completed level 22 today. Took approximately 100 minutes. Current score is over 400 million.
The main difficulty I am having now is the limited amount of space to put the graph.
I checked the first 5 levels for a pattern on the number of vertices and noticed the following:
# of vertices on level N = ((N + 2)(N + 3))/2
This formula gives the correct number of vertices on level 22 (there are 300).
I think I have a really good suggestion that would have helped at the higher levels. Someone already mention how the game slows down. That is true...because tof he algorithm that the game is using is checking all possible intersections. But it is maddening when you can plainly see intersections but have to wait for the algorithm to finish. If there was a way to stop the evaluation for a period of time, that would greatly reduce the frustration I am experiencing now.
