Gary Beene’s gbUnSnarl game


Check out Gary Bene’s gbUnSnarl game. Your job is to drag the nodes in a network to unsnarl it.

Basically it asks you to find a way to rearrange a planar network so none of its edges intersect. Algorithms to prove that a network is planar are fairly complicated. The networks generated by the game are guaranteed to be planar, so there are always solutions. The only question is, “Can you find them?”

Follow me on Twitter   RSS feed   Donate

About RodStephens

Rod Stephens is a software consultant and author who has written more than 30 books and 250 magazine articles covering C#, Visual Basic, Visual Basic for Applications, Delphi, and Java.
This entry was posted in algorithms, games and tagged , , , , , , , , . Bookmark the permalink.