Top 5 solutions

How to play Hypergraph Coloring?

The game is strictly related to main graph coloring application which is task scheduling. Each vertex represents a task, while edges represent scheduling limitations. Directed edge (A < B) means task A must be executed before B (i.e. task A is a calculation task and result of it is an input for task B). Undirected edge (A ≠ B) means task A and B cannot be executed at the same time (i.e. are sharing common memory pool, reading/writing to it). If a limitation is not meet edge will turn red. Vertical stripes are time slots. The goal is to arrange tasks (vertices) by dragging them, so all limitations are met and schedule takes least amount of time (use least time slots possible).

What is the point of input/output text windows?

All games on Koala Games site are related to some hard algorithmic problems. They can be solved both "by hand" (for fun) and by writing an external computer program. Your program should accept text input that you can copy from input window (hyper edges), solve and print out a result as text so you can simply paste it back to output window (vertex embedding).