flowblok

The laws of distributed systems are very commendable, but the only law that applies in Australia is the law of Australia.
@kouhai@social.treehouse.systems

That was a productive long weekend.

I think I’ve got a novel algorithm on my hands… unless of course, I’ve royally screwed up (possible, but I’m beginning to think improbable) or someone has already done it (in which case I’m confused why relatively recent papers were published).

Unfortunately, it will take some time to flesh out both the theory and implementation sides of the problem.

I was playing Untangle¹ from Simon Tatham's Portable Puzzle Collection the other day, in which you move vertices to remove crossing edges from a drawing/embedding of a simple, connected, planar graph with straight line segments.

Naturally, I was trying to do it with as few moves as possible, which prompted the question: for a graph with V vertices, what is the upper bound on the number of moves taken by the optimal player?

Connections
Puzzle #1016
🟪🟪🟪🟪
🟦🟦🟦🟦
🟩🟩🟩🟩
🟨🟨🟨🟨

Connections
Puzzle #1015
🟪🟪🟪🟪
🟨🟨🟨🟨
🟦🟦🟦🟦
🟩🟩🟩🟩

Connections
Puzzle #1014
🟪🟪🟪🟪
🟦🟦🟦🟦
🟩🟩🟩🟩
🟨🟨🟨🟨