Try playing this one for a while. I stopped at Level 13

### Search

### Tag Cloud

activesync annoyances apple batavia beach Biography Books cars christmas coldfusion Company diy Electronics Event facebook Fiction Food Game General Christian halloween ipad iphone isaac kids lucy MoviesAndTV oldblog osx OutdoorGear Person Place programming quantifiedself Restaurant sarah Software Store symetri sysadmin technology Theology trone webdev Website windows### Archives

“Congratulations, you have succesfully completed the game.”

btw, there are 20 levels. And it’s a lot easier if you hold your mouse 180 from usual (very easy to do with a chordless…)

Chordless? Sounds way over my head…

Google First Result:

Discrete Mathematics Graph Theory Circuits

Chordless Cycle

A chordless cycle of a graph G is a graph cycle of length at least four in G that has no cycle chord (i.e., the graph cycle is an induced subgraph). A chordal graph is a simple graph possessing no chordless cycles. A chordless cycle is sometimes also called a graph hole (Chvátal).