"Find a planar embedding or prove that one does not exist"

Jul 19, 2005 21:03

So went an infamous graph theory problem some years ago... and so it went today while playing level 4 of Planarity. This game is not hard at level 4, but this time I was stumped! After having no luck for about 5 minutes, I thought maybe I'd just missed something obvious, so I hit "Shuffle Vertices" and tried again. After a second failed effort, ( Read more... )

Leave a comment

Comments 1

jmpava July 20 2005, 04:50:29 UTC
Oh, is THAT what you were up to playing that thing for, like, 2 hours this morning at work... :-P

Reply


Leave a comment

Up