Under rating threshold (hideshow)
Simple and relaxing, yet increasingly complex. I like that we can solve these at our own leisure. Anyway, I have some hints: 1) Dots with the most connections most likely go toward the edge. 2) Dots with only three connections should be in the middle of a triangle. 3) If you have less white lines while you move dots, then you're on the right track.
Under rating threshold (hideshow)
that feeling, when you untangle all dots, and only one white line remains. And you have to reposition all the dots again!
Under rating threshold (hideshow)
The best strategy is to first arrange the points that have the most strings attached. Once you arrange those so that none of their connecting lines cross, you can continue to points with less strings.
Under rating threshold (hideshow)
The text it displays on some of the levels is irritating, because it is exactly the same color as a unsatisfied line.
Under rating threshold (hideshow)
If you have no idea how to solve it, here's an easy approach which will get you a long way: Start by spreading out all the points in a circle, preferably with the outer ring all connected. Then, look at the points with the most and longest white lines going from it. Move those closer to all the points they are connected to, and repeat. This should give you a good starting position from which you can solve the rest.
Under rating threshold (hideshow)
an excellent game where some knowledge of graph-theory is helpful, I did find a method to solve any such puzzle but it took a bit of time to execute and is quite hard to explain in text.
Under rating threshold (hideshow)
Once you find the three points to the big triangle, it's not so hard. Identifying them can be tricky on a couple of the levels though.
Under rating threshold (hideshow)
Great game, with good difficulty. I've noticed a pattern in the puzzle, it appears that every level deteriorates into many interconnected triangles and a larger shape, like a dodecagon.
Under rating threshold (hideshow)
I think it would be awesome to lock dots in relation to each other. That way when I find a few dots that go together, I can move them as one group. Also, can you make a level generator for this? Awesome game. I love these puzzles
Under rating threshold (hideshow)
The theorem about when graphs are planar is a bit more complicated than Wesmania says: the rule is the graph cannot contain either of the two configurations he mentions as a 'minor'. In effect, this means you can't get them by pretending some connected set of points is really one point - so if you had four points all connected to each other, and a fifth point connected to two of them, and a sixth connected to the fifth and the other two, this wouldn't be planar.
Under rating threshold (hideshow)
But then, miraculously, Fáry's theorem and Wikipedia save the day. As for the first criteria, there's also an O(n) algorithm for that. Or at least Wiki says so.