[C# Helper]
Index Books FAQ Contact About Rod
[Essential Algorithms, Second Edition]

[The Modern C# Challenge]

[WPF 3d, Three-Dimensional Graphics with WPF and C#]

[The C# Helper Top 100]

[Interview Puzzles Dissected]

[C# 24-Hour Trainer]

[Beginning Software Engineering]

[C# 5.0 Programmer's Reference]

[MCSD Certification Toolkit (Exam 70-483): Programming in C#]

Title: Gary Beene's gbUnSnarl game

[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?"

© 2009-2022 Rocky Mountain Computer Consulting, Inc. All rights reserved.