Komuro
This game is from ldjam.com, which is currently unavailable.
You can try viewing the original page on Web Archive (may not load correctly).
You can try viewing the original page on Web Archive (may not load correctly).
How to play:
1. Click on white edges to flip
2. Edges are flipped according to the triangles they form
3. Match edges to colors
Any two planar triangulations are connected by O(n^k) edge flips, despite the exponential number of such triangulations. Klaus Wagner proved that k <= 2 in 1936, and Hideo Komuro proved that k = 1 in 1997.
1. Click on white edges to flip
2. Edges are flipped according to the triangles they form
3. Match edges to colors
Any two planar triangulations are connected by O(n^k) edge flips, despite the exponential number of such triangulations. Klaus Wagner proved that k <= 2 in 1936, and Hideo Komuro proved that k = 1 in 1997.