This is pretty choice - reminds me of untangling a circuit layout...
Never really looked into it that much, but I'd imagine there must be a mathematical technique that can be applied. My first instinct has always been to put the point with the most connections in the centre, then map out from that.
Take the vertex whose vertices cross the biggest number of other vertices and move it. Repeat until nothing crosses. I remember this problem in maths ages ago, there is a way to know if you can't untangle something- look up the water gas electricity problem
It would be interesting to couple this game with user profiles that include questions related to mysteries and observations in cognitive science. Thinks like left/right handed, formal education, would be interesting too.
I think this game won John "One of the Most Interesting People In Cleveland" when he wrote this sophomore year at CWRU. I'm happy to see that his project is still being enjoyed!
[+] [-] jurjenhaitsma|17 years ago|reply
[+] [-] boblol123|17 years ago|reply
[+] [-] eru|17 years ago|reply
[+] [-] madair|17 years ago|reply
[+] [-] barrettcolin|17 years ago|reply
[+] [-] smanek|17 years ago|reply
In fact, the "Way Back Machine" shows Planarity, basically unchanged, in 2005: http://web.archive.org/web/20050731231914/http://www.planari...
[+] [-] derwiki|17 years ago|reply
[+] [-] gord|17 years ago|reply
Used a combination of heuristics - move a vertex to the centroid of its neighbors, and move randomly to reduce edge intersections.
eyes burning.