hacker emblem
jaegerfesting
Search | Tags | Photos | Flights | Gas Mileage | Log in

You might be a cyborg if...

Posted by Jäger on 2005-09-12 13:00:37

World-readable

Perhaps I'm augmented, because I've made it through level 14, I believe. What I've found is that the higher levels don't really get more complicated, but they get more overwhelming; it's harder to visualize the solution without ignoring most of the vertices. Without careful planning, one tends to get back one's self into a corner, having to spend time rearranging the vertices.

My algorithm now is something like:

  1. Attempt to locate three vertices that form a triangle, and move them to the center of the plot. Failing that, pick one vertex at random and move linked vertices until I find a triangle (or square).
  2. Pick adjacent vertices and place them near the recently-placed vertices. Try to pick vertices that connect to two or more previously-placed vertices, it will be more obvious where they should go. Never place a vertex where an edge overlaps with a previously-placed edge. (Planarity renders edges grey when neither vertex has been moved, darker grey when only one vertex has been moved, and black when both vertices have been moved.)
  3. Repeat step 2 until all vertices have been placed.

Since the graps are guarenteed to be planar, they seem to have several interesting properties; I've never seen a vertex that connects to more than 5 or 6 other vertices, nor a closed cycle of edges, with no vertices in between, that is larger than 5 edges.


Reply

Baz Camp (2005-09-10 23:41:16)
If you haven't dreamt about conversing with your loved ones in
a programming language, you haven't programmed enough.
- Slashdot poll, Favorite Language?