Create a set of point pairs [(x,y),(x',y')), ((x,y),(x',y')),... bound the points by the rectangle min(x),min(y) by max(x), max(y). Create routes between every pair of points while staying within the bounding rectangle and not crossing any existing path.
This is a simple precursor to the planar routing problem faced by autorouters on PCBs and FPGAs etc. It makes for a fun graphical puzzle to solve arithmetically.
Create a set of point pairs [(x,y),(x',y')), ((x,y),(x',y')),... bound the points by the rectangle min(x),min(y) by max(x), max(y). Create routes between every pair of points while staying within the bounding rectangle and not crossing any existing path.
This is a simple precursor to the planar routing problem faced by autorouters on PCBs and FPGAs etc. It makes for a fun graphical puzzle to solve arithmetically.