Made it to level 7 so far. A heuristic that's working for me is take the node with the most crossing edges and move it to the other side of the crossed edge. It

Made it to level 7 so far. A heuristic that's working for me is take the node with the most crossing edges and move it to the other side of the crossed edge. Iterating on that tends to lead to a solution. Since the answer criteria is a layout with no edges crossing, the graphs must be planar. There's probably some primitive graph layout algorithm similar to this heuristic (along with a whole bunch of better ones that are less-suited for doing manually!)